Skip to main content

Dynamite 2.0: New Features Based on UnSAT-Core Extraction to Improve Verification of Software Requirements

  • Conference paper
Book cover Theoretical Aspects of Computing – ICTAC 2010 (ICTAC 2010)

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

Included in the following conference series:

Abstract

According to the Verified Software Initiative manifesto,

Lightweight techniques and tools have been remarkably successful in finding bugs and problems in software. However, their success must not stop the pursuit of this projects long-term scientific ideals”.

The Dynamite Proving System (DPS) blends the good qualities of the lightweight formal method Alloy with the certainty provided by the theorem prover PVS. Using the Alloy Analyzer during the proving process improves the PVS theorem proving experience by reducing the number of errors introduced along creative proof steps. Therefore, rather than becoming an obstacle to the goals of the Initiative, inside DPS Alloy becomes an aid. In this article we introduce new features of DPS based on the novel use of unsat cores to guide the proving process by pruning unnecessary information. We illustrate these new features using a non-trivial case-study coming from the networking domain.

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. Arkoudas, K.: Type-ω DPLs, MIT AI Memo 2001-27 (2001)

    Google Scholar 

  2. Arkoudas, K., Khurshid, S., Marinov, D., Rinard, M.: Integrating Model Checking and Theorem Proving for Relational Reasoning. In: Proceedings of RelMiCS 2003, Springer, Heidelberg (2003)

    Google Scholar 

  3. Böhme, S., Nipkow, T.: Sledgehammer: Judgement Day. In: IJCAR 2010 (to appear, 2010)

    Google Scholar 

  4. Blanchette, J.C., Nipkow, T.: Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder. In: TAP 2009 (2009)

    Google Scholar 

  5. Dunets, A., Schellhorn, G., Reif, W.: Automated Flaw Detection in Algebraic Specifications. Journal of Automated Reasoning (2010)

    Google Scholar 

  6. Eén, N., Sörensson, N.: MiniSat-p-v1.14. A proof-logging version of MiniSat (September 2006)

    Google Scholar 

  7. Frias, M.F., López Pombo, C.G., Moscato, M.M.: Alloy Analyzer+PVS in the Analysis and Verification of Alloy Specifications. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 587–601. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Hoare, C.A.R., Leavens, G.T., Misra, J., Shankar, N.: The Verified Software Initiative: A Manifesto (2007)

    Google Scholar 

  9. Jackson, D.: Alloy: a lightweight object modelling notation. ACM Transactions on Software Engineering and Methodology 11, 256–290 (2002)

    Article  Google Scholar 

  10. Jackson, D., Schechter, I., Shlyakhter, I.: Alcoa: the Alloy Constraint Analyzer. In: ICSE 2000, pp. 730–733 (2000)

    Google Scholar 

  11. Kang, E., Jackson, D.: Formal Modeling and Analysis of a Flash Filesystem in Alloy. In: Börger, E., Butler, M., Bowen, J.P., Boca, P. (eds.) ABZ 2008. LNCS, vol. 5238, pp. 294–308. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Owre, S., Rushby, J.M., Shankar, N.: PVS: A prototype verification system. In: Kapur, D. (ed.) CADE 1992. LNCS (LNAI), vol. 607, pp. 148–752. Springer, Heidelberg (1992)

    Google Scholar 

  13. Pudlák, P.: Semantic Selection of Premisses for Automated Theorem Proving. In: Proceedings of ESARLT 2007, pp. 27–44 (2007)

    Google Scholar 

  14. Ramananandro, T.: Mondex, an electronic purse: specification and refinement checks with the Alloy model-finding method. Formal Aspects of Computing 20(1), 21–39 (2008)

    Article  Google Scholar 

  15. Sutcliffe, G., Puzis, Y.: SRASS a semantic relevance axiom selection system (2007), http://www.cs.miami.edu/~tptp/ATPSystems/SRASS/

  16. Torlak, E., Chang, F., Jackson, D.: Finding Minimal Unsatisfiable Cores of Declarative Specifications. In: Cuellar, J., Maibaum, T., Sere, K. (eds.) FM 2008. LNCS, vol. 5014, pp. 326–341. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Torlak, E., Jackson, D.: Kodkod: A Relational Model Finder. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 632–647. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Urban, J.: MaLARea: a Metasystem for Automated Reasoning in Large Theories. In: Proceedings of ESARLT 2007, pp. 45–58 (2007)

    Google Scholar 

  19. Weber, T.: Integrating a SAT Solver with an LCF-style Theorem Prover. In: Proceedings of PDPAR 2005. ENTCS, vol. 144(2), pp. 67–78.

    Google Scholar 

  20. Weber, T.: SAT-based Finite Model Generation for Higher-Order Logic, Ph.D. Thesis, TUM (2008)

    Google Scholar 

  21. Zave, P.: Compositional binding in network domains. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 332–347. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moscato, M.M., López Pombo, C.G., Frias, M.F. (2010). Dynamite 2.0: New Features Based on UnSAT-Core Extraction to Improve Verification of Software Requirements. In: Cavalcanti, A., Deharbe, D., Gaudel, MC., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2010. ICTAC 2010. Lecture Notes in Computer Science, vol 6255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14808-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14808-8_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14807-1

  • Online ISBN: 978-3-642-14808-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics