skip to main content
article

The SEMINAL workshop: reformulating software engineering as a metaheuristic search problem

Authors Info & Claims
Published:01 November 2001Publication History
Skip Abstract Section

Abstract

This paper reports on the first international Workshop on Software Engineering using Metaheuristic INnovative ALgorithms.The aim of the workshop was to bring together researchers in search-based metaheuristic techniques with researchers and practitioners in Software Engineering. The workshop sought to support and develop the embryonic community which straddles these two communities and which is working on the application of metaheuristic search-based techniques to problems in Software Engineering.The paper outlines the nature of the nascent field of Search-Based Software Engineering, and briefly outlines the papers presented at the workshop and the discussions which took place.

References

  1. Bab98 Vladan Babovic. Mining sediment transport data with genetic programming. In Proceedings of the First International Conference on New Information Technologies for Decision Making in Civil Engineering, pages 875-886, Montreal, Canada, 11-13 October 1998.Google ScholarGoogle Scholar
  2. Bäc96 T. Biick. Evolutionary Algorithms in Theory and Practice. Oxford University Press, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Bax99 I .D . Baxter. Transformation systems: Domain-oriented component and implementation knowledge. In Proceedings of the Ninth Workshop on Institutionalizing Software Reuse, Austin, TX, USA, January 1999.Google ScholarGoogle Scholar
  4. Bir92 Robert R. Birge. Protein-based optical computing and memories. Computer, 25(11):56-67, November 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. BKAK99 Forrest H Bennett III, Martin A. Keane, David Andre, and John R. Koza. Automatic synthesis of the topology and sizing for analog electrical circuits using genetic programming. In Kaisa Miettinen, Marko M. Makelai, Pekka Neittaanmilki, and Jacques Periaux, editors, Evolutionary Algorithms in Engineering and Computer Science, pages 199- 229, JyvKskyle, Finland, 30 May - 3 June 1999. John Wiley & Sons.Google ScholarGoogle Scholar
  6. BW96 Peter J. Bentley and Jonathan P. Wakefield. Generic representation of solid geometry far genetic search. Microcomputers in Civil Engineering, 11(3):153-161, 1996.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Dol00 Jose Javier Dolado. A validation of the component-based method for software size estimation. IEEE Transactions on Software Engineering, 26(10):1006-1021, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Dol01 Jose Javier Dolado. On the problem of the software cost function. Information and Software Technology, 43:61-72, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  9. Glo90 F. Glover. Tabu search: A tutorial. Interfaces, 20:74-94, 1990.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Hol75 John H. Holland. Adaption in Natural and Artificial Systems. MIT Press, Ann Arbor, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. JES98 Bryan F. Jones, David E. Eyres, and Harmen H. Sthamer. A strategy for using genetic algorithms to automate branch and fault-based testing. The Computer Journal, 41(2):98- 107, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  12. JSE96 B.F. Jones, H.-H. Sthamer, and D.E. Eyres. Automatic structural testing using genetic algorithms. The Software Engineering Journal, 11:299-306, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  13. Koz92 J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. KSHH93 C. L. Karr, S. K. Sharma, W. J. Hatcher, and T. R. Harper. Fuzzy control of an exothermic chemical reaction using genetic algorithms. Engineering Applications of Artificial Intelligence 6, 6:575-582, 1993.Google ScholarGoogle ScholarCross RefCross Ref
  15. LT92 J. E. Labussiere and N. Turrkan. On the optimization of the tensor polynomial failure theory with a genetic algorithm. Transactions of the Canadian Society for Mechanical Engineering, 16(3-4):251-265, 1992.Google ScholarGoogle ScholarCross RefCross Ref
  16. MRR+53 N. Metropolis, A.W. Rosenbluth, M.N. Roseabhth, A.H. Teller, and E. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21:1087-1092, 1953.Google ScholarGoogle ScholarCross RefCross Ref
  17. PCV95 R. Poli, S. Cagnoni, and G. Valli. Genetic design of optimum linear and nonlinear QRS detectors. IEEE Transactions on Biomedical Engineering, 42(11):1137-41, November 1995.Google ScholarGoogle ScholarCross RefCross Ref
  18. PHP99 R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability, 9:263-282, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  19. TCM98 N. Tracey, J. Clark, and K. Mander. Automated program flaw finding using simulated annealing. In International Symposium on Software Testing and Analysis, pages 73-81. ACM/SIGSOFT, March 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Tip95 Frank Tip. A survey of program slicing techniques. Journal of Programming Languages, 3(3):121-189, September 1995.Google ScholarGoogle Scholar
  21. War94 Martin Ward. Reverse engineering through formal transformation. The Computer Journal, 37(5), 1994.Google ScholarGoogle Scholar
  22. Wei84 Mark Weiser. Program slicing. 1EEE Transactions on Software Engineering, 10(4):352-357, 1984.Google ScholarGoogle Scholar
  23. WGG+96 J Wegener, K Grimm, M Grochtmann, H Sthamer, and B F Jones. Systematic testing of real-time systems. In 4th International Conference on Software Testing Analysis and Review (EuroSTAR 96), 1996.Google ScholarGoogle Scholar
  24. Whi01 Darrell Whitley. An overview of evolutionary algorithms: Practical issues and common pitfalls. Information and Software Technology Special Issue on Software Engineering using Metaheuristic Innovative Algorithms, 2001. To appear.Google ScholarGoogle Scholar
  25. WM97 David H. Wolpert and William G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, April 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. WSJE97 J Wegener, H Sthamer, B F Jones, and D E Eyres. Testing real-time systems using genetic algorithms. Software Quality, 6:127-135, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The SEMINAL workshop: reformulating software engineering as a metaheuristic search problem
    Index terms have been assigned to the content through auto-classification.

    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

    Full Access

    • Published in

      cover image ACM SIGSOFT Software Engineering Notes
      ACM SIGSOFT Software Engineering Notes  Volume 26, Issue 6
      November 2001
      90 pages
      ISSN:0163-5948
      DOI:10.1145/505532
      Issue’s Table of Contents

      Copyright © 2001 Authors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 November 2001

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader