Skip to main content

Improving Representative Computation in ExpliSAT

  • Conference paper
Hardware and Software: Verification and Testing (HVC 2013)

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

Included in the following conference series:

Abstract

This paper proposes a new algorithm for computing path representatives in the concolic software verification tool ExpliSAT. A path representative is a useful technique for reducing the number of calls to a decision procedure by maintaining an explicit instantiation of symbolic variables that matches the current control flow path. In the current implementation in ExpliSAT, the whole representative is guessed at the beginning of an execution and then recomputed if it does not match the currently traversed control flow path. In this paper we suggest a new algorithm for computation of a representative, where the instantiation is done “on demand”, that is, only when a specific value is required in order to determine feasibility. Experimental results show that using representatives improves performance.

This work is partially supported by the European Community under the call FP7-ICT-2009-5 – project PINCETTE 257647.

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

Access this chapter

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. Godefroid, P., Klarlund, N., Sen, K.: Dart: directed automated random testing. In: PLDI, pp. 213–223 (2005)

    Google Scholar 

  2. Sen, K., Agha, G.: CUTE and jCUTE: Concolic unit testing and explicit path model-checking tools. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 419–423. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Cadar, C., Dunbar, D., Engler, D.R.: Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs. In: OSDI, pp. 209–224 (2008)

    Google Scholar 

  4. Barner, S., Eisner, C., Glazberg, Z., Kroening, D., Rabinovitz, I.: ExpliSAT: Guiding SAT-based software verification with explicit states. In: Bin, E., Ziv, A., Ur, S. (eds.) HVC 2006. LNCS, vol. 4383, pp. 138–154. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. The CBMC Homepage, http://www.cprover.org/cbmc

  6. RuleBase PE Homepage, http://www.haifa.il.ibm.com/projects/verification/RB_Homepage

  7. Software-artifact Infrastructure Repository, http://sir.unl.edu/portal/index.php

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Chockler, H., Pidan, D., Ruah, S. (2013). Improving Representative Computation in ExpliSAT. In: Bertacco, V., Legay, A. (eds) Hardware and Software: Verification and Testing. HVC 2013. Lecture Notes in Computer Science, vol 8244. Springer, Cham. https://doi.org/10.1007/978-3-319-03077-7_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03077-7_24

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03076-0

  • Online ISBN: 978-3-319-03077-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics