Context-Bounded Model Checking of Concurrent Software

By Shaz Qadeer, Jakob Rehof. International Conference on Tools and Algorithms for Construction and Analysis of Systems, 2005

424 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Software

View Paper: https://www.semanticscholar.org/paper/e40e45f1a0557521949d776b1ed441d15a48c8f7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. M. Musuvathi
2. Vijay Victor D'Silva
3. Georg Weissenbacher
4. Daniel Kroening
5. Shaz Qadeer
6. Armando Solar-Lezama
7. Koushik Sen

In Software

1. M. Musuvathi
2. Vijay Victor D'Silva
3. Georg Weissenbacher
4. Daniel Kroening
5. Shaz Qadeer

Citations in the corpus

• A Survey of Automated Techniques for Formal Software Verification (2008, background): “5(b): The unreachable nodes in each time frame are in gray.”
• Iterative context bounding for systematic testing of multithreaded programs (2007, result): “That work was followed by the theoret­ical result of Qadeer and Rehof [19] which showed that context­bounded reachability analysis for concurrent boolean programs is decidable.”