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

We study the problem of completely automatically verifying uninterpreted programs— programs that work over arbitrary data models that provide an interpretation for the constants, functions and relations the program uses. The verification problem asks whether a given program satisfies a postcondition written using quantifier-free formulas with equality on the final state, with no loop invariants, contracts, etc. being provided. We show that this problem is undecidable in general. The main contribution of this paper is a subclass of programs, called coherent programs that admits decidable verification, and can be decided in PSPACE. We then extend this class of programs to classes of programs that are k-coherent, where k is a natural number, obtained by (automatically) adding k ghost variables and assignments that make them coherent. We also extend the decidability result to programs with recursive function calls and prove several undecidability results that show why our restrictions to obtain decidability seem necessary.

Talk Slides (POPL19-talk.pptx)2.35MiB

Fri 18 Jan
Times are displayed in time zone: (GMT+01:00) Greenwich Mean Time : Belfast change

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
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
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
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