Skip to main content
SpringerLink
Log in

Verifying parameterized networks using abstraction and regular languages

  • Session: Model Checking II
  • Conference paper
  • First Online:
CONCUR '95: Concurrency Theory (CONCUR 1995)

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

Included in the following conference series:

Abstract

This paper describes a technique based on network grammars and abstraction to verify families of state-transition systems. The family of state-transition systems is represented by a context-free network grammar. Using the structure of the network grammar our technique constructs an invariant which simulates all the state-transition systems in the family. A novel idea used in this paper is to use regular languages to express state properties. We have implemented our techniques and verified two non-trivial examples.

This research was sponsored in part by the Avionics Laboratory, Wright Research and Development Center, Aeronautical Systems Division (AFSC), U.S. Air Force, Wright-Patterson AFB, Ohio 45433-6543 under Contract F33615-90-C-1465, ARPA Order No. 7597 and in part by the National Science Foundation under Grant no. CCR-8722633 and in part by the Semiconductor Research Corporation under Contract 92-DJ-294. The second author was partially supported by grant no. 120–732 from The United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel.

The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. government.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Apt and D. Kozen. Limits for automatic verification of finite-state systems. IPL, 15:307–309, 1986.

    Google Scholar 

  2. M. Browne, E. Clarke, and O. Grumberg. Reasoning about networks with many identical finite-state processes. Inf. and Computation, 81(1):13–31, Apr. 1989.

    Article  Google Scholar 

  3. J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic model checking: 1020 states and beyond. Inf. and Computation, 98(2):142–170, June 1992.

    Article  Google Scholar 

  4. E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Logic of Programs: Workshop, Yorktown Heights, NY, May 1981, volume 131 of LNCS. Springer-Verlag, 1981.

    Google Scholar 

  5. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Prog. Lang. Syst., 8(2):244–263, 1986.

    Article  Google Scholar 

  6. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. In Proc. 19th Ann. ACM Symp. on Principles of Prog. Lang., Jan. 1992.

    Google Scholar 

  7. D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems: Abstractions preserving ACTL*,ECTV*, and CTL*. In IFIP working conference and Programming Concepts, Methods and Calculi (PROCOMET'94), San Miniato, Italy, June 1994.

    Google Scholar 

  8. E. Dijkstra. Invariance and non-determinacy. In C. Hoare and J. Sheperdson, editors, Mathematical Logic and Programming Languages. 1985.

    Google Scholar 

  9. E. Emerson and K. S. Namjoshi. Reasoning about rings. In Proc. 22nd Ann. ACM Symp. on Principles of Prog. Lang., Jan. 1995.

    Google Scholar 

  10. S. German and A. Sistla. Reasoning about systems with many processes. J. ACM, 39:675–735, 1992.

    Article  Google Scholar 

  11. R. P. Kurshan and K. L. McMillan. A structural induction theorem for processes. In Proc. 8th Ann. ACM Symp. on Principles of Distributed Computing. ACM Press, Aug. 1989.

    Google Scholar 

  12. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th Ann. ACM Symp. on Principles of Prog. Lang., Jan. 1985.

    Google Scholar 

  13. R. Marelly and O. Grumberg. GORMEL—Grammar ORiented ModEL checker. Technical Report 697, The Technion, Oct. 1991.

    Google Scholar 

  14. R. Milner. An algebraic definition of simulation between programs. In In proceedings of the 2nd International Joint Conference on Artificial Intelligence, pages 481–489, 1971.

    Google Scholar 

  15. R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer-Verlag, 1980.

    Google Scholar 

  16. J. Quielle and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. Fifth Int. Symp. in Programming, 1981.

    Google Scholar 

  17. Z. Shtadler and O. Grumberg. Network grammars, communication behaviors and automatic verification. In Sifakis [18].

    Google Scholar 

  18. J. Sifakis, editor. Proc. 1989 Int. Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of LNCS. Springer-Verlag, June 1989.

    Google Scholar 

  19. J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, 1984.

    Google Scholar 

  20. I. Vernier. Parameterized evaluation of CTL-X formulae. In Workshop accompanying the Internation Conference on Temporal Logic (ICTL'94), 1994.

    Google Scholar 

  21. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In Sifakis [18].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie Mellon University, 15213, Pittsburgh, PA

    E. M. Clarke & S. Jha

  2. Computer Science Dept, The Technion, 32000, Haifa, Israel

    O. Grumberg

Authors
  1. E. M. Clarke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. Grumberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Jha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Insup Lee Scott A. Smolka

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clarke, E.M., Grumberg, O., Jha, S. (1995). Verifying parameterized networks using abstraction and regular languages. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-60218-6_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60218-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation