Mohamed Faouzi Atig, Ahmed Bouajjani & Shaz Qadeer (2009):
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads.
In: Stefan Kowalewski & Anna Philippou: TACAS,
Lecture Notes in Computer Science 5505.
Springer,
pp. 107–123.
Available at http://dx.doi.org/10.1007/978-3-642-00768-2_11.
Gérard Basler, Michele Mazzucchi, Thomas Wahl & Daniel Kroening (2009):
Symbolic Counter Abstraction for Concurrent Software.
In: Bouajjani & Maler,
pp. 64–78.
Available at http://dx.doi.org/10.1007/978-3-642-02658-4_9.
Ahmed Bouajjani & Oded Maler (2009):
Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings.
Lecture Notes in Computer Science 5643.
Springer.
Available at http://dx.doi.org/10.1007/978-3-642-02658-4.
Ariel Cohen & Kedar S. Namjoshi (2008):
Local Proofs for Linear-Time Properties of Concurrent Programs.
In: Aarti Gupta & Sharad Malik: CAV,
Lecture Notes in Computer Science 5123.
Springer,
pp. 149–161.
Available at http://dx.doi.org/10.1007/978-3-540-70545-1_15.
E. Allen Emerson & Vineet Kahlon (2004):
Parameterized Model Checking of Ring-Based Message Passing Systems.
In: Jerzy Marcinkowski & Andrzej Tarlecki: CSL,
Lecture Notes in Computer Science 3210.
Springer,
pp. 325–339.
Available at http://dx.doi.org/10.1007/978-3-540-30124-0_26.
Michael Emmi, Shaz Qadeer & Zvonimir Rakamaric (2011):
Delay-bounded scheduling.
In: Thomas Ball & Mooly Sagiv: POPL.
ACM,
pp. 411–422.
Available at http://doi.acm.org/10.1145/1926385.1926432.
Pranav Garg & P. Madhusudan (2011):
Compositionality Entails Sequentializability.
In: Parosh Aziz Abdulla & K. Rustan M. Leino: TACAS,
Lecture Notes in Computer Science 6605.
Springer,
pp. 26–40.
Available at http://dx.doi.org/10.1007/978-3-642-19835-9_4.
Naghmeh Ghafari, Alan J. Hu & Zvonimir Rakamaric (2010):
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation.
In: Jaco van de Pol & Michael Weber 0002: SPIN,
Lecture Notes in Computer Science 6349.
Springer,
pp. 227–244.
Available at http://dx.doi.org/10.1007/978-3-642-16164-3_17.
Yonit Kesten, Oded Maler, Monica Marcus, Amir Pnueli & Elad Shahar (1997):
Symbolic Model Checking with Rich ssertional Languages.
In: Orna Grumberg: CAV,
Lecture Notes in Computer Science 1254.
Springer,
pp. 424–435.
Yonit Kesten, Amir Pnueli, Elad Shahar & Lenore D. Zuck (2002):
Network Invariants in Action.
In: Lubos Brim, Petr Jancar, Mojm\'ır Kret\'ınský & Anton\'ın Kucera: CONCUR,
Lecture Notes in Computer Science 2421.
Springer,
pp. 101–115.
Available at http://dx.doi.org/10.1007/3-540-45694-5_8.
Salvatore La Torre, P. Madhusudan & Gennaro Parlato (2009):
Analyzing recursive programs using a fixed-point calculus.
In: Michael Hind & Amer Diwan: PLDI.
ACM,
pp. 211–222.
Available at http://doi.acm.org/10.1145/1542476.1542500.
Salvatore La Torre, P. Madhusudan & Gennaro Parlato (2009):
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability.
In: Bouajjani & Maler,
pp. 477–492.
Available at http://dx.doi.org/10.1007/978-3-642-02658-4_36.
Salvatore La Torre, P. Madhusudan & Gennaro Parlato (2010):
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces.
In: Tayssir Touili, Byron Cook & Paul Jackson: CAV,
Lecture Notes in Computer Science 6174.
Springer,
pp. 629–644.
Available at http://dx.doi.org/10.1007/978-3-642-14295-6_54.
Shuvendu K. Lahiri, Shaz Qadeer & Zvonimir Rakamaric (2009):
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers.
In: Bouajjani & Maler,
pp. 509–524.
Available at http://dx.doi.org/10.1007/978-3-642-02658-4_38.
Akash Lal & Thomas W. Reps (2009):
Reducing concurrent analysis under a context bound to sequential analysis.
Formal Methods in System Design 35(1),
pp. 73–97.
Available at http://dx.doi.org/10.1007/s10703-009-0078-9.
Madanlal Musuvathi & Shaz Qadeer (2007):
Iterative context bounding for systematic testing of multithreaded programs.
In: Jeanne Ferrante & Kathryn S. McKinley: PLDI.
ACM,
pp. 446–455.
Available at http://doi.acm.org/10.1145/1250734.1250785.
Madanlal Musuvathi, Shaz Qadeer, Thomas Ball, Gérard Basler, Piramanayagam Arumuga Nainar & Iulian Neamtiu (2008):
Finding and Reproducing Heisenbugs in Concurrent Programs.
In: Richard Draves & Robbert van Renesse: OSDI.
USENIX Association,
pp. 267–280.
Available at http://www.usenix.org/events/osdi08/tech/full_papers/musuvathi/musuvathi.pdf.
Amir Pnueli, Jessie Xu & Lenore D. Zuck (2002):
Liveness with (0, 1, infty)-Counter Abstraction.
In: Ed Brinksma & Kim Guldstrand Larsen: CAV,
Lecture Notes in Computer Science 2404.
Springer,
pp. 107–122.
Available at http://dx.doi.org/10.1007/3-540-45657-0_9.
Shaz Qadeer & Jakob Rehof (2005):
Context-Bounded Model Checking of Concurrent Software.
In: Nicolas Halbwachs & Lenore D. Zuck: TACAS,
Lecture Notes in Computer Science 3440.
Springer,
pp. 93–107.
Available at http://dx.doi.org/10.1007/978-3-540-31980-1_7.
Shaz Qadeer & Dinghao Wu (2004):
KISS: keep it simple and sequential.
In: William Pugh & Craig Chambers: PLDI.
ACM,
pp. 14–24.
Available at http://doi.acm.org/10.1145/996841.996845.
Dejvuth Suwimonteerabuth, Javier Esparza & Stefan Schwoon (2008):
Symbolic Context-Bounded Analysis of Multithreaded Java Programs.
In: Klaus Havelund, Rupak Majumdar & Jens Palsberg: SPIN,
Lecture Notes in Computer Science 5156.
Springer,
pp. 270–287.
Available at http://dx.doi.org/10.1007/978-3-540-85114-1_19.
eptcs@eptcs.org