Skip to main content
SpringerLink
Log in

Specifications of concurrently accessed data

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematics of Program Construction (MPC 1989)

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

Included in the following conference series:

Abstract

Our specification of the buffer illustrates how some of the requirements described in the introduction are met. The specification is concise, and it can be manipulated easily. This allowed us to derive several properties of the buffer (Appendix A) and construct a proof of buffer concatenation (Section 4). Also refinement of the specification with the eventual goal of implementation seems feasible with this scheme.

Partially supported by ONR Contracts N00014-86-K-0763 and N00014-87-K-0510, by a fellowship from The John Simon Guggenheim Foundation, and by a grant from The University of Texas URI-FRA.

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. Mani Chandy and Jayadev Misra, Parallel Program Design: A Foundation, Addison-Wesley, Reading, Mass., 1988.

    Google Scholar 

  2. John Guttag, “Abstract Data Types and the Development of Data Structures,” Comm. of the ACM, Vol. 20, No. 6, June 1977, pp. 396–404.

    Google Scholar 

  3. B. Hailpern, “Verifying Concurrent Processes Using Temporal Logic,” Springer-Verlag, Lecture notes in Computer Science 129, 1982.

    Google Scholar 

  4. Specification Case Studies, Ian Hayes (ed.), Prentice-Hall International, Englewood Cliffs, N. J., 1987.

    Google Scholar 

  5. L. Lamport, “A Simple Approach to Specifying Concurrent Systems,” Digital Systems Research Center Report 15, December 1986, 130 Lytton Avenue, Palo Alto, California 94301.

    Google Scholar 

  6. J. Misra, “General Conjunction and Disjunction Rules for unless,” Notes on UNITY 01-88, University of Texas at Austin, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, The University of Texas at Austin, 78712, Austin, Texas

    Jayadev Misra

Authors
  1. Jayadev Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. L. A. van de Snepscheut

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Misra, J. (1989). Specifications of concurrently accessed data. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-51305-1_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51305-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation