Model-checking concurrent systems with unbounded integer variables

Bultan, Tevfik; Gerber, R.; Pugh, William

doi:10.1145/325478.325480

Cited by 93 publications

(64 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In order to cope with this limitation, various decidable subclasses of systems and formulas have been identified (see, for instance, [1,15]). Other approaches enhance finite state model checking by using more general deductive techniques (see, for instance, [33,37]) or using abstractions, by which one can compute conservative approximations of the set of states verifying a given property (see, for instance, [2,6,8,11,19,20]). …”

Section: Introductionmentioning

confidence: 99%

Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation

Fioravanti

Pettorossi

Proietti

et al. 2011

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. We address the problem of the automated verification of temporal properties of infinite state reactive systems. We present some improvements of a verification method based on the specialization of constraint logic programs (CLP). First, we reformulate the verification method as a two-phase procedure: (1) in the first phase a CLP specification of an infinite state system is specialized with respect to the initial state of the system and the temporal property to be verified, and (2) in the second phase the specialized program is evaluated by using a bottom-up strategy. In this paper we propose some new strategies for performing program specialization during the first phase. We evaluate the effectiveness of these new strategies, as well as that of some old strategies, by presenting the results of experiments performed on several infinite state systems and temporal properties. Finally, we compare the implementation of our specialization-based verification method with various constraint-based model checking tools. The experimental results show that our method is effective and competitive with respect to the methods used in those other tools.

show abstract

Section: Introductionmentioning

confidence: 99%

Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation

Fioravanti

Pettorossi

Proietti

et al. 2011

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

show abstract

“…In this representation, a Presburger formula is represented as the union of a finite list of polyhedra, . Note that PRE(p B j r B i ) can be computed by existentially eliminating boolean variable using a BDD manipulator [34] and PRE(p I j r I i ) can be computed by calling Presburger arithmetic manipulator [9]. Same observation holds for POST function.…”

Section: Integer Constraints Based Infinite Approachmentioning

confidence: 93%

“…This is due to the fact that BDD symbolic representations are specialized for encoding boolean variables and become inefficient when used to represent integer constraints, which should be represented by more efficient Presburger arithmetic formulas. Infinite-state representations based on linear arithmetic constraints have been used in verification of real-time systems, and infinite-state systems [3,9,27] which are not possible to verify using explicit representations. Action Language Verifier [7], based upon Composite Symbolic Library [46] that manipulated both BDD and Presburger package, is such an infinite-state symbolic model checker developed for automated verification of CTL properties of Action Language specifications.…”

Section: Integer Constraints Based Infinite Approachmentioning

confidence: 99%

Formal Verification of e-Services and Workflows

Bultan

2002

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We study the verification problem for e-service (and workflow) specifications, aiming at efficient techniques for guiding the construction of composite e-services to guarantee desired properties (e.g., deadlock avoidance, bounds on resource usage, response times). Based on previously proposed e-service frameworks such as AZTEC and e-FLow, decision flow language Vortex, and our early work on verifying Vortex specifications using model checking and infinite state verification tools, we introduce a very simple e-service model for our investigation of verification issues. We first show how three different model checking techniques are applied to verification of specifications in simple e-service model, where the number of processes is limited to a predetermined number. We then introduce pid quantified constraints, a new symbolic representation that can encode infinite system states, to verify systems with unbounded and dynamic process instantiations. We think that it is a versatile technique and more suitable for verification of e-service specifications. If this is combined with other techniques such as abstraction and widening, it is possible to solve a large category of interesting verification problems for e-services.

show abstract

“…Although some authors in this track also use widening techniques [19,20], most of these works aim at computing reachable states exactly, when possible. For that, the notion of "acceleration" has been introduced, to compute the effect of a loop.…”

Section: Acceleration Techniques For Exact Computationsmentioning

confidence: 99%

Abstract acceleration in linear relation analysis

Gonnord

Schrammel

2014

Science of Computer Programming

View full text Add to dashboard Cite

Linear Relation Analysis [28,39] is now a classical abstract interpretation based on an approximation of reachable numerical states of a program by convex polyhedra. Since it works with a lattice of infinite depth, it makes use of a widening operator to enforce the convergence of fixpoint computations. This paper takes place in the many attempts to improve the precision of the results reached using such a widening. It will first present an extended survey of the existing approaches in that direction. Then it will investigate the cases where the exact (abstract) effect of a loop can be computed. This technique is fully compatible with the use of widening, and whenever it applies, it generally improves both the precision and the performances of the analysis.

show abstract

Model-checking concurrent systems with unbounded integer variables

Cited by 93 publications

References 30 publications

Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation

Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation

Formal Verification of e-Services and Workflows

Abstract acceleration in linear relation analysis

Contact Info

Product

Resources

About