A View from the Engine Room: Computational Support for Symbolic Model Checking

Bryant, Randal E.

doi:10.1007/978-3-540-69850-0_9

Cited by 5 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the invention of symbolic model checking [8], there has been much work that used and implemented symbolic methods in model checking and for-mal verification [19]- [21]. Most of the work in this field combines symbolic model checking with BDDs [22]- [24]. The terms counterexample and witness were first used in combination with symbolic model checking in [25].…”

Section: Related Workmentioning

confidence: 99%

Generating and Employing Witness Automata for ACTLW Formulae

Vogrin

Meolic²,

Kapus³

2022

IEEE Access

View full text Add to dashboard Cite

When verifying the validity of a formula in a system model by a model checker, a common feature is the generation of a linear witness or counterexample, which is a computation path usually showing a single reason why the formula is valid or, respectively, not. For systems represented with Labeled Transition Systems (LTS) and a subset of ACTLW (Action-based Computation Tree Logic with Unless operator) formulae, a procedure exists for the generation of witness automata, which contain all the interesting finite linear witnesses, thus revealing all the reasons of the validity of a formula. Although this procedure uses a symbolic representation of LTSs, transitions of a given LTS are traversed one by one. In this paper, we propose a procedure which exploits the symbolic representation efficiently to traverse several transitions at once. We evaluate the procedure on models of a communication protocol from industry and a biological system. The results show it to be at least several times faster than the former one. Witness automata were first introduced to allow for compositional generation of test sequences. We propose two more possible uses. One is for the detection of multiple errors in a model by exploring the witness automaton for a formula, instead of only one, which is usually the case with a single witness. The other one is for the detection of previously unknown system properties. As witness automata can be rather large, we show how some existing tools could help in examining them through visualization and simulation.INDEX TERMS Automata, formal verification, logic, model checking.

show abstract

Section: Related Workmentioning

confidence: 99%

Generating and Employing Witness Automata for ACTLW Formulae

Vogrin

Meolic²,

Kapus³

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…By way of contrast, the natural way to existentially quantify using a SAT solver is to systematically enumerate the models of a formula using blocking clauses. Even when the blocking clauses only constrain the variables in the projection space, such methods are inefficient when compared to BDD-based techniques because of the large number of models that may need to be enumerated [6]. This would be less of a problem if projection was an infrequent operation in abstract interpretation; the guiding principle in domain design is that the commonly arising operations should be fast whereas the speed of the infrequent operations is less critical.…”

Section: Quantifier Elimination and Abstract Interpretationmentioning

confidence: 99%

“…BDDs have been widely applied, both in symbolic model checking [7], and as an abstract domain for tracking dependences [1]. Although some niche problems remain difficult for SAT [6], clever ideas and careful engineering have advanced DPLL-based SAT solvers [22] to the point they can rapidly decide the satisfiability of structured problems that involve thousands of variables. Conseqently SAT has been almost universally adopted within symbolic model checking [9].…”

Section: Introductionmentioning

confidence: 99%

Approximate Quantifier Elimination for Propositional Boolean Formulae

Brauer

King²

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining overapproximations of a given formula. This construction naturally leads to an anytime algorithm, that is, it can be interrupted at anytime without compromising soundness. This contrasts with classical monolithic (all or nothing) approaches based on resolution or model enumeration.

show abstract

“…It also occurs in predicate abstraction [21] from which we take an example [9] that we develop in what follows. In predicate abstraction, a finite set of predicates is used to express properties of and relationships between program variables at different points in the program.…”

Section: Introductionmentioning

confidence: 99%

“…Quantifier elimination arises when computing successor states. Adapting an example from [9], suppose the predicates X = {x 1 , . .…”

Section: Introductionmentioning

confidence: 99%

Existential Quantification as Incremental SAT

Brauer

King

Kriener

2011

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. This paper presents an elegant algorithm for existential quantifier elimination using incremental SAT solving. This approach contrasts with existing techniques in that it is based solely on manipulating the SAT instance rather than requiring any reengineering of the SAT solver or needing an auxiliary data-structure such as a BDD. The algorithm combines model enumeration with the generation of shortest prime implicants so as to converge onto a quantifier-free formula presented in CNF. We apply the technique to a number of hardware circuits and transfer functions to demonstrate the effectiveness of the method.

show abstract

A View from the Engine Room: Computational Support for Symbolic Model Checking

Cited by 5 publications

References 16 publications

Generating and Employing Witness Automata for ACTLW Formulae

Generating and Employing Witness Automata for ACTLW Formulae

Approximate Quantifier Elimination for Propositional Boolean Formulae

Existential Quantification as Incremental SAT

Contact Info

Product

Resources

About