skip to main content
10.1145/271771.271792acmconferencesArticle/Chapter ViewAbstractPublication PagesisstaConference Proceedingsconference-collections
Article
Free Access

Automated program flaw finding using simulated annealing

Authors Info & Claims
Published:01 March 1998Publication History

ABSTRACT

One of the major costs in a software project is the construction of test-data. This paper outlines a generalised test-case data generation framework based on optimisation techniques. The framework can incorporate a number of testing criteria, for both functional and non-functional properties. Application of the optimisation framework to testing specification failures and exception conditions is illustrated. The results of a number of small case studies are presented and show the efficiency and effectiveness of this dynamic optimisation-base approach to generating test-data.

References

  1. 1.E. H~ L. Aarts and J. Korst. Simulated Aneealing and Boltzmann Machines. Wiley, 1988.Google ScholarGoogle Scholar
  2. 2.J. Barnes. High Integrity Ada: The 'SPARK Approach. Addison-Wesley, 1997.Google ScholarGoogle Scholar
  3. 3.B. Beizer. Software Testing Techniques. Thomson Computer Press, 2nd edition, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.J. Clark and N. Tracey. Solving constraints in law 22117. Law/d5.1.1(e), European Commission - DG HI Industry, 1997. Legacey Assessment Worbence Feasibility Assessment.Google ScholarGoogle Scholar
  5. 5.L. Clarke. A system to generate test data and symbolically execute programs. IEEE Transactions on Software Engineering, SE-2(3):215-222, September 1976.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.R. Demillo and A. Offutt. Constraint-based automatic test data generation. IEEE Transactions on Software Engineering, 17(9)~900-910, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.K. A. Dowsland. Modem Heuristic Techniques for Combinatorial Problems, chfipter 2 - Simulated Annealing, pages .20-69. McGraw Hill, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.F. Glover and M. Laguna'. Modem Heuristic Techniques for Combinatorial Problems, chapter 3- Tabu Search, pages 70- 150. McGraw Hill, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.D- B. Goldberg. Genetic Algorithms in Search, Optimisation and Machine Learing. Addison-Wesley, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.B. Jones, H. Sthamer, and D. Eyres. Automatic structural testing using genetic algorithms. Software Engineering Journal, 11(5):299-306, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  11. 11.S. Kirkpatrick, J. C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671--680, May 1983.Google ScholarGoogle ScholarCross RefCross Ref
  12. 12.B. Korel. Automated software test data generation. IEEE ransactions oti Software Engineering, 16(8):870-879, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.B. Korel. Automated test data generation for programs with procedures. ACM I¿TA, pages 209-215, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.N. Metropolis, A. W. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculation by fast computing machine. Journal of Chem. Phys., 21:1087-1091, 1953.Google ScholarGoogle ScholarCross RefCross Ref
  15. 15.W. Miller and D. Spooner. Automatic generation of floatingpoint test data. IEEE Transactions on Software Engineering, SE-2(3):223-226, September 1976.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.A.J. Offutt and J. Pan. The dynamic domain reduction procedure for test data generation. http://www, isse. gmu. edu/faculty/ofut/rsrch/atdg, htrnl, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.M. Duld. Tesintg - a challenge to method and tool developers. Software Engineering Journal, 6(2):59---64, March 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18.Praxis Critical Systems.'$park-Ada Documentation 2.0,1995.Google ScholarGoogle Scholar
  19. 19.V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, and G. D. Smith, editors. Modern Heuristic Search Methods. Wiley, 1996.Google ScholarGoogle Scholar
  20. 20.N. Trace),, J. Clark, and K. Mander. The way forward for unifying dynamic test case generation: The optimisation-based approach. In Dependable Computing and Its Applications- To appear. IFIP, 1998.'Google ScholarGoogle Scholar
  21. 21.N. J. Tracey. Test-case data generation using optimisation techniques - first year dphil report. Department of Computer Science, University of York, 1997.Google ScholarGoogle Scholar
  22. 22.X. Yang. The automatic generation of software test data from z specifications. Technical report, Department of Computer Studies, University of Glamorgan, 1995.Google ScholarGoogle Scholar

Index Terms

  1. Automated program flaw finding using simulated annealing

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              ISSTA '98: Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
              March 1998
              170 pages
              ISBN:0897919718
              DOI:10.1145/271771

              Copyright © 1998 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 March 1998

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              ISSTA '98 Paper Acceptance Rate16of47submissions,34%Overall Acceptance Rate58of213submissions,27%

              Upcoming Conference

              ISSTA '24

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader