Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs

Authors:
Greta Yorsh;Alexey Skidanov;Thomas Reps;Mooly Sagiv
Affiliations:
School of Comp. Sci., Tel-Aviv Univ.;School of Comp. Sci., Tel-Aviv Univ.;Comp.Sci.Dept., Univ. of Wisconsin.;School of Comp. Sci., Tel-Aviv Univ.
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 4
Cited 3

Using data groups to specify and check side effects

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Finite differencing of logical formulas for static analysis

ESOP'03 Proceedings of the 12th European conference on Programming

Implications of a Data Structure Consistency Checking System

Verified Software: Theories, Tools, Experiments
Field constraint analysis

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Explicit stabilisation for modular rely-guarantee reasoning

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Assume/Guarantee (A/G) reasoning for heap-manipulating programs is challenging because the heap can be mutated in an arbitrary way by procedure calls. Moreover, specifying the potential side-effects of a procedure is non-trivial. We report on an on-going effort to reduce the burden of A/G reasoning for heap-manipulating programs by automatically generating post-conditions and estimating side-effects of non-recursive procedures. Our method is sound. It combines the use of theorem provers and abstract-interpretation algorithms.