Skip to main content

The Formal Classification and Verification of Simpson’s 4-Slot Asynchronous Communication Mechanism

  • Conference paper
  • First Online:

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

Abstract

This paper critiques and extends Lamport’s taxonomy of asynchronous registers, [8], [9]. This extended taxonomy is used to characterise Simpson’s 4-slot asynchronous communication mechanism (ACM), [15], [16], [17], [18], [19]. A formalisation of the Lamport atomic property and Simpson’s original 4-slot implementation is given in the PVS logic [12]. We prove that the 4-slot is atomic using Nipkow’s retrieve relation proof rules, [10], [11], [7]. A description is given of the formal proofs, which have been discharged in the PVS theorem prover [13].

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Angerholm, J. Bicarregui, and S. Maharaj. On the Verification of VDM Specifications and Refinement with PVS. In J.C. Bicarregui, editor, Proof in VDM: Case Studies, FACIT. Springer, 1998.

    Google Scholar 

  2. P. Brooke, J.L. Jacob, and J.M. Armstrong. Analysis of the Four-Slot Mechanism. In Proceedings of the BCS-FACS Northern Formal Methods Workshop, 1996.

    Google Scholar 

  3. P.J. Brooke. A Timed Semantics for a Hierarchical Design Notation. PhD thesis, Department of Computer Science, University of York, April 1999.

    Google Scholar 

  4. Neil Henderson and Stephen Paynter. The formal classification and verification of simpson’s 4-slot asynchronous communication mechanism. Technical Report CS-TR-756, University of Newcastle, 2002.

    Google Scholar 

  5. C.A.R. Hoare. Monitors: An Operating System Structuring Concept. Communications of the ACM, 17(10):549–557, 1974.

    Article  MATH  Google Scholar 

  6. Joint IECCA and MUF Committee on MASCOT (JIMCOM). The Official Handbook of MASCOT: Version 3.1-Issue 1, June 1987. Crown Copyright.

    Google Scholar 

  7. C.B. Jones. Systematic Software Development Using VDM: Second Edition. Prentice-Hall International Series in Computer Science, 1990.

    Google Scholar 

  8. L. Lamport. On Interprocess Communication-Part 1: Basic Formalism. Distributed Computing, 1:77–85, 1986.

    Article  MATH  Google Scholar 

  9. L. Lamport. On Interprocess Communication-Part 2: Algorithms. Distributed Computing, 1:86–101, 1986.

    Article  MATH  Google Scholar 

  10. T. Nipkow. Non-deterministic data types: Models and implementations. Acta Informatica, 22:629–661, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  11. T. Nipkow. Behavioural Implementation Concepts for Nondeterministic Data Types. PhD thesis, University of Manchester, May 1987.

    Google Scholar 

  12. S. Owre, N. Shanker, J.M. Rushby, and D.W.J. Stringer-Calvert. PVS Language: Version 2.3. Technical report, Computer Science Laboratory-SRI International, September 1999.

    Google Scholar 

  13. S. Owre, N. Shanker, J.M. Rushby, and D.W.J. Stringer-Calvert. PVS System Guide: Version 2.3. Technical report, Computer Science Laboratory-SRI International, September 1999.

    Google Scholar 

  14. H.R. Simpson. The MASCOT Method. Software Engineering Journal, 1(3):103–120, 1986.

    Article  Google Scholar 

  15. H.R. Simpson. Four-Slot Fully Asynchronous Communication Mechanism. IEE Proceedings, 137 Part E(1):17–30, January 1990.

    Google Scholar 

  16. H.R. Simpson. Correctness Analysis for Class of Asynchronous Communication Mechanism. IEE Proceedings, 139 Part E(1):35–49, January 1992.

    Google Scholar 

  17. H.R. Simpson. Multireader and Multiwriter Asynchronous Communication Mechanisms. IEE Proceedings of Computer Digital Technology, 144(4):241–243, July 1997.

    Google Scholar 

  18. H.R. Simpson. New Algorithms for Asynchronous Communication. IEE Proceedings of Computer Digital Technology, 144(4):227–231, July 1997.

    Google Scholar 

  19. H.R. Simpson. Role Model Analysis of an Asynchronous Communication Mechanism. IEE Proceedings of Computer Digital Technology, 144(4):232–240, July 1997.

    Google Scholar 

  20. H.R. Simpson. Protocols for Process Interaction. Resubmitted to IEE Proceedings on Software, 2001.

    Google Scholar 

  21. F Xia. Supporting the MASCOT method with Petri net techniques for real-time systems development. PhD thesis, London University, King’s College, January 2000.

    Google Scholar 

  22. A. Yakovlev, F. Xia, and D. Shang. Synthesis and Implementation of a Signal-Type Asynchronous Data Communication Mechanism. In Proceedings of the 7 th International Symposium on Asynchronous Circuits and Systems (ASYNC 2001)-Salt Lake City, March 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Henderson, N., Paynter, S.E. (2002). The Formal Classification and Verification of Simpson’s 4-Slot Asynchronous Communication Mechanism. In: Eriksson, LH., Lindsay, P.A. (eds) FME 2002:Formal Methods—Getting IT Right. FME 2002. Lecture Notes in Computer Science, vol 2391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45614-7_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45614-7_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43928-8

  • Online ISBN: 978-3-540-45614-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics