Abstraction in Software Model Checking: Principles and Practice

Dams, Dennis

doi:10.1007/3-540-46017-9_4

Cited by 8 publications

(2 citation statements)

References 52 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Java PathFinder [22], BeBop [2] and SLAM [3] use predicate abstraction. We refer to [11] for an extended overview of tools and techniques for abstract model checking.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

An abstract interpretation toolkit for μCRL

Espada

Pol

2006

Form Method Syst Des

View full text Add to dashboard Cite

This paper describes a toolkit that assists in the task of generating abstract approximations of process algebraic specifications written in the language µCRL. Abstractions are represented by Modal Labelled Transition Systems, which are mixed transition systems with may and must modalities. The approach permits to infer the satisfaction or refutation of safety and liveness properties expressed in the (action-based) µ-calculus. The tool supports the abstraction of states and action labels, which allows to deal with infinitely branching systems.Keywords Model checking . Process algebra . muCRL . Abstract interpretation 1 Introduction

show abstract

“…Java PathFinder [22], BeBop [2] and SLAM [3] use predicate abstraction. We refer to [11] for an extended overview of tools and techniques for abstract model checking.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

An abstract interpretation toolkit for μCRL

Espada

Pol

2006

Form Method Syst Des

View full text Add to dashboard Cite

show abstract

“…Abstract interpretation is one well-established solution to automatically construct smaller and sound models, which may be analyzed by model checking tools (see [7], [16], [10], [2]). This method, employed in tools like JPF, BANDERA or αSPIN, is partial, because it consists in constructing an overapproximation of the program, where non-realistic paths are possible.…”

Section: Introductionmentioning

confidence: 99%

Implementing Influence Analysis Using Parameterised Boolean Equation Systems

Gallardo

Joubert

Merino

2006

Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (Isola 2006)

View full text Add to dashboard Cite

Abstract-The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex data structures. One recent and promising approach to deal with this problem is the construction of an abstract and correct representation of the global program state allowing to match visited states during program model exploration. In particular, one powerful method to implement abstract matching is to fill the state vector with a minimal amount of relevant variables for each program point. In this paper, we combine the on-the-fly model checking approach (incremental construction of the program state space) and the static analysis method called influence analysis (extraction of significant variables for each program point) in order to automatically construct an abstract matching function. Firstly, we describe the problem as an alternation-free value-based µ-calculus formula, whose validity can be checked on the program model expressed as a labeled transition system (LTS). Secondly, we translate the analysis into the local resolution of a parameterised boolean equation system (PBES), whose representation enables a more efficient construction of the resulting abstract matching function. Finally, we show how our proposal has been elegantly integrated into CADP, a generic framework for both the design and analysis of distributed systems and the development of verification tools.

show abstract