Skip to main content

Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip

  • Conference paper
Applied Formal Methods — FM-Trends 98 (FM-Trends 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1641))

Included in the following conference series:

  • 337 Accesses

Abstract

We present a simple and powerful method for formal verification of hardware that exploits hardware symmetries. We illustrate the method at an industrial example: a fragment of the IBM S/390 Clock Chip.

Partially supported by grant Ku 966/3-1 of the Deutsche Forschungsgemeinschaft within the Schwerpunkt Deduktion at the University of Tübingen.

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. M. C. Browne, E. M. Clarke, D. L. Dill, and B. Mishra. Automatic verification of sequential circuits using temporal logic. IEEE Transactions on Computers, 35(12):1035–1045, 1986.

    MATH  Google Scholar 

  2. J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill. Symbolic Model Checking for Sequential Circuit Verification. Technical Report CMU-CS-93-211, Carnegie Mellon University, July 1993.

    Google Scholar 

  3. Reinhard Bündgen and Wolfgang Küchlin. Term rewriting as a tool for hardware and software codesign. In Jerzy Rosenblit and Klaus Buchenrieder, editors, Codesign — Computer-Aided Software/Hardware Engineering, pages 19–40. IEEE Press, 1995.

    Google Scholar 

  4. Reinhard Bündgen and Wolfgang Küchlin. Verification of the Sparrow processor. In Proc. Engineering of Computer-Based Systems (ECBS). IEEE Press, 1996.

    Google Scholar 

  5. Robert S. Boyer and J. Strother Moore. Proof-checking, theorem-proving, and program verification. Contemporary Mathematics, 29:119–132, 1984.

    MathSciNet  Google Scholar 

  6. R.E. Bryant. Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. ACM Comp. Surveys, 24(3), Sept. 1992.

    Google Scholar 

  7. Bruno Courcelle. Graph rewriting: An algebraic and logic approach. In van Leeuwen [vL94], chapter 5, pages 193–242.

    Google Scholar 

  8. Mandalagiri S. Chandrasekhar, John P. Privitera, and Kenneth W. Conradt. Application of term rewriting techniques to hardware design verification. In 24thACM/IEEE Design Automation Conference (DAC), pages 277–283, 1987.

    Google Scholar 

  9. Nachum Dershowitz. Termination of rewriting. J. Symb. Comput., 3(1&2):69–115, Feb./April 1987. Corrigendum: 4, 3, Dec. 1987, 409–410.

    Article  MATH  MathSciNet  Google Scholar 

  10. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In van Leeuwen [vL94], chapter 6, pages 243–320.

    Google Scholar 

  11. Alfons Geser. A specification of the intel 8085 microprocessor — a case study. In Martin Wirsing and Jan A. Bergstra, editors, Algebraic methods: Theory, Tools, and Applications, LNCS 394, pages 347–402. Springer, June 1987.

    Chapter  Google Scholar 

  12. A. Gupta. Formal Hardware Verification: A Survey. Formal Methods in System Design, 1992.

    Google Scholar 

  13. Jieh Hsiang, Hélène Kirchner, and Michael Rusinowitch. The term rewriting approach to automated theorem proving. J. Logic Programming, 14:71–99, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  14. Jieh Hsiang. Refutational theorem proving using term-rewriting systems. Artificial Intelligence, 25:255–300, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  15. Udo Kebschull. Verhaltensbasierte und spektrale Logiksynthese mehrstufiger Schaltnetze unter Verwendung von Binärbäumen. PhD thesis, Universität Tübingen, D, June 1994.

    Google Scholar 

  16. Udo Kebschull, Endric Schubert, and Wolfgang Rosenstiel. Multilevel logic synthesis based on functional decision diagrams. In Proc. European Design Automation Conference (EURO-DAC), 1992.

    Google Scholar 

  17. Paliath Narendran and Jonathan Stillman. Formal verification of the Sobel image processing chip. In Graham Birtwistle and P. A. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving, pages 92–127. Springer-Verlag, New York, NY, 1989.

    Google Scholar 

  18. S. Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. K. Srivas. PVS: Combining specification, proof checking, and model checking. In Rajeev Alur and Thomas A. Henzinger, editors, Proc. 8th Conf. Computer Aided Verication (CAV), LNCS 1102, pages 411–414. Springer, 1996.

    Google Scholar 

  19. H. Rueß, N. Shankar, and M. K. Srivas. Modular verification of SRT division. In Rajeev Alur and Thomas A. Henzinger, editors, Computer-Aided Verification, CAV’ 96, number 1102 in Lecture Notes in Computer Science, pages 123–134, New Brunswick, NJ, July/August 1996. Springer-Verlag.

    Google Scholar 

  20. D. Russinoff. A mechanically checked proof of IEEE compliance of a register-transfer-level speci, cation of the AMD-K7 floating-point division and square root instructions. Technical report, 1998. At URL http://www.onr.com/user/russ/david/k7-div-sqrt.html.

  21. Wilhelm G. Spruth. The design of a microprocessor. Springer, 1989.

    Google Scholar 

  22. M. Ronan Sleep, M. J. Plasmeijer, and Marko C. J. D. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. John Wiley & Sons, 1993.

    Google Scholar 

  23. Gunnar Stålmarck and M. Säflund. Modelling and verifying systems and software in prepositional logic. In B. K. Daniels, editor, Proc. Safety in Computer Control Systems (SAFECOMP), pages 31–36, Gatwick, UK, 1990. Pergamon Press.

    Google Scholar 

  24. Gunnar Stålmarck. System for determining prepositional logic theorems by applying values and rules to triplets that are generated from Boolean formula, 1994. United States Patent number 5,276,897; see also Swedish Patent 467 076.

    Google Scholar 

  25. Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B (Formal Models and Semantics). Elsevier-The MIT Press, paperback edition, 1994.

    Google Scholar 

  26. Martin Wirsing. Algebraic specification. In van Leeuwen [vL94], chapter 13, pages 675–788.

    Google Scholar 

  27. Hantao Zhang, Maria Paola Bonacina, and Jieh Hsiang. PSATO: a distributed prepositional prover and its application to quasigroup problems. J. Symbolic Computation, 21:543–560, 1996.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geser, A., Küchlin, W. (1999). Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip. In: Hutter, D., Stephan, W., Traverso, P., Ullmann, M. (eds) Applied Formal Methods — FM-Trends 98. FM-Trends 1998. Lecture Notes in Computer Science, vol 1641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48257-1_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-48257-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66462-8

  • Online ISBN: 978-3-540-48257-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics