Efficient Computation of Recurrence Diameters

Kroening, Daniel; Strichman, Ofer

doi:10.1007/3-540-36384-x_24

Cited by 85 publications

(66 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In theory, there is still a completeness threshold that may be reach in some cases of the satisfiability checking. Even in such cases, the advantage is that we do not need to know the completeness threshold for which the cost for the calculation is high [1,13] and an over-approximation can be quite large.…”

Section: Discussionmentioning

confidence: 99%

Model Checking with SAT-Based Characterization of ACTL Formulas

Zhang

2007

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties have been studied and used as the theoretical basis for SAT-based bounded model checking [2,18]. This has led to a lot of successful work with respect to error detection in the checking of LTL and ACTL (the universal fragment of CTL) properties by satisfiability testing. Bounded semantics of LTL with the universal interpretation and that of ACTL, and the characterization of such properties by propositional formulas have not been successfully established and this hinders practical verification of valid universal properties by satisfiability checking. This paper studies this problem and the contribution is a bounded semantics for ACTL and a characterization of ACTL properties by propositional formulas. Firstly, we provide a simple bounded semantics for ACTL without considering the practical aspect of the semantics, based on converting a Kripke model to a model (called a k-model) in which the transition relation is captured by a set of k-paths (each path with k transitions). This bounded semantics is not practically useful for the evaluation of a formula, since it involves too many paths in the k-model. Then the technique is to divide the k-model into submodels with a limited number of k-paths (which depends on k and the ACTL property to be verified) such that if an ACTL property is true in every such model, then it is true in the k-model as well. This characterization can then be used as the basis for practical verification of valid ACTL properties by satisfiability checking. A simple case study is provided to show the use of this approach for both verification and error detection of an abstract two-process program written as a first order transition system.

show abstract

Section: Discussionmentioning

confidence: 99%

Model Checking with SAT-Based Characterization of ACTL Formulas

Zhang

2007

Formal Methods and Software Engineering

View full text Add to dashboard Cite

show abstract

“…Thus an interesting future improvement in the SAT solver technology would be to enhance the constraint language of solvers so that they could handle mutual disequality of sets of Boolean vectors natively. An alternative approach would be to develop an incremental version of the more compact loop free predicate presented in [2]. In addition, we haven't tried adding the simple path constraints lazily on-demand as is done in [14].…”

Section: Optimising the Encodingmentioning

confidence: 99%

“…This bound, referred to as the completeness threshold [2], depends on the system, the property, and how the problem is mapped to SAT. Computing a tight bound on the completeness threshold is a challenging problem.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Incremental and Complete Bounded Model Checking for Full PLTL

Heljanko¹,

Junttila²,

Latvala³

2005

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. Recently, some progress has been made towards proving properties of LTL. We present an incremental and complete bounded model checking method for the full linear temporal logic with past (PLTL). Compared to previous works, our method both improves and extends current results in many ways: (i) our encoding is incremental, resulting in improvements in performance, (ii) we can prove non-existence of a counterexample at shallower depths in many cases, and (iii) we support full PLTL. We have implemented our method in the NuSMV2 model checker and report encouraging experimental results.

show abstract

“…If the formula is not satisfiable, the state machine and its specification are unwound more to determine if a longer counterexample exists. This process terminates when the length of the potential counterexample exceeds its completeness threshold (i.e., is sufficiently long to ensure that no counterexample exists [7]) or when the SAT procedure exceeds its time or memory bounds. BMC has been successfully used to find subtle errors in very large circuits [12,6,3].…”

Section: Introductionmentioning

confidence: 99%

Specifying and verifying systems with multiple clocks

Clarke

Kroening

Yorav

Proceedings 21st International Conference on Computer Design

View full text Add to dashboard Cite

Multiple clock domains are a challenge for hardware specification and verification. We present a method for specifying the relations between multiple clocks, and for modeling the possible behaviors. We can then verify a hardware design assuming that the clocks meet these constraints. We implement our ideas in the context of SAT based Bounded Model Checking (BMC), using ANSI-C programs to specify the functional behavior of the design.

show abstract

Efficient Computation of Recurrence Diameters

Cited by 85 publications

References 11 publications

Model Checking with SAT-Based Characterization of ACTL Formulas

Model Checking with SAT-Based Characterization of ACTL Formulas

Incremental and Complete Bounded Model Checking for Full PLTL

Specifying and verifying systems with multiple clocks

Contact Info

Product

Resources

About