Automated verification of recursive programs with pointers

Authors:
Frank de Boer;Marcello Bonsangue;Jurriaan Rot
Affiliations:
Leiden Institute of Advanced Computer Science (LIACS), Leiden, Netherlands, Centrum Wiskunde en Informatica (CWI), Amsterdam, Netherlands;Leiden Institute of Advanced Computer Science (LIACS), Leiden, Netherlands;Leiden Institute of Advanced Computer Science (LIACS), Leiden, Netherlands
Venue:
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Year:
2012

Citing 14
Cited 0

Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems

Journal of the ACM (JACM)
Calculating sharp adaptation rules

Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
Modal logic

Modal logic
Dynamic Logic

Dynamic Logic
Verifying reachability invariants of linked structures

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Decidable Logic for Describing Linked Data Structures

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The Hybrid µ-Calculus

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Verifying properties of well-founded linked lists

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Logic-Based Framework for Reasoning about Composite Data Structures

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Undecidability of Propositional Separation Logic and Its Neighbours

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Decidable logics combining heap structures and data

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A logic of reachable patterns in linked data-structures

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A decidable fragment of separation logic

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a fully automated method for the verification of annotated recursive programs with dynamic pointer structures. Assertions are expressed in a dialect of dynamic logic extended with nominals and tailored to heap structures, in which one can express complex reachability properties. Verification conditions are generated using a novel calculus for computing the strongest postcondition of statements manipulating the heap, such as dynamic allocation and field-assignment. Further, we introduce a new decidable tableaux-based method and its prototype implementation to automatically check these verification conditions.