scholarly journals Quantified Heap Invariants for Object-Oriented Programs

10.29007/zrct ◽  
2018 ◽  
Author(s):  
Temesghen Kahsai ◽  
Rody Kersten ◽  
Philipp Rümmer ◽  
Martin Schäf
Keyword(s):  
Model Checking ◽  
Data Structures ◽  
Program Transformation ◽  
Object Oriented ◽  
Craig Interpolation ◽  
Transformation Rules ◽  
Java Programs ◽  
Software Programs ◽  
Inductive Invariants

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.

Verification of MPI Java programs using software model checking

2016 ◽  
Vol 51 (8) ◽  
pp. 1-2
Author(s):  
Waqas Ur Rehman ◽  
Muhammad Sohaib Ayub ◽  
Junaid Haroon Siddiqui
Keyword(s):  
Model Checking ◽  
Software Model Checking ◽  
Software Model ◽  
Java Programs

scholarly journals Program Verification using Constraint Handling Rules and Array Constraint Generalizations

10.29007/dkxs ◽  
2018 ◽  
Author(s):  
Emanuele De Angelis ◽  
Fabio Fioravanti ◽  
Alberto Pettorossi ◽  
Maurizio Proietti
Keyword(s):  
Data Structures ◽  
Program Verification ◽  
Linear Constraints ◽  
Constraint Handling ◽  
Logic Programs ◽  
Replacement Strategy ◽  
Partial Correctness ◽  
Transformation Rules ◽  
Constraint Logic Programs ◽  
Additional Constraints

The transformation of constraint logic programs (CLP programs)has been shown to be an effective methodologyfor verifying properties of imperative programs.By following this methodology, we encode the negationof a partial correctness property of an imperativeprogram prog as a predicate incorrect defined by a CLP program P, and we show thatprog is correct by transforming P intothe empty program through the applicationof semantics preserving transformation rules.Some of these rules perform replacements of constraintsthat encode properties of the data structures manipulatedby the program prog.In this paper we show that Constraint Handling Rules (CHR)are a suitable formalism for representing and applyingconstraint replacements during the transformation of CLP programs.In particular, we consider programs that manipulate integerarrays and we present a CHR encoding of a constraint replacementstrategy based on the theory of arrays.We also propose a novel generalization strategy forconstraints on integer arrays that combinesthe CHR constraint replacement strategywith various generalization operator for linear constraints,such as widening and convex hull.Generalization is controlled by additional constraintsthat relate the variable identifiers in the imperativeprogram and the CLP representation of their values.The method presented in this paper has been implemented andwe have demonstrated itseffectiveness on a set ofbenchmark programs taken from the literature.

Sign in / Sign up

Export Citation Format

Share Document