Skip to main content
Springer Nature Link
Log in

Abstraction and Modular Verification of Infinite-State Reactive Systems

  • Conference paper
Requirements Targeting Software and Systems Engineering (RTSE 1997)

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

  • 283 Accesses

Abstract

We review a number of temporal verification techniques for reactive systems using modularity and abstraction. Their use allows the verification of larger systems, and the incremental verification of systems as they are developed and refined. In particular, we show how deductive verification tools, and the combination of finite-state model checking and abstraction, allow the verification of infinite-state systems featuring data types commonly used in software specifications, including real-time and hybrid systems.

This research was supported in part by the National Science Foundation under grant CCR-95-27927, the Defense Advanced Research Projects Agency under NASA grant NAG2-892, ARO under grant DAAH04-95-1-0317, ARO under MURI grant DAAH04-96-1-0341, and by Army contract DABT63-96-C-0096 (DARPA).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Abrial, J.R., Boerger, E., Langmaack, H. (eds.): Dagstuhl Seminar 1995. LNCS, vol. 1165. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  2. Alur, R., Henzinger, T.A., Sontag, E.D. (eds.): HS 1995. LNCS, vol. 1066. Springer, Heidelberg (1996)

    Google Scholar 

  3. Bjørner, N.S., Browne, A., Chang, E.S., Colón, M., Kapur, A., Manna, Z., Sipma, H.B., Uribe, T.E.: STeP: The Stanford Temporal Prover, User’s Manual. Technical Report STAN-CS-TR-95-1562, Computer Science Department, Stanford University (November 1995)

    Google Scholar 

  4. Bjørner, N.S., Browne, A., Chang, E.S., Colón, M., Kapur, A., Manna, Z., Sipma, H.B., Uribe, T.E.: STeP: Deductive-algorithmic verification of reactive and real-time systems. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 415–418. Springer, Heidelberg (1996)

    Google Scholar 

  5. Bjørner, N.S., Browne, A., Manna, Z.: Automatic generation of invariants and intermediate assertions. Theoretical Computer Science 173(1), 49–87 (1997); Preliminary version aqppeared in Montanari, U., Rossi, F. (eds.): CP 1995. LNCS, vol. 976, pp. 589–623. Springer, Heidelberg (1995)

    Google Scholar 

  6. Bjørner, N.S., Lerner, U., Manna, Z.: Deductive verification of parameterized fault-tolerant systems: A case study. In: Intl. Conf. on Temporal Logic. Kluwer, Dordrecht (1997) (to appear)

    Google Scholar 

  7. Bensalem, S., Lakhnech, Y., Owre, S.: Computing abstractions of infinite state systems compositionally and automatically. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 319–331. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Browne, A., Manna, Z., Sipma, H.B.: Generalized temporal verification diagrams. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 484–498. Springer, Heidelberg (1995)

    Google Scholar 

  9. Bjørner, N.S., Manna, Z., Sipma, H.B., Uribe, T.E.: Deductive verification of real-time systems using STeP. In: Rus, T., Bertrán, M. (eds.) AMAST-ARTS 1997, ARTS 1997, and AMAST-WS 1997. LNCS, vol. 1231, pp. 22–43. Springer, Heidelberg (1997)

    Google Scholar 

  10. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fix-points. In: 4th ACM Symp. Princ. of Prog. Lang., pp. 238–252. ACM Press, New York (1977)

    Google Scholar 

  11. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proc. IBM Workshop on Logics of Programs. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1981)

    Google Scholar 

  12. Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Trans. on Programming Languages and Systems 16(5), 1512–1542 (1994)

    Article  Google Scholar 

  13. Colón, M.A., Uribe, T.E.: Generating finite-state abstractions of reactive systems using decision procedures. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 293–304. Springer, Heidelberg (1998)

    Google Scholar 

  14. Dams, D.R.: Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology (July 1996)

    Google Scholar 

  15. de Bakker, J.W., de Roever, W.P., Rosenberg, G. (eds.): REX 1989. LNCS, vol. 430. Springer, Heidelberg (1990)

    Google Scholar 

  16. Dams, D.R., Grümberg, O., Gerth, R.: Abstract interpretation of reactive systems: Abstractions preserving VCTL*, 3ECTL*, CTL*. In: IFIP Working Conference on Programming Concepts, Methods and Calculi (PRO-COMET 1994), pp. 573–592 (June 1994)

    Google Scholar 

  17. Damm, W., Grümberg, O., Hungar, H.: What if model checking must be truly symbolic. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 230–244. Springer, Heidelberg (1995)

    Google Scholar 

  18. D’Argenio, P.R., Katoen, J.P., Ruys, T., Tretmans, G.T.: The bounded retransmission protocol must be on time! In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 416–432. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  19. Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool krones. In: Alur, et al. (eds.) [AHS96], pp. 208–219 (1996)

    Google Scholar 

  20. Finkbeiner, B., Manna, Z., Sipma, H.B.: Deductive verification of modular systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, p. 239. Springer, Heidelberg (1998) (to appear)

    Google Scholar 

  21. Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72–83. Springer, Heidelberg (1997)

    Google Scholar 

  22. Henzinger, T.A., Ho, P.: HyTech: The Cornell hybrid technology tool. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1994. LNCS, vol. 999, pp. 265–293. Springer, Heidelberg (1995)

    Google Scholar 

  23. Havelund, K., Lowry, M., Penix, J.: Formal verification of a space craft controller. Technical report, NASA Ames Research Center (1998)

    Google Scholar 

  24. Havelund, K., Shankar, N.: Experiments in theorem proving and model checking for protocol verification. In: Gaudel, M.-C., Woodcock, J.C.P. (eds.) FME 1996. LNCS, vol. 1051, pp. 662–681. Springer, Heidelberg (1996)

    Google Scholar 

  25. Jackson, D., Wing, J.: Lightweight formal methods. IEEE Computer (April 1996)

    Google Scholar 

  26. Kesten, Y., Manna, Z., Pnueli, A.: Temporal verification of simulation and refinement. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 273–346. Springer, Heidelberg (1994)

    Google Scholar 

  27. Kesten, Y., Manna, Z., Pnueli, A.: Verifying clocked transition systems. In: Alur, et al. (eds.) [AHS96], pp. 13–40 (1996)

    Google Scholar 

  28. Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design 6, 1–35 (1995)

    Article  Google Scholar 

  29. Long, D.E.: Model Checking, Abstraction, and Compositional Verification. PhD thesis, School of Computer Science, Carnegie-Mellon University, Pittsburgh, PA (July 1993)

    Google Scholar 

  30. Manna, Z., Bjørner, N.S., Browne, A., Colón, M., Finkbeiner, B., Pichora, M., Sipma, H.B., Uribe, T.E.: An update on STeP: Deductive-algorithmic verification of reactive systems. Tool Support for System Specification, Development and Verification, Christian-Albrechts-Universitat, Kiel, June 1998, 87–91 (1998); Bericht Nr. 9803

    Google Scholar 

  31. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Pub., Dordrecht (1993)

    MATH  Google Scholar 

  32. Manna, Z., Pnueli, A.: Temporal verification diagrams. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 726–765. Springer, Heidelberg (1994)

    Google Scholar 

  33. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (1995)

    Google Scholar 

  34. Manna, Z., Pnueli, A.: Clocked transition systems. Technical Report STAN-CS-TR-96-1566, Computer Science Department, Stanford University (April 1996)

    Google Scholar 

  35. Manna, Z., Sipma, H.B.: Deductive verification of hybrid systems using STeP. In: Henzinger, T., Sastry, S. (eds.) HSCC 1998. LNCS, vol. 1386, pp. 305–318. Springer, Heidelberg (1998)

    Google Scholar 

  36. Pnueli, A.: The temporal logic of programs. In: Proc. 18th IEEE Symp. Found. of Comp. Sci., pp. 46–57. IEEE Computer Society Press, Los Alamitos (1977)

    Google Scholar 

  37. Queille, J., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol. 137, pp. 337–351. Springer, Heidelberg (1982)

    Google Scholar 

  38. Sipma, H.B., Uribe, T.E., Manna, Z.: Deductive model checking. To appear in Formal Methods in System Design (1998); Preliminary version appeared in Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 208–219. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Stanford University, Stanford, CA, 94305-9045

    Zohar Manna, Michael A. Colón, Bernd Finkbeiner, Henny B. Sipma & Tomás E. Uribe

Authors
  1. Zohar Manna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael A. Colón
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bernd Finkbeiner
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Henny B. Sipma
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Tomás E. Uribe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität München, Germany

    Manfred Broy

  2. Institute for Software Systems Engineering, Braunschweig University of Technology, Mühlenpfordtstraße 23, 38106, Braunschweig, Germany

    Bernhard Rumpe

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manna, Z., Colón, M.A., Finkbeiner, B., Sipma, H.B., Uribe, T.E. (1998). Abstraction and Modular Verification of Infinite-State Reactive Systems. In: Broy, M., Rumpe, B. (eds) Requirements Targeting Software and Systems Engineering. RTSE 1997. Lecture Notes in Computer Science, vol 1526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692867_13

Download citation

  • DOI: https://doi.org/10.1007/10692867_13

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49439-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation