Skip to main content

Combining Theorem Proving and Symbolic Trajectory Evaluation in THM&STE

  • Conference paper
  • 973 Accesses

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

Abstract

In this paper, we present a tool THM&STE, which combines theorem proving with symbolic trajectory evaluation. With the help of theorem proving, a large property is decomposed into smaller properties, which can be handled directly by running STE. Besides the support of decomposition by the classical STE laws, some novel techniques such as simplification on the assertions based on causal dependency between nodes, symmetry reduction, tacticals are provided in THM&STE.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   72.00
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aagaard, M.D., Jones, R.B., Seger, C.J.H.: Combining theorem proving and trajectory evaluation in an industrial environment. In: Design Automation Conference, pp. 538–541. ACM, San Francisco (1998)

    Google Scholar 

  2. Hazelhurst, S., Seger, C.J.: Symbolic Trajectory Evaluation. In: Kropf, T. (ed.) Formal Hardware Verification. LNCS, vol. 1287, pp. 3–78. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  3. Hunt Jr., W.A., Swords, S., Davis, J., Slobodova, A.: Use of Formal Verification at Centaur Technology. In: Hardin, D.S. (ed.) Design and Verification of Microprocessor Systems for High Assurance Applications, pp. 65–88. Springer (2010)

    Google Scholar 

  4. Intel Corporation: Forte/fl user guide, 2003 edn. (2003)

    Google Scholar 

  5. Li, Y.: Formalization of symbolic trajectory semantics (2009), http://lcs.ios.ac.cn/~lyj238/steSymmetry.html

  6. Li, Y., Zeng, N.: Enhanced symbolic simulation of a round-robin arbiter (2011), http://lcs.ios.ac.cn/~lyj238/roundRobin.html

  7. Li, Y., Zeng, N.: Symmetry reduction in enhanced symbolic simulation (2011), http://lcs.ios.ac.cn/~lyj238/gsteSymmetry.html

  8. Li, Y.: Case study of cam (2011), http://lcs.ios.ac.cn/~lyj238/papers/cam.fl

  9. O’Leary, J., Zhao, X., Gerth, R., Seger, C.J.H.: Formally verifying IEEE compliance of floating-point hardware. Intel Technology Journal Q1, 147–190 (1999)

    Google Scholar 

  10. Seger, C.J.H., Bryant, R.E.: Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods in System Design 6(2), 147–189 (1995)

    Article  Google Scholar 

  11. Seger, C.J.H., Jones, R.B., O’Leary, J.W., Melham, T., Aagaard, M.D., Barrett, C., Syme, D.: An industrially effective environment for formal hardware verification. IEEE Transactions on Computer-Aided Design 24(9), 1381–1405 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, Y., Zeng, N., Hung, W.N.N., Song, X. (2012). Combining Theorem Proving and Symbolic Trajectory Evaluation in THM&STE . In: Eder, K., Lourenço, J., Shehory, O. (eds) Hardware and Software: Verification and Testing. HVC 2011. Lecture Notes in Computer Science, vol 7261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34188-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34188-5_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34187-8

  • Online ISBN: 978-3-642-34188-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics