Zing: Exploiting Program Structure for Model Checking Concurrent Software

Andrews, Tony; Qadeer, Shaz; Rajamani, Sriram K.; Rehof, Jakob; Xie, Yichen

doi:10.1007/978-3-540-28644-8_1

Cited by 47 publications

(37 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our algorithm finds any error that can possibly manifest itself in an error trace with a number of context switches within the bound, even in the presence of unbounded parallelism. It is an important research problem for future work to integrate our algorithm into explicit state model checking frameworks such as zing [2].…”

Section: Resultsmentioning

confidence: 99%

“…The error was found by model checking a large transaction management system written in C# with a bounded number of threads, using the model checker zing [2] after compiling 10,000 lines of C# code into zing. Since the error cannot manifest itself with fewer than four context switches, it could not be discovered by the techniques of KISS [22] which are inherently limited to two context switches.…”

Section: Examplementioning

confidence: 99%

See 1 more Smart Citation

Context-Bounded Model Checking of Concurrent Software

Qadeer

Rehof

2005

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

316

368

View full text Add to dashboard Cite

Abstract. The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. Unfortunately, the problem of verifying a concurrent boolean program is undecidable [24]. In this paper, we prove that the problem is decidable, even in the presence of unbounded parallelism, if the analysis is restricted to executions in which the number of context switches is bounded by an arbitrary constant. Restricting the analysis to executions with a bounded number of context switches is unsound. However, the analysis can still discover intricate bugs and is sound up to the bound since within each context, a thread is fully explored for unbounded stack depth. We present an analysis of a real concurrent system by the zing model checker which demonstrates that the ability to model check with arbitrary but fixed context bound in the presence of unbounded parallelism is valuable in practice. Implementing contextbounded model checking in zing is left for future work.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Examplementioning

confidence: 99%

Context-Bounded Model Checking of Concurrent Software

Qadeer

Rehof

2005

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

316

368

View full text Add to dashboard Cite

show abstract

“…We use the explicit state model checkers SPIN [25] and Zing [28]. We also compare our BoPPo with Moped [3] and Bebop [2], which are BDD-based symbolic model checkers.…”

Section: Resultsmentioning

confidence: 99%

Symbolic Model Checking for Asynchronous Boolean Programs

Cook

Kroening

Sharygina

2005

Model Checking Software

View full text Add to dashboard Cite

Abstract.Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among threads. Most modern software model checkers can handle only one source of non-determinism efficiently, but not both. This paper describes a SAT-based model checker for asynchronous Boolean programs that handles both sources effectively. We address the first type of non-determinism with a form of symbolic execution and fix-point detection. We address the second source of non-determinism using a symbolic and dynamic partial-order reduction, which is implemented inside the SAT-solver's case-splitting algorithm. The preliminary experimental results show that the new algorithm outperforms the existing software model checkers on large benchmarks.

show abstract

“…The verification model is typically obtained by composing individual thread models using interleaving semantics, and model checkers are applied to systematically explore the global state space. Model checkers such as Verisoft [6], Zing [7] explore states and transitions of the concurrent system using explicit enumeration. Although several state space reduction techniques based on partial order methods [8] and transactions-based methods [9][10][11][12] have been proposed, these techniques do not scale well due to both state explosion and explicit enumeration.…”

Section: Related Workmentioning

confidence: 99%

“…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

Zing: Exploiting Program Structure for Model Checking Concurrent Software

Cited by 47 publications

References 13 publications

Context-Bounded Model Checking of Concurrent Software

Context-Bounded Model Checking of Concurrent Software

Symbolic Model Checking for Asynchronous Boolean Programs

Efficient Modeling of Concurrent Systems in BMC

Contact Info

Product

Resources

About