BMC via On-the-Fly Determinization

Jussila, Toni; Heljanko, Keijo; Niemelä, Ilkka

doi:10.1016/s1571-0661(05)82543-5

Cited by 10 publications

(11 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We directly capture the partial order in difference logic, therefore differing from CheckFence [27], which explicitly encodes ordering between all pairs of events in pure Boolean logic. In [28], a non-standard synchronous execution model is used to schedule multiple events simultaneously whenever possible instead of using the standard interleaving model. Furthermore, all the aforementioned methods were applied to whole programs and not to concurrent trace programs (CTPs).…”

Section: Related Workmentioning

confidence: 99%

Trace-Based Symbolic Analysis for Atomicity Violations

Wang¹,

Limaye

Ganai³

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trace and the program source code to construct a symbolic predictive model, which captures a large set of alternative interleavings of the events of the given trace. We use precise symbolic reasoning with a satisfiability modulo theory (SMT) solver to check the feasible interleavings for atomicity violations. Our algorithm differs from the existing methods in that all reported atomicity violations can appear in the actual program execution; and at the same time the feasible interleavings analyzed by our model are significantly more than other predictive models that guarantee the absence of false alarms.

show abstract

Section: Related Workmentioning

confidence: 99%

Trace-Based Symbolic Analysis for Atomicity Violations

Wang¹,

Limaye

Ganai³

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Usually bounded model checking papers take the system transition relation T (s, s ′ ) as given and do not try to exploit any special properties it might have. By more careful encoding of T (s, s ′ ) significant performance gains can be obtained, at least for special classes of systems such as asynchronous systems [Hel01,HN03,JHN05,Jus05].…”

Section: Discussionmentioning

confidence: 99%

Linear Encodings of Bounded LTL Model Checking

Biere

Heljanko²,

Junttila³

et al. 2006

Logical Methods in Computer Science

Self Cite

148

188

View full text Add to dashboard Cite

Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthermore, we show how the encodings can be extended to LTL with past operators (PLTL). The generalised encoding is still of linear size, but cannot detect minimal length counterexamples. By using the virtual unrolling technique minimal length counterexamples can be captured, however, the size of the encoding is quadratic in the specification. We also extend virtual unrolling to Büchi automata, enabling them to accept minimal length counterexamples.Our BMC encodings can be made incremental in order to benefit from incremental SAT technology. With fairly small modifications the incremental encoding can be further enhanced with a termination check, allowing us to prove properties with BMC.An analysis of the liveness-to-safety transformation reveals many similarities to the BMC encodings in this paper. We conduct experiments to determine the advantage of employing dedicated BMC encodings for PLTL over combining more general but potentially less efficient approaches with BMC: the liveness-to-safety transformation with invariant checking and Büchi automata with fair cycle detection.Experiments clearly show that our new encodings improve performance of BMC considerably, particularly in the case of the incremental encoding, and that they are very competitive for finding bugs. Dedicated encodings seem to have an advantage over using more general methods with BMC. Using the liveness-to-safety translation with BDD-based invariant checking results in an efficient method to find shortest counterexamples that complements the BMC-based approach. For proving complex properties BDD-based methods still tend to perform better.

show abstract

“…A straightforward way to apply Bounded Model Checking [2] to an asynchronous system is to unroll its interleaving transition relation k times to cover all executions of k steps [18]. Consider a system that performs one of n possible atomic actions in each execution step.…”

Section: Comparison To Related Workmentioning

confidence: 99%

“…Using alternative execution semantics [18,11], several independent actions can occur in a single step of BMC, allowing longer executions to be analyzed without considerably growing the encoding. In [27], partial order reductions are implemented on top of BMC by adding a constraint that each pair of independent actions can occur at consecutive time steps only in one predefined order.…”

Section: Comparison To Related Workmentioning

confidence: 99%

Checking Bounded Reachability in Asynchronous Systems by Symbolic Event Tracing

Dubrovin¹

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This report presents a new symbolic technique for checking reachability properties of asynchronous systems by reducing the problem to satisfiability in restrained difference logic. The analysis is bounded by fixing a finite set of potential events, each of which may occur at most once in any order. The events are specified using high-level Petri nets. The logic encoding describes the space of possible causal links between events rather than possible sequences of states as in Bounded Model Checking. Independence between events is exploited intrinsically without partial order reductions, and the handling of data is symbolic. On a family of benchmarks, the proposed approach is consistently faster than Bounded Model Checking. In addition, this report presents a compact encoding of the restrained subset of difference logic in propositional logic.

show abstract

BMC via On-the-Fly Determinization

Cited by 10 publications

References 15 publications

Trace-Based Symbolic Analysis for Atomicity Violations

Trace-Based Symbolic Analysis for Atomicity Violations

Linear Encodings of Bounded LTL Model Checking

Checking Bounded Reachability in Asynchronous Systems by Symbolic Event Tracing

Contact Info

Product

Resources

About