References

1. D. Beyer (2016): Reliable and Reproducible Competition Results with BenchExec and Witnesses. In: Proc. TACAS. Springer, pp. 887–904, doi:10.1007/978-3-662-49674-9_55. Available at http://www.sosy-lab.org/~dbeyer/Publications/2016-TACAS.Reliable_and_Reproducible_Competition_Results_with_BenchExec_and_Witnesses.pdf.
2. D. Beyer, T. A. Henzinger, R. Jhala & R. Majumdar (2007): The Software Model Checker Blast. Int. J. Softw. Tools Technol. Transfer 9(5-6), pp. 505–525, doi:10.1007/s10009-007-0044-z. Available at http://www.sosy-lab.org/~dbeyer/Publications/2007-STTT.The_Software_Model_Checker_BLAST.pdf.
3. D. Beyer, T. A. Henzinger & G. Théoduloz (2007): Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis. In: Proc. CAV, LNCS 4590. Springer, pp. 504–518, doi:10.1007/978-3-540-73368-3_51. Available at http://www.sosy-lab.org/~dbeyer/Publications/2007-CAV.Configurable_Software_Verification.pdf.
4. D. Beyer & M. E. Keremoglu (2011): CPAchecker: A Tool for Configurable Software Verification. In: Proc. CAV, LNCS 6806. Springer, pp. 184–190, doi:10.1007/978-3-642-22110-1_16. Available at http://www.sosy-lab.org/~dbeyer/Publications/2011-CAV.CPAchecker_A_Tool_for_Configurable_Software_Verification.pdf.
5. D. Beyer & S. Löwe (2013): Explicit-State Software Model Checking Based on CEGAR and Interpolation. In: Proc. FASE, LNCS 7793. Springer, pp. 146–162, doi:10.1007/978-3-642-37057-1_11. Available at http://www.sosy-lab.org/~dbeyer/Publications/2013-FASE.Explicit-State_Software_Model_Checking_Based_on_CEGAR_and_Interpolation.pdf.
6. D. Beyer & A. Stahlbauer (2013): BDD-Based Software Model Checking with CPAchecker. In: Proc. MEMICS, LNCS 7721. Springer, pp. 1–11, doi:10.1007/978-3-642-36046-6_1. Available at http://www.sosy-lab.org/~dbeyer/Publications/2013-MEMICS.BDD-Based_Software_Model_Checking_with_CPAchecker.pdf.
7. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu & H. Veith (2003): Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), pp. 752–794, doi:10.1145/876638.876643.
8. E. M. Clarke, D. Kröning, N. Sharygina & K. Yorav (2005): SatAbs: SAT-Based Predicate Abstraction for ANSI-C. In: Proc. TACAS, LNCS 3440. Springer, pp. 570–574, doi:10.1007/978-3-540-31980-1_40.
9. L. Cordeiro & B. Fischer (2011): Verifying multi-threaded software using smt-based context-bounded model checking. In: Proc. ICSE. ACM, pp. 331–340, doi:10.1145/1985793.1985839.
10. Matthias Dangl, Stefan Löwe & Philipp Wendler (2015): CPAchecker with Support for Recursive Programs and Floating-Point Arithmetic. In: Proc. TACAS, LNCS 9035. Springer, pp. 423–425, doi:10.1007/978-3-662-46681-0_34.
11. B. Fischer, O. Inverso & G. Parlato (2013): CSeq: A Sequentialization Tool for C (Competition Contribution). In: Proc. TACAS, LNCS 7795. Springer, pp. 616–618, doi:10.1007/978-3-642-36742-7_46.
12. Patrice Godefroid (1996): Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. LNCS 1032. Springer, doi:10.1007/3-540-60761-7.
13. A. Gupta, C. Popeea & A. Rybalchenko (2011): Threader: A Constraint-Based Verifier for Multi-threaded Programs. In: CAV, LNCS 6806. Springer, pp. 412–417, doi:10.1007/978-3-642-22110-1_32.
14. T. A. Henzinger, R. Jhala, R. Majumdar & G. Sutre (2002): Lazy abstraction. In: Proc. POPL. ACM, pp. 58–70, doi:10.1145/503272.503279.
15. G. J. Holzmann (1997): The Spin Model Checker. IEEE Trans. Softw. Eng. 23(5), pp. 279–295, doi:10.1109/32.588521.
16. Omar Inverso, Truc L. Nguyen, Bernd Fischer, Salvatore La Torre & Gennaro Parlato (2015): Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs. In: Proc. ASE. ACM, pp. 807–812, doi:10.1109/ASE.2015.108.
17. Sreekaanth S. Isloor & T. Anthony Marsland (1980): The Deadlock Problem: An Overview. IEEE Computer 13(9), pp. 58–78, doi:10.1109/MC.1980.1653786.
18. Doron A. Peled (1993): All from One, One for All: on Model Checking Using Representatives. In: Proc. CAV, LNCS 697. Springer, pp. 409–423, doi:10.1007/3-540-56922-7_34.
19. Antti Valmari (1989): Stubborn sets for reduced state space generation. In: Proc. Petri Nets, LNCS 483. Springer, pp. 491–515, doi:10.1007/3-540-53863-1_36.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org