Verification by abstract interpretation, soundness and abstract induction

Cousot, Patrick

doi:10.1145/2790449.2790451

Cited by 3 publications

(1 citation statement)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A related technique for approximation of array behavior was recently presented in [23]. A number of abstract interpretation methods have domains that represent universally quantified facts [9,13]. In our approach, like in [4] we aim to avoid the explicit construction of abstract post operators, widening and refinement procedures needed in these approaches.…”

Section: Related Workmentioning

confidence: 99%

Quantified Heap Invariants for Object-Oriented Programs

Kahsai

Kersten

Rümmer

et al.

EPiC Series in Computing

View full text Add to dashboard Cite

Heap and data structures represent one of the biggest challenges when applying model checking to the analysis of software programs: in order to verify (unbounded) safety of a program, it is typically necessary to formulate quantified inductive invariants that state properties about an unbounded number of heap locations. Methods like Craig interpolation, which are commonly used to infer invariants in model checking, are often ineffective when a heap is involved. To address this challenge, we introduce a set of new proof and program transformation rules for verifying object-oriented programs with the help of space invariants, which (implicitly) give rise to quantified invariants. Leveraging advances in Horn solving, we show how space invariants can be derived fully automatically, and how the framework can be used to effectively verify safety of Java programs.

show abstract