Verification of Boolean programs with unbounded thread creation

Theoretical Computer Science

Volumn 388, Issue 1-3, 2007, Pages 227-242

  Cook, Byron ^a   Kroening, Daniel ^b   Sharygina, Natasha ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF LUGANO   (Switzerland)

Author keywords

Boolean programs; Model checking; Program verification; Reachability

Indexed keywords

ABSTRACTING; ALGORITHMS; CODES (SYMBOLS); COMPUTER SCIENCE; COMPUTER SOFTWARE; MODEL CHECKING;

BOOLEAN PROGRAMS; PROGRAM VERIFICATION; REACHABILITY; UNBOUNDED THREAD CREATION;

BOOLEAN FUNCTIONS;

EID: 35748938218     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.050     Document Type: Article

References (39)

1. Ball T., and Rajamani S.K. Bebop: A symbolic model checker for Boolean programs. SPIN 00. Lecture Notes in Computer Science vol. 1885 (2000), Springer 113-130
2. Cook B., Kroening D., and Sharygina N. Symbolic model checking for asynchronous Boolean programs. SPIN. Lecture Notes in Computer Science vol. 3639 (2005), Springer 75-90
3. Cook B., Kroening D., and Sharygina N. Over-approximating Boolean programs with unbounded thread creation. Proceedings of FMCAD (2006), IEEE 53-59
4. Graf S., and Saïdi H. Construction of abstract state graphs with PVS. Computer-Aided Verification (CAV). Lecture Notes in Computer Science vol. 1254 (1997), Springer 72-83
5. Podelski A., and Wies T. Boolean heaps. Static Analysis (SAS). Lecture Notes in Computer Science vol. 3672 (2005), Springer 268-283
6. Yorsh G., Reps T.W., Sagiv M., and Wilhelm R. Logical characterizations of heap abstractions. ACM Transactions on Computational Logic 8 1 (2007)
7. Clarke E.M., Grumberg O., Jha S., Lu Y., and Veith H. Counterexample-guided abstraction refinement for symbolic model checking. Journal of the ACM 50 5 (2003) 752-794
8. Rinard M.C. Analysis of multithreaded programs. Static Analysis (SAS). Lecture Notes in Computer Science vol. 2126 (2001), Springer 1-19
9. Ramalingam G. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Transactions on Programming Languages and Systems 22 2 (2000) 416-430
10. Burkart O., and Steffen B. Composition, decomposition and model checking of pushdown processes. Nordic Journal of Computing 2 (1995) 89-125
11. Esparza J., and Schwoon S. A BDD-based model checker for recursive programs. Computer-Aided Verification (CAV). Lecture Notes in Computer Science vol. 2102 (2001), Springer 324-336
12. Leino K.R.M. A SAT characterization of Boolean-program correctness. Model Checking Software (SPIN). Lecture Notes in Computer Science vol. 2648 (2003), Springer 104-120
13. Jain H., Clarke E., and Kroening D. Verification of SpecC and Verilog using predicate abstraction. Proceedings of MEMOCODE 2004 (2004), IEEE 7-16
14. Cimatti A., et al. NuSMV 2: An opensource tool for symbolic model checking. Computer Aided Verification (CAV). Lecture Notes in Computer Science (2002), Springer 359-364
15. Chaki S., Clarke E.M., Kidd N., Reps T.W., and Touili T. Verifying concurrent message-passing C programs with recursive calls. Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science vol. 3920 (2006), Springer 334-349
16. Qadeer S., and Rehof J. Context-bounded model checking of concurrent software. Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science vol. 3440 (2005), Springer 93-107
17. Clarke E., Talupur M., Touili T., and Veith H. Verification by network decomposition. CONCUR 04. Lecture Notes in Computer Science vol. 3170 (2004), Springer 276-291
18. Ip C., and Dill D. Verifying systems with replicated components in murφ{symbol}. Computer-Aided Verification (CAV). Lecture Notes in Computer Science vol. 1102 (1996), Springer 147-158
19. Pnueli A., and Arons T. TLPVS: A PVS-based LTL verification system. Verification-Theory and Practice: Proceedings of an International Symposium in Honor of Zohar Manna's 64th Birthday. Lecture Notes in Computer Science (2003), Springer 84-98
20. Henzinger T.A., Jhala R., and Majumdar R. Race checking by context inference. PLDI (2004), ACM 1-13
21. Flanagan C., and Qadeer S. Thread-modular model checking. SPIN. Lecture Notes in Computer Science vol. 2648 (2003), Springer 213-224
22. Bouajjani A., Esparza J., and Touili T. Reachability analysis of synchronized PA systems. Electronic Notes in Theoretical Computer Science 138 3 (2005) 153-178
23. Stoller S.D. Model-checking multi-threaded distributed Java programs. SPIN Model Checking and Software Verification. Lecture Notes in Computer Science vol. 1885 (2000), Springer 224-244
24. Havelund K., and Pressburger T. Model checking Java programs using Java PathFinder. International Journal on Software Tools for Technology Transfer 2 4 (2000) 366-381
25. Yahav E. Verifying safety properties of concurrent Java programs using 3-valued logic. POPL (2001), ACM Press 27-40
26. Andrews T., Qadeer S., Rajamani S.K., Rehof J., and Xie Y. Zing: Exploiting program structure for model checking concurrent software. CONCUR 04. Lecture Notes in Computer Science vol. 3170 (2004), Springer 1-15
27. Ball T., Chaki S., and Rajamani S.K. Parameterized verification of multithreaded software libraries. Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science vol. 2031 (2001), Springer 158-173
28. Kahlon V., and Gupta A. On the analysis of interacting pushdown systems. Principles of Programming Languages (POPL) (2007), ACM 303-314
29. Clarke E.M., Grumberg O., and Long D.E. Model checking and abstraction. Principles of Programming Languages (POPL) (1992), ACM 343-354
30. Colón M.A., and Uribe T.E. Generating finite-state abstractions of reactive systems using decision procedures. Computer-Aided Verification (CAV). Lecture Notes in Computer Science vol. 1427 (1998), Springer 293-304
31. T. Ball, S. Rajamani, Boolean programs: A model and process for software analysis, Tech. Rep. 2000-14, Microsoft Research, February 2000
32. Kurshan R. Computer-Aided Verification of Coordinating Processes (1995), Princeton University Press
33. Clarke E., Grumberg O., Jha S., Lu Y., and Veith H. Counterexample-guided abstraction refinement. Computer-Aided Verification (CAV). Lecture Notes in Computer Science (2000), Springer 154-169
34. Holzmann G., and Peled D. The State of SPIN. Computer-Aided Verification (CAV). Lecture Notes in Computer Science vol. 1102 (1996), Springer 385-389
35. Jain P., and Gopalakrishnan G. Efficient symbolic simulation-based verification using the parametric form of Boolean expressions. IEEE Transactions on CAD of ICs and Systems 13 8 (1994) 1005-1015
36. Coudert O., and Madre J. A unified framework for the formal verification of sequential circuits. ICCAD (1990), IEEE 78-82
37. Aagaard M.D., Jones R.B., and Seger C.-J.H. Formal verification using parametric representations of boolean constraints. DAC (1999), ACM Press 402-407
38. Clarke E., Kroening D., Sharygina N., and Yorav K. Predicate abstraction of ANSI-C programs using SAT. Formal Methods in System Design 25 (2004) 105-127
39. Clarke E., Kroening D., Sharygina N., and Yorav K. SATABS: SAT-based predicate abstraction for ANSI-C. Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science vol. 3440 (2005), Springer 570-574