SYNERGY: A new algorithm for property checking

Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Volumn , Issue , 2006, Pages 117-127

  Gulavani, Bhargav S ^a   Henzinger, Thomas A ^b   Kannan, Yamini ^c   Nori, Aditya V ^c   Rajamani, Sriram K ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^b EPFL   (Switzerland)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Abstraction refinement; Directed testing; Software model checking; Testing

Indexed keywords

ABSTRACTION REFINEMENT; DIRECTED TESTING; SYNERGY ALGORITHM;

COMPUTER PROGRAMMING; MATHEMATICAL MODELS; MODEL CHECKING; PROBLEM SOLVING; SOFTWARE TESTING;

ALGORITHMS;

EID: 34547150779     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1181775.1181790     Document Type: Conference Paper

References (29)

1. F#: http://research.microsoft.com/fsharp/fsharp.aspx.
2. T. Ball, S. Lahiri, M. Musuvathi. ZAP: Automated theorem proving for software analysis. Tech. Rep. MSR-TR-2005-137, Microsoft Research, 2005.
3. T. Ball and S.K. Rajamani. Automatically validating temporal safety properties of interfaces. In Model Checking of Software (SPIN), LNCS 2057, pp. 103-122. Springer, 2001.
4. W.R. Bush, J.D. Pincus, D.J. Sielaff. A static analyzer for finding dynamic programming errors. Software Practice and Experience, 30:775-802, 2000.
5. S. Chaki, E.M. Clarke, A. Groce, S. Jha, H. Veith. Modular verification of software components in C. IEEE Trans. Software Engineering, 30:388-402, 2004.
6. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, H. Veith. Counterexample-guided abstraction refinement. In Computer-Aided Verification, LNCS 1855, pp. 154-169. Springer, 2000.
7. E.M. Clarke, O. Grumberg, D. Peled. Model Checking. MIT Press, 1999.
8. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for the static analysis of programs by construction or approximation of fixpoints. In Principles of Programming Languages, pp. 238-252. ACM, 1977.
9. J. Edvardsson. A survey on automatic test data generation. In Computer Science and Engineering in Linköping, pp. 21-28. ECSEL, 1999.
10. D. Engler, B. Chelf, A. Chou, S. Hallem. Checking system rules using system-specific, programmer-written compiler extensions. In Operating System Design and Implementation, pp. 1-16. Usenix, 2000.
11. P. Godefroid. Model checking for programming languages using VERISOFT. In Principles of Programming Languages, pp. 174-186. ACM, 1997.
12. P. Godefroid and N. Klarlund. Software model checking: Searching for computations in the abstract or the concrete. In Integrated Formal Methods, LNCS 3771, pp. 20-32. Springer, 2005.
13. P. Godefroid, N. Klarlund, K. Sen. DART: Directed automated random testing. In Programming Language Design and Implementation, pp. 213-223. ACM, 2005.
14. B.S. Gulavani and S.K. Rajamani. Counterexample-driven refinement for abstract interpretation. In Tools and Algorithms for the Construction and Analysis of Systems, LNCS 3920, pp. 474-488. Springer, 2006.
15. E.L. Gunter and D. Peled. Model checking, testing, and verification working together. Formal Aspects of Computing, 17:201-221, 2005.
16. T.A. Henzinger, R. Jhala, R. Majumdar, K.L. McMillan. Abstractions from proofs. In Principles of Programming Languages, pp. 232-244. ACM, 2004.
17. T.A. Henzinger, R. Jhala, R. Majumdar, G. Sutre. Lazy abstraction. In Principles of Programming Languages, pp. 58-70. ACM, 2002.
18. R. Jhala and R. Majumdar. Path slicing. In Programming Language Design and Implementation, pp.38-47. ACM, 2005.
19. R. Jhala and K.L. McMillan. A practical and complete approach to predicate refinement. In Tools and Algorithms for the Construction and Analysis of Systems, LNCS 3920, pp. 459-473. Springer, 2006.
20. P.C. Kanellakis and S.A. Smolka. Ccs expressions, finite-state processes, and three problems of equivalence. Information and Computation, 86:43-68, 1990.
21. D. Kröning, A. Groce, E.M. Clarke. Counterexample-guided abstraction refinement via program execution. In Formal Engineering Methods (ICFEM), LNCS 3308, pp. 224-238. Springer, 2004.
22. R.P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, 1994.
23. D. Lee and M. Yannakakis. On-line minimization of transition systems. In Theory of Computing (STOC), pp. 264-274. ACM, 1992.
24. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems. Springer, 1995.
25. R. Milner. An algebraic definition of simulation between programs. In Artificial Intelligence (IJCAI), pp. 481-489. British Computer Society, 1971.
26. R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM J. Computing, 16:973-989, 1987.
27. CS. Pasareanu, R. Pelánek, W. Visser. Concrete model checking with abstract matching and refinement. In Computer-Aided Verification, LNCS 3576, pp. 52-66. Springer, 2005.
28. A. Srivastava, A. Edwards, H. Vo. VULCAN: Binary transformation in a distributed environment. Tech. Rep. MSR.-TR-2001-50, Microsoft Research, 2001.
29. G. Yorsh, T. Ball, M. Sagiv. Testing, abstraction, theorem proving: Better together! In Software Testing and Analysis (ISSTA), pp. 145-156. ACM, 2006.