Test data generation and feasible path analysis

Proceedings of the 1994 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1994

Volumn , Issue , 1994, Pages 95-107

  Jasper, Robert ^a   Brennan, Mike ^a   Williamson, Keith ^a   Currier, Bill ^a   Zimmerman, David ^b  

^a BOEING COMPANY   (United States)

^b Z Access Consulting ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADA (PROGRAMMING LANGUAGE); COST EFFECTIVENESS; REGRESSION ANALYSIS; TEST FACILITIES;

ANALYSIS AND TESTING; AUTOMATED THEOREM PROVING; CRITICAL APPLICATIONS; EXPERIMENTAL PROTOTYPE; EXPONENTIAL EXPLOSION; MODIFIED CONDITION DECISION COVERAGE; TEST DATA GENERATION; TEST SPECIFICATIONS;

SOFTWARE TESTING;

EID: 84877686239     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/186258.187150     Document Type: Conference Paper

References (32)

1. W. Bibel. On matrices with interconnections. In Journal of the ACM, 28(4), October, 1981, pages 633-664.
2. J. Bicevskis, J. Borzovs, U. Staujums, A. Zarins, and E. Miller. SMOTL-a system to construct samples for data processing and program debugging. In IEEE Transactions on Software Engineering, SE-5, 8, August, 1990, pages 60-66.
3. B. W. Boehm, The high cost of software. In Practical Strategies for Developing Large Software Systems. E. Horowitz (editor), Addison-Wesley, Reading, MA, 1975.
4. C. L. Chang and R. C. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, Inc., 1973.
5. ® 1993, The Boeing Company and Rockwell International Corporation, Submitted for publication.
6. J. J. Chilenski and P. H. Newcomb, Formal Specification Tools for Test Coverage Analysis, In preparation.
7. L. A. Clarke. A system to generate test data and symbolically execute programs. In IEEE Transactions on Software Engineering, SE-2, 3, September, 1976, pages 215-222.
8. L. A. Clarke, D. J. Richardson, and S. J. Zeil. TEAM: A support environment for testing, evaluation, and analysis. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium of Practical Software Development. November, 1988, ACM, pages 153-162.
9. P. G. Frankl, and E. J. Weyuker. An applicable family of data flow testing criteria, In IEEE Transactions on Software Engineering. SE-14, October 10, 1988, pages 1483-1898.
10. A. Goldberg. Design Study: Computation of RDTs and Test Specifications. Kestrel Institute, December 1992.
11. A. Goldberg. Final Report: Valid Condition Table Generation Pilot Study. Kestrel Institute, April 14, 1992.
12. A. Goldberg and D. Zimmerman. Design Study for RDTs and Beyond. Kestrel Institute, December 10, 1992.
13. A. Goldberg, D. Zimmerman, and T. C. Wang. Applications of feasible path analysis to program testing. To be presented at the International Symposium on Software Testing and Analysis, (Seattle, WA August 17-19, 1994).
14. W. E. Howden. Symbolic testing and the DISSECT symbolic evaluation techniques. In IEEE Transactions on Software Engineering, SE-4, 4, 1977, pages 266-278.
15. Kestrel Institute. VCTG 4.0 User's Guide. December 18, 1992.
16. Kestrel Institute. VCTG (EPA) 5.0 Interim Usage Notes. April 2, 1993.
17. Kestrel Institute. Kestrel Interactive Theorem Prover (KITP) User's Guide. October 20, 1993.
18. T. E. Lindquist and J. R. Jenkins. Test-case generation with IOGen, In IEEE Software. January 1988, pages 72-79.
19. RTCA, Inc. Software Considerations in Airborne Systems and Equipment Certification. Document No. RTCA/DO-178B, Dec. 1992.
20. C. Ramomoorthy, S. Ho, and W. Chen. On the automated generation of program test data, In IEEE Transactions on Software Engineering, SE-2, 4, December 1976, pages 293-300.
21. Reasoning Systems Incorporated. Refine/Ada Programmers Guide. July 26, 1992.
22. Reasoning Systems Incorporated. Refine/Ada User's Guide. July 26, 1992.
23. ™ 3.0 User's Guide. May 25, 1990.
24. P. B. Andrews, Theorem proving via general matings. In Journal of the ACM, 28(2), April, 1981, pages 193-214.
25. Jeffery Mark Siskind. Screaming Yellow Zonkers. M. I. T. Artificial Intelligence Laboratory, Draft of September 29, 1991. Available by anonymous FTP from the directory ftp. ai.mit.edu:/pub/screamer.
26. J. M. Siskind and D. A. McAllester. Screamer: A Portable Efficient Implementation of Nondeterministic Common Lisp. Available by anonymous FTP from the directory ftp. ai.mit.edu:/pub/screamer.
27. J. M. Siskind and D. A. McAllester. Nondeterministic lisp as a substrate for constraint logic programming. In Proceedings of the 11th Annual Conference on Artificial Intelligence, July, 1993, pages 133-138.
28. T. C. Wang. Designing examples for semantically guided hierarchical deduction. In 9th International Joint Conference on Artificial Intelligence, August, 1985, pages 1201-1207.
29. T. C. Wang and W. W. Bledsoe. Hierarchical Deduction. In Journal of Automated Reasoning 3, 1, March 1987, pages 35-77.
30. E. J. Weyuker. An empirical study of the complexity of data flow testing. In Proceedings of the Second Workshop on Software Testing, Analysis, and Verification. July, 1988, IEEE Computer Society, pages 188-195.
31. M. R. Woodward, D. Hedley, and M. A. Hennel. Experience with path analysis and testing. In Tutorial: Software Testing and Validation Techniques. E. Miller and W. Howden Eds. IEEE Computer Society Press, Los Alamitos, CA, 1981, pages 194-206.
32. L. Wos and A. Robinson. Paramodulation and set of support. In Proceedings of the IRIA Symposium on Automated Demonstration. 1968, Springer-Verlag, pages 276-310.