Blogs (1) >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais, Portugal
Tue 15 Jan 2019 14:00 - 14:30 at Sala III - Software Verification Chair(s): Grigory Fedyukovich

Our aim is to statically verify that in a given reactive program, the length of collection variables does not grow beyond a given bound. We propose a scalable type-based technique that checks that each collection variable has a given refinement type that specifies constraints about its length. A novel feature of our refinement types is that the refinements can refer to AST counters that track how many times an AST node has been executed. This feature enables type refinements to track limited flow-sensitive information. We generate verification conditions that ensure that the AST counters are used consistently, and that the types imply the given bound. The verification conditions are discharged by an off-the-shelf SMT solver. Experimental results demonstrate that our technique is scalable, and effective at verifying reactive programs with respect to requirements on length of collections.

Tue 15 Jan

Displayed time zone: Belfast change

14:00 - 15:30
Software VerificationVMCAI at Sala III
Chair(s): Grigory Fedyukovich Princeton University
14:00
30m
Talk
Type-directed Bounding of Collections in Reactive Programs
VMCAI
Tianhan Lu University of Colorado Boulder, Pavol Cerny University of Colorado Boulder, Bor-Yuh Evan Chang University of Colorado Boulder, Ashutosh Trivedi
14:30
30m
Talk
Exploiting Pointer Analysis in Memory Models for Deductive Verification
VMCAI
Quentin Bouillaguet , François Bobot CEA, Mihaela Sighireanu IRIF, University Paris Diderot and CNRS, France, Boris Yakobowski CEA - LIST
File Attached
15:00
30m
Talk
Small Faults Grow Up - Verification of Error Masking Robustness in Arithmetically Encoded Programs
VMCAI
Anja Karl Institute of Applied Information Processing and Communications, Graz University of Technology, Robert Schilling , Roderick Bloem Institute of Software Technology, Graz University of Technology , Stefan Mangard