Skip to main content

Time sequences as a tool for describing program behaviour

  • Algebraic Semantics
  • Conference paper
  • First Online:
Abstract Software Specifications

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O.-J. Dahl: Can Program Proving be Made Practical? In "Les Fondaments de la Programmation", IRIA 1978.

    Google Scholar 

  2. J. Guttag et al: Abstract Data Types and Software Validation. CACM 21, 12 (Dec 1978).

    Google Scholar 

  3. D.E. Knuth, P.B. Bendix: Simple Word Problems in Universal Algebras. In "Computational Problems in Abstract Algebra", Pergamon Press 1969.

    Google Scholar 

  4. D. Musser: A Data Type Verification System Based on Rewrite Rules. USC Information Sciences Institute, 1978.

    Google Scholar 

  5. R. Nakajima et al: Describing and Verifying Programs with Abstract Data Types. In "Formal Description of Programming Concepts", North Holland Publ. Comp., 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dines Bjøorner

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dahl, OJ. (1980). Time sequences as a tool for describing program behaviour. In: Bjøorner, D. (eds) Abstract Software Specifications. Lecture Notes in Computer Science, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10007-5_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-10007-5_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38136-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics