Skip to main content
SpringerLink
Log in

Symbolic Analysis of Transition Systems?

  • Conference paper
  • First Online:
Abstract State Machines - Theory and Applications (ASM 2000)

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

Included in the following conference series:

Abstract

We give a brief overview of the Symbolic Analysis Laboratory (SAL) project. SAL is a verification framework that is directed at analyzing properties of transition systems by combining tools for program analysis, model checking, and theorem proving. SAL is built around a small intermediate language that serves as a semantic representation for transition systems that can be used to drive the various analysis tools.

This work was funded by the Defence Advanced Research Projects Agency under Contract NO. F30603-96-C-0204, and NSF Grants No. CCR-9712383 and CCR-9509931. The SAL project is a combined effort between SRI International, Stanford University, and the University of California, Berkeley.

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. Rajeev Alur and Thomas A. Henzinger, editors. Computer-Aided Verification, CAV’ 96, volume 1102 of Lecture Notes in Computer Science, New Brunswick, NJ, July/August 1996. Springer-Verlag.

    MATH  Google Scholar 

  2. R. Alur and T.A. Henzinger. Reactive modules. Formal Methods in System Design, 15(1):7–48, 1999.

    Article  Google Scholar 

  3. Nikolaj Bjørner, I. Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49–87, 1997.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. G. Berry and G. Gonthier. The Esterel synchronous programming language: Design, semantics, and implementation. Science of Computer Programming, 19(2):87–152, 1992.

    Article  MATH  Google Scholar 

  6. Saddek Bensalem, Vijay Ganesh, Yassine Lakhnech, César Muñoz, Sam Owre, Harald Rue\, John Rushby, Vlad Rusu, Hassen Saïdi, N. Shankar, Eli Singerman, and Ashish Tiwari. An overview of SAL. In C. Michael Holloway, editor, LFM 2000: Fifth NASA Langley Formal Methods Workshop, Hampton, VA, June 2000. NASA Langley Research Center. To appear.

    Google Scholar 

  7. Saddek Bensalem and Yassine Lakhnech. Automatic generation of invariants. Formal Methods in Systems Design, 15(1):75–92, July 1999.

    Google Scholar 

  8. Saddek Bensalem, Yassine Lakhnech, and Sam Owre. Computing abstractions of infinite state systems compositionally and automatically. In Huand Vardi [26], pages 319–331.

    Google Scholar 

  9. Saddek Bensalem, Yassine Lakhnech, and Hassen6Saïdi. Powerful techniques for the automatic generation of invariants. In Alur and Henzinger [1], pages 323–335.

    Google Scholar 

  10. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.

    Google Scholar 

  11. Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement. In E. A. Emerson and A. P. Sistla, editors, Computer-Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, 2000. To appear.

    Google Scholar 

  12. Edmund M. Clarke, Orna Grumberg, and David E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512–1542, September 1994.

    Article  Google Scholar 

  13. E. M. Clarke, Orna Grumberg, and Doron Peled. Model Checking. MIT Press, 1999.

    Google Scholar 

  14. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables. In 5th ACM Symposium on Principles of Programming Languages. Association for Computing Machinery, January 1978.

    Google Scholar 

  15. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA, 1988.

    Google Scholar 

  16. M. A. Col on and T. E. Uribe. Generating finite-state abstractions of reactive systems using decidion procedures. In Hu and Vardi [26], pages 293–304.

    Google Scholar 

  17. Satyaki Das, David L. Dill, and Seungjoon Park. Experience with predicate abstraction. In Halbwachs and Peled [25], pages 160–171.

    Google Scholar 

  18. David L. Dill. The Murø verification system. In Alur and Henzinger [1], pages 390–393.

    Google Scholar 

  19. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. 15th Work. Protocol Specification, Testing, and Verification,Warsaw, June 1995. North-Holland.

    Google Scholar 

  20. Yuri Gurevich. Evolving algebras 1993: Lipari guide. In Egon Börger, editor, Specification and Validation Methods, International Schools for Computer Scientists, pages 9–36. Oxford University Press, Oxford, UK, 1995.

    Google Scholar 

  21. S. M. German and B. Wegbreit. A synthesizer for inductive assertions. IEEE Transactions on Software Engineering, 1(1):68–75, March 1975.

    Article  Google Scholar 

  22. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataflow programming language Lustre. Proceedings of the IEEE, 79(9):1305–1320, September 1991.

    Google Scholar 

  23. C. A. R. Hoare. An axiomatic basis of computer programming. Communications of the ACM, 12(10):576–580, October 1969.

    Article  MATH  Google Scholar 

  24. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.

    Google Scholar 

  25. Nicolas Halbwachs and Doron Peled, editors. Computer-Aided Verification, CAV’ 99, volume 1633 of Lecture Notes in Computer Science, Trento, Italy, July 1999. Springer-Verlag.

    MATH  Google Scholar 

  26. Alan J. Hu and Moshe Y. Vardi, editors. Computer-Aided Verification, CAV’ 98, volume 1427 of Lecture Notes in Computer Science, Vancouver, Canada, June 1998. Springer-Verlag.

    Google Scholar 

  27. S. Katz and Z. Manna. Logical analysis of programs. Communications of the ACM, 19(4):188–206, April 1976.

    Article  MathSciNet  MATH  Google Scholar 

  28. Leslie Lamport. The temporal logic of actions. ACM TOPLAS, 16(3):872–923, May 1994.

    Article  Google Scholar 

  29. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:11–44, 1995.

    Article  MATH  Google Scholar 

  30. Kenneth L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA, 1993.

    Book  MATH  Google Scholar 

  31. Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Volume 1: Specification. Springer-Verlag, New York, NY, 1992.

    Book  MATH  Google Scholar 

  32. Zohar Manna and The STeP Group. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Alur and Henzinger [1], pages 415–418.

    Google Scholar 

  33. A. Pnueli. The temporal logic of programs. In Proc. 18th Symposium on Foundations of Computer Science, pages 46–57, Providence, RI, November 1977. ACM.

    Google Scholar 

  34. Hassen Saïdi. A tool for proving invariance properties of concurrent systems automatically. In Tools and Algorithms for the Construction and Analysis of Systems TACAS’ 96, volume 1055 of Lecture Notes in Computer Science, pages 412–416, Passau, Germany, March 1996. Springer-Verlag.

    Chapter  Google Scholar 

  35. Hassen Saïdi and Susanne Graf. Construction of abstract state graphs with PVS. In Orna Grumberg, editor, Computer-Aided Verification, CAV’ 97, volume 1254of Lecture Notes in Computer Science, pages 72–83, Haifa, Israel, June 1997. Springer-Verlag.

    Chapter  Google Scholar 

  36. N. Suzuki and K. Ishihata. Implementation of an array bound checker. In 4th ACM Symposium on Principles of Programming Languages, pages 132–143, January 1977.

    Google Scholar 

  37. Hassen Saïdi and N. Shankar. Abstract and model check while you prove. In Halbwachs and Peled [25], pages 443–454.

    Google Scholar 

  38. Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proceedings 1st Annual IEEE Symp. on Logic in Computer Science, pages 332–344. IEEE Computer Society Press, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Laboratory, SRI International Menlo Park, CA 94025, USA

    Natarajan Shankar

Authors
  1. Natarajan Shankar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA

    Yuri Gurevich

  2. ETH Zürich, Institute TIK Gloriastr., 35, 8092, Zürich, Switzerland

    Philipp W. Kutter

  3. EPFL Lausanne, DI IN-Ecublens, 1015, Lausanne, Switzerland

    Martin Odersky

  4. ETH Zürich, Institute TIK Gloriastr., 35, 8092, Zürich, Switzerland

    Lothar Thiele

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shankar, N. (2000). Symbolic Analysis of Transition Systems?. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds) Abstract State Machines - Theory and Applications. ASM 2000. Lecture Notes in Computer Science, vol 1912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44518-8_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-44518-8_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67959-2

  • Online ISBN: 978-3-540-44518-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation