Symbolic Model Checking for Asynchronous Boolean Programs

Cook, Byron; Kroening, Daniel; Sharygina, Natasha

doi:10.1007/11537328_9

Cited by 43 publications

(48 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A comparison of our work with [RG05,CKS05], to which it is most closely related, was presented in the introduction. Partial order reduction has been used before for symbolic model checking using BDDs [ABH · 01,LST03].…”

Section: Concluding Remarks and Related Workmentioning

confidence: 99%

“…Indeed, in this sense, the work most closely resembling ours are the approaches presented in [RG05,CKS05] that involve translating a program directly into a SAT formula for model checking using SAT-based BMC. However [RG05] does not incorporate partial order reductions and neither technique leverages on-the-fly transactions.…”

Section: Introductionmentioning

confidence: 97%

“…Once we have built a circuit for the concurrent program at hand, it affords us the flexibility to tackle the verification problem using any model checking technique of choice for a broad range of linear time temporal properties, not just safety. Unlike [RG05,CKS05], we can employ a suite of model checking tools for a rich class of linear-time temporal properties, which can be used both for finding bugs and generating proofs. These include SAT-based BMC and UMC as well as BDD based model checking.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions

Kahlon¹,

Gupta²,

Sinha

2006

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. The state explosion problem is one of the core bottlenecks in the model checking of concurrent software. We show how to ameliorate the problem by combining the ability of partial order techniques to reduce the state space of the concurrent program with the power of symbolic model checking to explore large state spaces. Our new verification methodology involves translating the given concurrent program into a circuit-based model which gives us the flexibility to then employ any model checking technique of choice -either SAT or BDD-based -for verifying a broad range of linear time properties, not just safety. The reduction in the explored state-space is obtained by statically augmenting the symbolic encoding of the program by additional constraints. These constraints restrict the scheduler to choose from a minimal conditional stubborn set of transitions at each state. Another key contribution of the paper, is a new method for detecting transactions on-the-fly which takes into account patterns of lock acquisition and yields better reductions than existing methods which rely on a lockset based analysis. Moreover unlike existing techniques, identifying on-the-fly transactions does not require the program to follow a lock discipline in accessing shared variables. We have applied our techniques to the Daisy test bench and shown the existence of several bugs.

show abstract

Section: Concluding Remarks and Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions

Kahlon¹,

Gupta²,

Sinha

2006

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…It does not handle liveness specifications and uses the non-SAT-based theorem prover vampyre for proof generation. The use of SAT for software model checking has also been explored in the context of both sequential ANSI-C programs [14] and asynchronous concurrent Boolean programs [15]. Proving program termination via ranking functions is also a rich, and developing, research area [16,3].…”

Section: Related Workmentioning

confidence: 99%

SAT-Based Software Certification

Chaki

2006

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We formalize a notion of witnesses for satisfaction of linear temporal logic specifications by infinite state programs. We show how such witnesses may be constructed via predicate abstraction, and validated by generating verification conditions and proving them. We propose the use of SAT-based theorem provers and resolution proofs in proving these verification conditions. In addition to yielding extremely compact proofs, a SAT-based approach overcomes several limitations of conventional theorem provers when applied to the verification of programs written in real-life programming languages. We also formalize a notion of witnesses of simulation conformance between infinite state programs and finite state machine specifications. We present algorithms to construct simulation witnesses of minimal size by solving pseudo-Boolean constraints. We present experimental results on several non-trivial benchmarks which suggest that a SAT-based approach can yield extremely compact proofs, in some cases by a factor of over 10 5 , when compared to existing non-SAT-based theorem provers.

show abstract

“…However, they still suffer from lack of scalability. To overcome this limitation, some researchers have employed sound abstraction [7] with bounded number of context switches [17], while some others have used finite-state model [15,18] or Boolean program abstractions with bounded depth analysis [19]. This is also combined with a bounded number of context switches known a priori [15] or a proof-guided method to discover them [18].…”

Section: Related Workmentioning

confidence: 99%

Efficient Modeling of Concurrent Systems in BMC

Ganai

Gupta

Model Checking Software

View full text Add to dashboard Cite

Abstract. We present an efficient method for modeling multi-threaded concurrent systems with shared variables and locks in Bounded Model Checking (BMC), and use it to improve the detection of safety properties such as data races. Previous approaches based on synchronous modeling of interleaving semantics do not scale up well due to the inherent asynchronism in those models. Instead, in our approach, we first create independent (uncoupled) models for each individual thread in the system, then explicitly add additional synchronization variables and constraints, incrementally, and only where such synchronization is needed to guarantee the (chosen) concurrency semantics (based on sequential consistency). We describe our modeling in detail and report verification results to demonstrate the efficacy of our approach on a complex case study.

show abstract

Symbolic Model Checking for Asynchronous Boolean Programs

Cited by 43 publications

References 27 publications

Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions

Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions

SAT-Based Software Certification

Efficient Modeling of Concurrent Systems in BMC

Contact Info

Product

Resources

About