Skip to main content
SpringerLink
Log in

How AI Can Help SE; or: Randomized Search Not Considered Harmful

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2056))

  • 1121 Accesses

Abstract

In fast-paced software projects, engineers don't have the time or the resources to build heavyweight complete descriptions of their software. The best they can do is lightweight incomplete descriptions which may contain missing and contradictory information. Reasoning about incomplete and contradictory knowledge is notoriously difficult. However, recent results from the empirical AI community suggest that randomized search can tame this difficult problem. In this article we demonstrate the the relevance and the predictability of randomized search for reasoning about lightweight models.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings of IJCAI-91, pages 331–337, 1991.

    Google Scholar 

  2. L. Console and P. Torasso. A Spectrum of Definitions of Model-Based Diagnosis. Computational Intelligence, 7:133–141, 3 1991.

    Article  Google Scholar 

  3. J. Corbett, M. Dwyer, J. Hatcliff, S. Laubach, C. Pasarenu, Robby, and H. Zheng. Bandera: Extracting finite-state models from java source code. In Proceedings ICSE2000, Limerick, Ireland, pages 439–448, 2000.

    Google Scholar 

  4. H. Gabow, S. Maheshwari, and L. Osterweil. On two problems in the generation of program test paths. IEEE Trans. Software Engrg, SE-2:227–231, 1976.

    Article  MathSciNet  Google Scholar 

  5. A. Kakas, R. Kowalski, and F. Toni. The role of abduction in logic programming. In C. H. D.M. Gabbay and J. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming 5, pages 235–324. Oxford University Press, 1998.

    Google Scholar 

  6. N. Leveson. Safeware System Safety And Computers. Addison-Wesley, 1995.

    Google Scholar 

  7. J. McIntosh and R. McIntosh. Mathematical Modeling and Computers in Endocrinology. Springer-Verlag, 1980.

    Google Scholar 

  8. T. Menzies and P. Compton. Applications of abduction: Hypothesis testing of neuroendocrinological qualitative compartmental models. Artificial Intelligence in Medicine, 10:145–175, 1997. Available from http://tim.menzies.com/pdf/96aim.pdf.

    Article  Google Scholar 

  9. T. Menzies, S. Easterbrook, B. Nuseibeh, and S. Waugh. An empirical investigation of multiple viewpoint reasoning in requirements engineering. In RE’ 99, 1999. Available from http://tim.menzies.com/pdf/99re.pdf.

  10. T. Menzies and C. Michael. Fewer slices of pie: Optimising mutation testing via abduction. In SEKE’ 99, June 17-19, Kaiserslautern, Germany. Available from http://tim.menzies.com/pdf/99seke.pdf, 1999.

  11. T. Menzies and H. Singh. Many maybes mean (mostly) the same thing. In 2nd International Workshop on Soft Computing applied to Software Engineering (Netherlands), February, 2001. Available from http://tim.menzies.com/pdf/00maybe.pdf.

  12. J. Mylopoulos, L. Cheng, and E. Yu. From object-oriented to goal-oriented requirements analysis. Communications of the ACM, 42(1):31–37, January 1999.

    Article  Google Scholar 

  13. D. Sahlin. An Automatic Partial Evaluator for Full Prolog. PhD thesis, The Royal Institute of Technology (KTH), Stockholm, Sweden, May 1991. Available from http://file.sics.se/pub/isl/papers/dan-sahlin-thesis.ps.gz.

    Google Scholar 

  14. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In AAAI’ 92, pages 440–446, 1992.

    Google Scholar 

  15. J. Whittle and J. Schumann. Generating state chart designs from scenarios. In Proceedings of the 22nd International Conference on Software Engineering (ICSE). Limerick, Ireland, June 2000. Available from http://www.riacs.edu/research/detail/ase/icse2000.ps.gz.

  16. B. Williams and P. Nayak. A model-based approach to reactive self-configuring systems. In Proceedings, AAAI’ 96, pages 971–978, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Electrical & Computer Eng., University of British Columbia, 2356 Main Mall, Vancouver, B.C., Canada, V6T 1Z4

    Tim Menzies

  2. Department of Statistics, West Virginia University, Morgantown, West Virginia

    Harhsinder Singh

Authors
  1. Tim Menzies
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Harhsinder Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Alberta, Edmonton, AB, Canada, T6G 2E8

    Eleni Stroulia

  2. School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, Canada, K1N 6N5

    Stan Matwin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Menzies, T., Singh, H. (2001). How AI Can Help SE; or: Randomized Search Not Considered Harmful. In: Stroulia, E., Matwin, S. (eds) Advances in Artificial Intelligence. Canadian AI 2001. Lecture Notes in Computer Science(), vol 2056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45153-6_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45153-6_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42144-3

  • Online ISBN: 978-3-540-45153-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation