Partition Analysis: A Method Combining Testing and Verification

IEEE Transactions on Software Engineering

Volumn SE-11, Issue 12, 1985, Pages 1477-1490

  Richardson, Debra J ^a   Clarke, Lori A ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

Software testing; software verification; symbolic evaluation

Indexed keywords

COMPUTER PROGRAMMING - RELIABILITY;

PARTITION ANALYSIS METHOD; SOFTWARE VERIFICATION;

COMPUTER SOFTWARE;

EID: 0022242050     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1985.231892     Document Type: Article

References (50)

1. R. M. Balzer, “Final report,” Inform. Sci. Inst., Univ. Southern California, Feb. 1981.
2. R. S. Boyer, B. Elspas, and K. N. Levitt, “SELECT–A formal sys tem for testing and debugging programs by symbolic execution,” in Proc. Int. Conf. Reliable Software, Apr. 1975, pp. 234–244.
3. T. E. Cheatham, G. H. Holloway, and J. A. Townley, “Symblic evaluation and the analysis of programs,” IEEE Trans. Software Eng., vol. SE-5, pp. 402–417, July 1979.
4. L. A. Clarke and D. J. Richardson, “Symbolic evaluation methods– Implementations Implementations and applications,” in Computer Program Testing, B. Chandrasekaran and S. Radicchi, Eds. Amsterdam, The Netherlands: North-Holland, 1981, pp. 65–102.
5. L. A. Clarke, J. Hassell, and D. J. Richardson, “A close look at domain testing,” IEEE Trans. Software Eng., pp. 380–390, July 1982.
6. L. A. Clarke and D. J. Richardson, “A rigorous approach to error-sensitive sensitive testing,” in Proc. 16th Annu. Hawaii Conf. Syst. Sci., Jan. 1983, pp. 197–206.
7. —, “Applications of symbolic evaluation,” J. Syst. Software, vol. 5, no. 1, pp. 15–35, Jan. 1985.
8. L. A. Clarke, A. Podgurski, D. J. Richardson, and S. J. Zeil, “A comparison of data flow path selection criteria,” in Proc. 8th Int. Conf. Software Eng., Aug. 1985, pp. 244–251.
9. R. A. DeMillo and R. J. Lipton, “A probabilitic remark on algebraic program testing,” Inform. Processing Lett., vol. 7, June 1978.
10. R. A. DeMillo, R. J. Lipton, and F. G. Sayward, “Program mutation: A new approach to program testing,” in Infotech State of the Art Rep. Software Testing, vol. 2, Sept. 1978, pp. 107–128.
11. —, ”Hints on test data selection: Help for the practicing program-mer,” Computer, vol. 11, no. 4, pp. 34–41, Apr. 1978.
12. R. A. DeMillo, R. J. Lipton, and A. J. Perlis, “Social processes and proofs of theorems,” Commun. ACM, vol. 22, no. 5, pp. 271–280, May 1979.
13. L. P. Deutsch, “An interactive program verifier,” Ph.D. dissertation, Univ. California, Berkeley, May 1973.
14. E. W. Dijkstra, “Structured programming,” in Software Engineering Principles, J. N. Buxton and B. Randall, Eds. Brussels, Belgium: NATO Science Committee, 1970.
15. R. W. Floyd, “Assigning meaning to programs,” in Proc. Symp. Appl. Math., vol. 19, Amer. Math. Soc., 1967, pp. 19–32.
16. K. A. Foster, “Error sensitive test case analysis (ESTCA),“ IEEE Trans. Software Eng., vol. SE-6, pp. 258–264, May 1980.
17. —, “Comment on the application of error-sensitive testing strategies to debugging,” ACMSIGSOFT Software Eng. Notes, vol. 8, no. 5, pp. 40–42, Oct. 1983.
18. —, “Sensitive test data for logical expressions,” ACMSIGSOFT Software Eng. Notes, vol. 9, no. 3, July 1984.
19. C. W. Gear, Programming and Languages, Science Research Associates, Inc., 1978.
20. A. Geller, “Test data as an aid to proving program correctness,” Commun. ACM, vol. 21, no. 5, pp. 368–375, May 1978.
21. S. L. Gerhart and L. Yelowitz, “Observations of fallibility in applications of modern programming methodologies,” IEEE Trans. Software Eng., vol. SE-2, pp. 195–207, Sept. 1976.
22. J. A. Goguen and J. J. Tardo, “An introduction to OBJ,” in Proc. Conf. Specifications of Reliable Reliable Software, 1979, pp. 170–189.
23. J. S. Gourlay, “Theory of testing computer programs,” Ph.D. dissertion, Univ. Michigan, Ann Arbor, 1981.
24. D. Gries, “An illustration of current ideas on the derivation of correctness proofs and correct programs,” IEEE Trans. Software Eng., vol. SE-2, pp. 106–112, Dec. 1976.
25. P. Grogono, Programming in PASCAL. Reading, MA: Addison-Wesley, 1979.
26. C. A. R. Hoare, “Proof of a program: FIND,” Commun. ACM, vol. 14, no. 1, pp. 39–45, Jan. 1971.
27. W. E. Howden, “Reliability of the path analysis testing strategy,” IEEE Trans. Software Eng., vol. SE-2, pp. 208–215, Sept. 1976.
28. —, “Symbolic testing and the DISSECT symbolic evaluation system,” IEEE Trans. Software Eng., vol. SE-3, pp. 266–278, July 1977.
29. —, “Algebraic program testing,” ACTA Inform., vol. 10, 1978.
30. —, “Functional program testing,” IEEE Trans. Software Eng., vol. SE-6, pp. 162–169, Mar. 1980.
31. —, “Completeness criteria for testing elementary program functions,” in Proc. 5th Int. Conf. Software Eng., pp. 235–243, Mar. 1981.
32. R. A. Kemmerer, “Testing formal speci fi cations to detect design errors,” IEEE Trans. Software Eng., vol. SE-11, pp. 32–43, Jan. 1985.
33. B. W. Kernighan and P. J. Plauger, The Elements of Programming Style. New York: McGraw-Hill, 1974.
34. J. S. Kerner,“Design methodology subcommittee chairperson's letter and matrix,” Ada Lett., vol. 2, no. 6, pp. 110–115, May/June 1983.
35. J. C. King, “A program verifier,” Ph.D. dissertation, Carnegie-Mellon Univ., Pittsburgh, PA, Sept. 1969.
36. E. B. Koffman, Problem Solving and Structured Programming in Pascal. Reading, MA: Addison-Wesley, 1981.
37. R. L. London, “A view of program verification,” in Proc. Int. Conf. Reliable Software, Apr. 1975, pp. 534–545.
38. G. J. Myers, The Art of Software Testing. New York: Wiley, 1979.
39. C. V. Ramamorthy, S. F. Ho, and W. T. Chen, “On the automated generation of program test data,” IEEE Trans. Software Eng., vol. SE 2, pp. 293–300, Dec. 1976.
40. S. T. Redwine, “An engineering approach to test data design,” IEEE Trans. Software Eng., vol. SE-9, pp. 191–200, Mar. 1983.
41. D. J. Richardson, “Theoretical considerations in testing programs by demonstrating consistency with specifications,” in Dig. Workshop Software Testing and Test Documentation, Dec. 1978, pp. 19–56.
42. D. J. Richardson and L. A. Clarke, “A partition analysis method to increase program reliability,” in Proc. 5th Int. Conf. Software Eng., Mar. 1981, pp. 244–253.
43. D. J. Richardson, “A partition analysis method to demonstrate program reliability,” Ph.D. dissertation, Univ. Masachusetts, Amherst, Sept. 1981. reliability,”
44. J. H. Rowland and P. J. Davis, “On the use of transcendentals for program testing,” J. ACM, vol. 28, no. 1, pp. 181–190, Jan. 1981.
45. B. A. Silverburg, L. Robinson, and K. N. Levitt, “The HDM handbook, volume 1: The languages and tools of HDM,” Stanford Res. Inst., Stanford, CA, Proj. 4828, June 1979.
46. P. Wegner, Programming with Ada: An Introduction by Means of Graduated Examples. Englewood Cliffs, NJ: Prentice-Hall, 1980.
47. J. Welsh and J. Elder, Introduction to Pascal. Englewood Cliffs, NJ: Prentice-Hall, 1979.
48. E. J. Weyuker and T. J. Ostrand, “Theories of program testing and the application of revealing subdomains,” IEEE Trans. Software Eng., vol. SE-6, pp. 236–246, May 1980.
49. E. J. Weyuker, “An error-based testing strategy,” Dep. Comput. Sci., New York Univ., New York, Tech. Rep. 027, Jan. 1981.
50. L. J. White and E. I. Cohen, “A domain strategy for computer program testing,” IEEE Trans. Software Eng., vol. SE-6, pp. 247–257, May 1980.