Skip to main content
SpringerLink
Log in
Book cover

Annual Asian Computing Science Conference

ASIAN 1996: Concurrency and Parallelism, Programming, Networking, and Security pp 276–286Cite as

Hierarchical verification using verification diagrams

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and L. Lamport. The existence of refinement mappings. In Proc. 3rd IEEE Symp. Logic in Comp. Sci., pg. 165–175. IEEE Computer Society Press, 1988.

    Google Scholar 

  2. B. Alpern and F.B. Schneider. Verifying temporal properties without temporal logic. ACM Trans. Prog. Lang. Sys., 11:147–167, 1989.

    Article  Google Scholar 

  3. A. Browne, Z. Manna, and H.B. Sipma. Generalized verification diagrams. In 15th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1026 of LNCS, pages 484–498, December 1995.

    Google Scholar 

  4. L. de Alfaro and Z. Manna. Temporal verification by diagram transformations. In Proc. 8 th Intl. Conference on Computer Aided Verification, July 1996.

    Google Scholar 

  5. D. Harel. Statecharts: A visual formalism for complex systems. Sci. Comp. Prog., 8:231–274, 1987.

    Article  Google Scholar 

  6. Z. Manna and A. Pnueli. Temporal verification diagrams. In Proc. Int. Symp. on Theoretical Aspects of Computer Software, volume 789 of LNCS, pages 726–765. Springer-Verlag, 1994.

    Google Scholar 

  7. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.

    Google Scholar 

  8. Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Prog. Lang. Sys., 6(1):68–93, January 1984.

    Article  Google Scholar 

  9. P. Wolper. Temporal logic can be more expressive. Information and Control, 56:72–99, 1983.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    I. A. Browne, Z. Manna & H. B. Sipma

Authors
  1. I. A. Browne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Z. Manna
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. B. Sipma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joxan Jaffar Roland H. C. Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Browne, I.A., Manna, Z., Sipma, H.B. (1996). Hierarchical verification using verification diagrams. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027800

Download citation

  • DOI: https://doi.org/10.1007/BFb0027800

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62031-0

  • Online ISBN: 978-3-540-49626-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation