Over-approximating boolean programs with unbounded thread creation

Proceedings of Formal Methods in Computer Aided Design, FMCAD 2006

Volumn , Issue , 2006, Pages 53-59

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

^a MICROSOFT RESEARCH   (United Kingdom)

^b ETH ZURICH   (Switzerland)

^c UNIVERSITY OF LUGANO   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN PROGRAMS; SYMBOLIC ALGORITHMS; UNBOUNDED THREAD CREATION;

APPROXIMATION ALGORITHMS; FUNCTION EVALUATION; ITERATIVE METHODS; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS;

BOOLEAN FUNCTIONS;

EID: 34547395462     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2006.24     Document Type: Conference Paper

References (29)

1. T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer, "Thread modular abstraction refinement," in CAV, ser. LNCS. Springer, 2003, pp. 262-274.
2. T. Bail, E. Bounimova, B. Cook, V. Levin, J. Lichtenberg, C. McGarvey, B. Ondrusek, S. K. Rajamani, and A. Ustuner, "Thorough static analysis of device drivers," in EuroSys, 2006.
3. S. Chaki, E. Clarke, A. Groce, S. Jha, and H. Veith, "Modular verification of software components in C," in International Conf. on Software Engineering, 2003, pp. 385-395.
4. E. Clarke, D. Kroening, N. Sharygina, and K. Yorav, "Predicate abstraction of ANSI-C programs using SAT," Formal Methods in System Design, vol. 25, pp. 105-127, September-November 2004.
5. M. K. Ganai, A. Gupta, and P. Ashar, "DiVer: SAT-based model checking platform for verifying large scale systems," in TACAS, ser. LNCS, vol. 3440. Springer, 2005, pp. 575-580.
6. M. Rinard, "Analysis of multithreaded programs," in SAS, ser. LNCS, vol. 2126. Springer, 2001. [Online], Available: citeseer.ist.psu.edu/ article/rinard01analysis.html
7. G. Ramalingam, "Context-sensitive synchronization-sensitive analysis is undecidable," ACM Transactions on Programming Languages and Systems, vol. 22, no. 2, pp. 416-430, March 2000.
8. O. Burkart and B. Steffen, "Composition, decomposition and model checking of pushdown processes," Nordic Journal of Computing, vol. 2, pp. 89 - 125, 1995.
9. J. Esparza and S. Schwoon, "A BDD-based model checker for recursive programs," in CAV, ser. LNCS 2102. Springer, 2001, pp. 324-336.
10. T. Ball and S. K. Rajamani, "Bebop: A symbolic model checker for Boolean programs," in SPIN 00, ser. LNCS 1885. Springer, 2000, pp. 113-130.
11. S. Chaki, E. M. Clarke, N. Kidd, T. W. Reps, and T. Touili, "Verifying concurrent message-passing C programs with recursive calls." in TACAS, ser. LNCS, vol. 3920. Springer, 2006, pp. 334-349.
12. S. Qadeer and J. Rehof, "Context-bounded model checking of concurrent software," in TACAS 05. Springer, 2005.
13. E. Clarke, M. Talupur, T. Touili, and H. Veith, "Verification by network decomposition," in CONCUR 04, ser. LNCS, vol. 3170. Springer, 2004, pp. 276-291.
14. C. Ip and D. Dill, "Verifying systems with replicated components in murø," in CAV, ser. LNCS, vol. 1102. Springer, 1996, pp. 147-158.
15. A. Pnueli and T. Arons, "TLPVS: A PVS-based LTL verification system," in Verification-Theory and Practice: Proceedings of an International Symposium in Honor of Zohar Manna's 64th Birthday, ser. LNCS. Springer, 2003, pp. 84-98.
16. T. A. Henzinger, R. Jhala, and R. Majumdar, "Race checking by context inference." in PLDI. ACM, 2004, pp. 1-13.
17. C. Flanagan and S. Qadeer, "Thread-modular model checking." in SPIN, ser. LNCS, vol. 2648. Springer, 2003, pp. 213-224.
18. J. E. Ahmed Bouajjani and T. Touili, "Reachability analysis of synchronized PA systems," in Infinity 04: International Workshop on Verification of Infinite-State Systems, 2004.
19. S. Stoller, "Model-checking multi-threaded distributed Java programs," in SPIN 00. Springer, 2000.
20. K. Havelund and T. Pressburger, "Model checking Java programs using Java PathFinder," International Journal on Software Tools for Technology Transfer, vol. 2(4), 2000.
21. E. Yahav, "Verifying safety properties of concurrent Java programs using 3-valued logic." in POPL. ACM Press, 2001, pp. 27-40.
22. T. Andrews, S. Qadeer, S. K. Rajamani, J. Rehof, and Y. Xie, "Zing: Exploiting program structure for model checking concurrent software," in CONCUR 04, 2004.
23. T. Ball, S. Chaki, and S. K. Rajamani, "Parameterized verification of multithreaded software libraries," in TACAS. Springer, 2001.
24. B. Cook, D. Kroening, and N. Sharygina, "Symbolic model checking for asynchronous boolean programs," in SPIN. Springer, 2005, pp. 75-90.
25. G. Holzmann and D. Peled, "The State of SPIN," in CAV, ser. LNCS. Springer, 1996, vol. 1102, pp. 385-389.
26. P. Jain and G. Gopalakrishnan, IEEE Transactions on Computer-Aided Design, vol. 13, 1994.
27. O. Coudert and J. Madre, "A unified framework for the formal verification of sequential circuits," in ICCAD. IEEE, 1990, pp. 78-82.
28. M. D. Aagaard, R. B. Jones, and C.-J. H. Seger, "Formal verification using parametric representations of boolean constraints," in DAC. ACM Press, 1999, pp. 402-407.
29. E. Clarke, D. Kroening, N. Sharygina, and K. Yorav, "SATABS: SAT-based predicate abstraction for ANSI-C," in Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005), ser. Lecture Notes in Computer Science, vol. 3440. Springer Verlag, 2005, pp. 570-574.