Symbolic Model Checking without BDDs

Biere, Armin; Cimatti, Alessandro; Clarke, Edmund M.; Zhu, Yunshan

doi:10.1007/3-540-49059-0_14

Cited by 1,365 publications

(1,111 citation statements)

References 13 publications

(8 reference statements)

Supporting

Mentioning

1,099

Contrasting

Unclassified

Order By: Relevance

“…In a similar way, the structure of the problem is another source of improvements of the approximations. For example, 2 ⊗ x being exactly computed 3 , it can directly be evaluated over R.…”

Section: Generalizationmentioning

confidence: 99%

See 1 more Smart Citation

Boosting Local Consistency Algorithms over Floating-Point Numbers

Belaid¹,

Michel²,

Rueher³

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Solving constraints over oating-point numbers is a critical issue in numerous applications notably in program veri cation. Capabilities of ltering algorithms over the oating-point numbers (F) have been so far limited to 2b-consistency and its derivatives. Though safe, such ltering techniques su er from the well known pathological problems of local consistencies, e.g., inability to e ciently handle multiple occurrences of the variables. These limitations also have their origins in the strongly restricted oating-point arithmetic. To circumvent the poor properties of oating-point arithmetic, we propose in this paper a new ltering algorithm, called FPLP, which relies on various relaxations over the real numbers of the problem over F. Safe bounds of the domains are computed with a mixed integer linear programming solver (MILP) on safe linearizations of these relaxations. Preliminary experiments on a relevant set of benchmarks are promising and show that this approach can be e ective for boosting local consistency algorithms over F. IntroductionCritical systems are more and more relying on oating-point (FP) computations. For instance, embedded systems are typically controlled by software that store measurements and environment data as oating-point number (F). The initial values and the results of all operations must therefore be rounded to some nearby oat. This rounding process can lead to signi cant changes, and, for example, can modify the control ow of the program. Thus, the veri cation of programs performing FP computations is a key issue in the development of critical systems.Methods for verifying programs performing FP computations are mainly derived from standard program veri cation methods. Bounded model checking (BMC) techniques have been widely used for nding bugs in hardware design [3] and software [11]. SMT solvers are now used in most of the state-of-the-art BMC tools to directly work on high level formula (see [2,9,11]). The bounded model checker CBMC encodes each FP operation of the program with a set of logic This work was partially supported by ANR VACSIM (ANR-11-INSE-0004), ANR AEOLUS (ANR-10-SEGI-0013) and OSEO ISI PAJERO projects.

show abstract

Section: Generalizationmentioning

confidence: 99%

“…Bounded model checking (BMC) techniques have been widely used for nding bugs in hardware design [3] and software [11]. SMT solvers are now used in most of the state-of-the-art BMC tools to directly work on high level formula (see [2,9,11]).…”

Section: Introductionmentioning

confidence: 99%

Boosting Local Consistency Algorithms over Floating-Point Numbers

Belaid¹,

Michel²,

Rueher³

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…UCTL includes both the branching-time action-based logic ACTL [10,11] and the branching-time state-based logic CTL [7]. 3 Before defining the syntax of UCTL, we introduce an auxiliary logic of events.…”

Section: Definition 2 (Doubly Labelled Transition System) a Doubly Lmentioning

confidence: 99%

“…This is a consequence of the "depth-first" recursive structure of the algorithm. The solution taken to solve this problem consists of adopting a bounded modelchecking approach [3], i.e. the evaluation is started assuming a certain value as limit of the maximum depth of the evaluation.…”

Section: The Uctl Model Checker Umcmentioning

confidence: 99%

An Action/State-Based Model-Checking Approach for the Analysis of Communication Protocols for Service-Oriented Applications

Beek

Gnesi

Mazzanti

2008

Formal Methods for Industrial Critical Systems

View full text Add to dashboard Cite

Abstract. In this paper we present an action/state-based logical framework for the analysis and verification of complex systems, which relies on the definition of doubly labelled transition systems. The defined temporal logic, called UCTL, combines the action paradigm-classically used to describe systems using labelled transition systems-with predicates that are true over states-as captured when using Kripke structures as semantic model. An efficient model checker for UCTL has been realized, exploiting an on-the-fly algorithm. We then show how to use UCTL, and its model checker, in the design phase of an asynchronous extension of the communication protocol SOAP, called aSOAP. For this purpose, we describe aSOAP as a set of communicating UML state machines, for which a semantics over doubly labelled transition systems has been provided.

show abstract

“…Symbolic Model Checking (Burch et al, 1990) has made the treatment of large statespaces possible by using special data structures (i.e., Binary Decision Diagrams) to encode them succinctly. More recently, Bounded Model Checking (Biere et al, 1999(Biere et al, , 2003Clarke et al, 2001) has profited from the developments in SAT solvers. This is done by limiting the length of the counterexamples one is searching for, which allows an efficient translation of the resulting problem to an instance of SAT.…”

Section: Model Checkingmentioning

confidence: 99%

Verification of behaviourist multi-agent systems by means of formally guided simulations

Silva¹

View full text Add to dashboard Cite

Symbolic Model Checking without BDDs

Cited by 1,365 publications

References 13 publications

Boosting Local Consistency Algorithms over Floating-Point Numbers

Boosting Local Consistency Algorithms over Floating-Point Numbers

An Action/State-Based Model-Checking Approach for the Analysis of Communication Protocols for Service-Oriented Applications

Verification of behaviourist multi-agent systems by means of formally guided simulations

Contact Info

Product

Resources

About