A theory of predicate-complete test coverage and generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3657 LNCS, Issue , 2005, Pages 1-22

  Ball, Thomas ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BOOLEAN ALGEBRA; CODES (SYMBOLS); INFORMATION RETRIEVAL; METRIC SYSTEM; STATE ESTIMATION;

BOOLEAN ABSTRACTION; CONTROL-FLOW COVERAGE; MODAL TRANSITION SYSTEMS; PREDICATE-COMPLETE TESTING (PCT);

COMPUTER SYSTEMS PROGRAMMING;

EID: 33646048042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561163_1     Document Type: Conference Paper

References (26)

1. [BEL75] R. Boyer, B. Elspas, and K. Levitt. SELECT-a formal system for testing and debugging programs by symbolic execution. SIGPLAN Notices, 10(6):234-245, 1975.
2. [BG99] G. Bruns and P. Godefroid. Model checking partial state spaces with 3-valued temporal logics. In CAV 99: Computer Aided Verification, LNCS 1633, pages 274-287. Springer-Verlag, 1999.
3. [BKM02] C. Boyapati, S. Khurshid, and D. Marinov. Korat: automated testing based on Java predicates. In Proceedings of the International Symposium on Software Testing and Analysis, pages 123-133. ACM, 2002.
4. [BPS00] W. R. Bush, J. D. Pincus, and D. J. Sielaff. A static analyzer for finding dynamic programming errors. Software-Practice and Experience, 30(7):775-802, June 2000.
5. [CHJM04] A. J. Chlipala, T. A. Honzinger, R. Jhala, and R. Majumdar. Generating tests from counterexamples. In ICSE 04: International Conference on Software Engineering (to appear). ACM, 2004.
6. [CKY03] E. Clarke, D. Kroening, and K. Yorav. Behavioral consistency of C and Verilog programs using bounded model checking. In Design Automation Conference, pages 368-371, 2003.
7. [Cla76] L. A. Clarke. A system to generate test data and symbolically execute programs. IEEE Transactions on Software Engineering, 2(3):215-222, September 1976.
8. [dAGJ04] L. de Alfaro, P. Godefroid, and R. Jagadeesan. Three-valued abstractions of games:uncertainty, but with precision. In LICS 04: Logic in Computer Science, To appear in LNCS. Springer-Verlag, 2004.
9. [GBR98] A. Gotlieb, B. Botella, and M. Rueher. Automatic test data generation using constraint solving techniques. In Proceedings of the International Symposium on Software Testing and Analysis, pages 53-62. ACM, 1998.
10. [GHJ01] P. Godefroid, Michael Huth, and Radha Jagadeesan. Abstraction-based model checking using modal transition systems. In CONCUR 01: Conference on Concurrency Theory, LNCS 2154, pages 426-440. Springer-Verlag, 2001.
11. [GMS98] N. Gupta, A. P. Mathur, and M. L. Soffa. Automated test data generation using an iterative relaxation method. In FSE 98: Foundations of Software Engineering. ACM, 1998.
12. [God03] P. Godefroid. Reasoning about abstract open systems with generalized module checking. In EMSOFT 03: Conference on Embedded Software, LNCS 2855, pages 223-240. Springer-Verlag, 2003.
13. [GR03] P. Godefroid and R. Jagadeesan. On the expressiveness of 3-valued models. In VMCAI 03: Verification, Model Checking and Abstract Interpretation, LNCS 2575, pages 206-222. Springer-Verlag, 2003.
14. [Gri81] D. Gries. The Science of Programming. Springer-Verlag, 1981.
15. [GRS00] R. Giacobazzi, F. Ranzato, and F. Scozzari. Making abstract interpretations complete. Journal of the ACM, 47(2):361-416, 2000.
16. [HME03] M. Harder, J. Meilen, and M. D. Ernst. Improving test suites via operational abstraction. In ICSE 2003: International Conference on Software Engineering, pages 60-71. ACM, 2003.
17. [How76] W. E. Howden. Reliability of the path analysis testing strategy. IEEE Transactions on Software Engineering, 2:208-215, 1976.
18. +94] R. Jasper, M. Brennan, K. Williamson, B. Currier, and D. Zimmerman. Test data generation and feasible path analysis. In Proceedings of the International Symposium on Software Testing and Analysis, pages 95-107. ACM, 1994.
19. [JV00] D. Jackson and M. Vaziri. Finding bugs with a constraint solver. In Proceedings of the International Symposium on Software Testing and Analysis, pages 14-25. ACM, 2000.
20. [Kor92] B. Korel. Dynamic method of software test data generation. Software Testing, Verification and Reliability, 2(4):203-213, 1992.
21. [Mil99] R. Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999.
22. [RHC] C. Ramamoorthy, S. Ho, and W. Chen. On the automated generation of program test data. IEEE Transactions on Software Engineering, 2(4):293-300.
23. [SG04] S. Shoham and O. Grumberg. Monotonie abstraction-refinement for CTL. In TACAS 04: Tools and Algorithms for Construction and Analysis of Systems, LNCS 2988, pages 546-560. Springer-Verlag, 2004.
24. [Tai96] K-C. Tai. Theory of fault-based predicate testing for computer programs. IEEE Transactions on Software Engineering, 22(8):552-562, 1996.
25. [Tai97] K-C. Tai. Predicate-based test generation for computer programs. In ICSE 97: International Conference on Software Engineering, pages 267-276, 1997.
26. [YM89] D. Yates and N. Malevris. Reducing the effects of infeasible paths in branch testing. In Proceedings of the Symposium on Software Testing, Analysis, and Verification, pages 48-54. ACM, 1989.