Skip to main content
SpringerLink
Log in

A Case for Using Data-Flow Analysis to Optimize Incremental Scope-Bounded Checking

  • Conference paper
Abstract State Machines, Alloy, B and Z (ABZ 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5977))

Included in the following conference series:

  • 665 Accesses

Abstract

In software verification, scope-bounded checking of programs has become an effective technique for finding subtle bugs. Given bounds (that are iteratively relaxed) on input size and length of execution paths, a program and its correctness specifications are translated into a formula, which is solved using off-the-shelf solvers – a solution to the formula is a counterexample to the correctness specification.

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

References

  1. Dennis, G., Chang, F.S.H., Jackson, D.: Modular verification of code with SAT. In: ISSTA (2006)

    Google Scholar 

  2. Jackson, D., Vaziri, M.: Finding bugs with a constraint solver. In: ISSTA (2000)

    Google Scholar 

  3. Shao, D., Khurshid, S., Perry, D.E.: An incremental approach to scope-bounded checking using a lightweight formal method. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009: Formal Methods. LNCS, vol. 5850, pp. 757–772. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Texas at Austin,  

    Danhua Shao, Divya Gopinath, Sarfraz Khurshid & Dewayne E. Perry

Authors
  1. Danhua Shao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Divya Gopinath
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sarfraz Khurshid
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dewayne E. Perry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Département d’informatique, Sherbrooke, Université de Sherbrooke, J1K 2R1, Québec, Canada

    Marc Frappier

  2. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, BC, Canada

    Uwe Glässer

  3. Department of Electrical and computer Engineering, University of Texas at Austin, 1 University Station C5000, 78712-0240, Austin, TX, USA

    Sarfraz Khurshid

  4. Département informatique, Route forestiére Hurtault, Université Paris-Est Créteil, IUT Sénart/Fontainebleau, 77300, Fontainebelau, France

    Régine Laleau

  5. Department of Computer Science, The University of Waikato, 3240, Hamilton, New Zealand

    Steve Reeves

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shao, D., Gopinath, D., Khurshid, S., Perry, D.E. (2010). A Case for Using Data-Flow Analysis to Optimize Incremental Scope-Bounded Checking. In: Frappier, M., Glässer, U., Khurshid, S., Laleau, R., Reeves, S. (eds) Abstract State Machines, Alloy, B and Z. ABZ 2010. Lecture Notes in Computer Science, vol 5977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11811-1_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11811-1_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11810-4

  • Online ISBN: 978-3-642-11811-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation