Skip to main content
Springer Nature Link
Log in

Search-Based Program Analysis

  • Conference paper
Search Based Software Engineering (SSBSE 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6956))

Included in the following conference series:

  • 1227 Accesses

Abstract

Traditionally, program analysis has been divided into two camps: Static techniques analyze code and safely determine what cannot happen; while dynamic techniques analyze executions to determine what actually has happened. While static analysis suffers from overapproximation, erring on whatever could happen, dynamic analysis suffers from underapproximation, ignoring what else could happen. In this talk, I suggest to systematically generate executions to enhance dynamic analysis, exploring and searching the space of software behavior. First results in fault localization and specification mining demonstrate the benefits of search-based analysis.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Dallmeier, V., Knopp, N., Mallon, C., Hack, S., Zeller, A.: Generating Test Cases for Specification Mining. In: Proc. ISSTA, Trento, Italy (July 2010), http://www.st.cs.uni-saarland.de/publications/details/dallmeier-issta-2010/

  2. Fraser, G., Zeller, A.: Mutation-driven Generation of Unit Tests and Oracles. In: Proc. ISSTA (2010), http://www.st.cs.uni-saarland.de/publications/details/fraser-issta-2010/

  3. Fraser, G., Zeller, A.: Generating Parameterized Unit Tests. In: Proc. ISSTA, Toronto, Canada (July 2011), http://www.st.cs.uni-saarland.de/publications/details/fraser-issta-2011/

  4. Zeller, A.: Mining Specifications: A Roadmap. In: Nanz, S. (ed.) The Future of Software Engineering. Springer, Zurich (2010), http://fose.ethz.ch/proceedings.html

    Google Scholar 

  5. Zeller, A.: Specifications for free. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 2–12. Springer, Heidelberg (2011), http://dx.doi.org/10.1007/978-3-642-20398-5_2

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saarland University, Saarbrücken, Germany

    Andreas Zeller

Authors
  1. Andreas Zeller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Eingineering, University of Nebraska-Lincoln, 68588-0115, Lincoln, NE, USA

    Myra B. Cohen

  2. School of Computer Science and Informatics, University College Dublin, Belfield, Dubline 4, Ireland

    Mel Ó Cinnéide

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zeller, A. (2011). Search-Based Program Analysis. In: Cohen, M.B., Ó Cinnéide, M. (eds) Search Based Software Engineering. SSBSE 2011. Lecture Notes in Computer Science, vol 6956. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23716-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23716-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23715-7

  • Online ISBN: 978-3-642-23716-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics