Blogs (1) >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais, Portugal
Fri 18 Jan 2019 15:43 - 16:05 at Sala II - Program Analysis I Chair(s): Michael D. Adams

We introduce the abstract domain of correlations to denote equality relations between parts of inputs and outputs of programs. We formalise the theory of correlations, and mechanically verify their semantic properties. We design a static inter-procedural dataflow analysis for automatically inferring correlations for programs written in a first-order language equipped with algebraic data-types and arrays. The analysis, its precision and execution cost, have been evaluated on the code and functional specification of an industrial-size micro-kernel. We exploit the inferred correlations to automatically discharge two thirds of the proof obligations related to the preservation of invariants for this micro-kernel.

Slides (popl19_talk.pdf)553KiB

Fri 18 Jan

POPL-2019-Research-Papers
15:21 - 16:27: Research Papers - Program Analysis I at Sala II
Chair(s): Michael D. AdamsUniversity of Utah
POPL-2019-Research-Papers15:21 - 15:43
Talk
Umang MathurUniversity of Illinois at Urbana-Champaign, P. MadhusudanUniversity of Illinois at Urbana-Champaign, Mahesh ViswanathanUniversity of Illinois at Urbana-Champaign
Link to publication DOI Pre-print Media Attached File Attached
POPL-2019-Research-Papers15:43 - 16:05
Talk
Oana-Fabiana AndreescuInternet of Trust, Thomas P. JensenINRIA Rennes, Stéphane LescuyerProve & Run, Benoît MontaguProve & Run
Link to publication DOI Pre-print Media Attached File Attached
POPL-2019-Research-Papers16:05 - 16:27
Talk
Johannes SpäthFraunhofer IEM, Karim AliUniversity of Alberta, Eric BoddenHeinz Nixdorf Institut, Paderborn University and Fraunhofer IEM
Link to publication DOI Pre-print Media Attached File Attached