Skip to main content
SpringerLink
Log in

Generalized Reversible Rules

  • Conference paper
  • First Online:
Formal Methods in Computer-Aided Design (FMCAD 1998)

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

Included in the following conference series:

  • 390 Accesses

Abstract

A generalized notion of reversible rules is presented in this paper to perform state reduction in automatic formal verification. The key idea is that some of the transition rules in a design may be invertible, and therefore, they can be used to collapse subgraphs into abstract states, thereby reducing the state explosion problem.

This paper improves upon previous work to achieve the following goals: 1) the definition of reversible rules is simplified so that it is easy to apply the reduction method in practice; 2) the definition is generalized to allow more reduction in the size of the state graph.

The reduction algorithm can be combined with symmetry reduction techniques, for verification of invariants, deadlock-freedom, and stuttering-invariant temporal properties.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BCM+90._J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. 5th IEEE Symposium on Logic in Computer Science, 1990.

    Google Scholar 

  2. J. Billing, M. C. Wilbur-Ham, and M. Y. Bearman. Automated protocol verification. Protocol Specification, Testing, and Verification, V, 1986.

    Google Scholar 

  3. Olivier Coudert, Christian Berthet, and Jean Christophe Madre. Verification of synchronous sequential machines based on symbolic execution. Automatic Verification Methods for Finite State Systems, 1989.

    Google Scholar 

  4. David L. Dill, Andreas J. Drexler, Alan J. Hu, and C. Han Yang. Protocol verification as a hardware design aid. IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 522–525, 1992.

    Google Scholar 

  5. David L. Dill. Protocols used in class CS355. Stanford University, Spring 1994–1995.

    Google Scholar 

  6. E. Allen Emerson, editor. Formal Methods in System Design, Special Issue on Symmetry in Automatic Verification, volume 9(1/2). Kluwer Academic Publishers, August 1996.

    Google Scholar 

  7. Orna Grumberg and David E. Long. Model checking and modular verification. ACM Transaction on Programming Languages and Systems, 16(3):843–871, May 1994.

    Google Scholar 

  8. P. Godefroid and P. Wolper. A partial approach to model checking. Information and Computation, 110(2):305–326, May 1994.

    Google Scholar 

  9. C. Norris Ip and David L. Dill. Better verification through symmetry. 11th International Symposium on Computer Hardware Description Languages and Their Applications, pages 87–100, April 1993.

    Google Scholar 

  10. C. Norris Ip and David L. Dill. State reduction using reversible rules. 33rd Design Automation Conference, pages 564–567, June 1996.

    Google Scholar 

  11. C. Jard and Th. Jeron. Bounded-memory algorithms for verification on-the-fly. 3rd Workshop on Computer-Aided Verification, July 1991.

    Google Scholar 

  12. L. Lamport. What good is temporal logic. Information Processing 83, pages 657–668, 1983.

    Google Scholar 

  13. Daniel Lenoski, James Laudon, Kourosh Gharachorloo, Anoop Gupta, and John Hennessy. The directory-based cache coherence protocol for the DASH multiprocessor. 17th International Symposium on Computer Architecture, 1990.

    Google Scholar 

  14. Daniel Lenoski, James Laudon, Kourosh Gharachorloo, Wolf-Dietrich Weber, Anoop Gupta, John Hennessy, Mark Horowitz, and Monica Lam. The Stanford DASH multiprocessor. Computer, 25(3), 1992.

    Google Scholar 

  15. John M. Mellor-Crummey and Michael L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1), 1991.

    Google Scholar 

  16. Hillel Miller and Shmuel Katz. Saving space by fully exploiting invisible transitions. 8th International Conference on Computer-Aided Verification, pages 336–347, 1996.

    Google Scholar 

  17. D. Peled. Partial order reduction: Model-checking using representatives. 21st International Symposium on Mathematical Foundations of Computer Science, 1996.

    Google Scholar 

  18. G. L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3), 1981.

    Google Scholar 

  19. A. Valmari. On-the-fly verification with stubborn sets. 5th International Conference on Computer Aided Verification, pages 397–408, June 1993.

    Google Scholar 

  20. Pierre Wolper. On the relation of programs and computations to models of temporal logic. Colloquium on Temporal Logic in Specification, 1987.

    Google Scholar 

  21. Pitro Zafiropulo, Colin H. West, Harry Rudin, D. D. Cowan, and Daniel Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, 28(4), April 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cadence Berkeley Laboratories, Cadence Design Systems, Inc., USA

    C. Norris Ip

Authors
  1. C. Norris Ip
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Utah, 50 S Central Campus, Salt Lake City, UT, 841112-9205, USA

    Ganesh Gopalakrishnan

  2. Department of Computer Science, Brigham Young University, 3361 TMCB, Provo, UT, 84602-6576, USA

    Phillip Windley

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Norris Ip, C. (1998). Generalized Reversible Rules. In: Gopalakrishnan, G., Windley, P. (eds) Formal Methods in Computer-Aided Design. FMCAD 1998. Lecture Notes in Computer Science, vol 1522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49519-3_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-49519-3_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49519-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation