Advertisement

Hierarchical development of concurrent systems in a temporal logic framework

  • Howard Barringer
  • Ruurd Kuiper
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 197)

Abstract

This paper presents a formal specification and hierarchic development method for concurrent systems. The approach is based on a temporal logic to enable the specification of both safety and liveness properties in a single uniform framework. Two main problems are addressed, firstly, the reconciliation of temporal logic and compositionality in a structured specification approach, and secondly, to possess natural and easy to use proof rules for justifying parallel decomposition steps. To solve the first, we use a simple modification to the usual temporal logic model; to solve the second, we advocate the use of past time temporal operators in a new systematic and structured style for writing specifications.

Keywords

Temporal Logic Parallel Composition Past Time Modus Ponens Concurrent System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ac83]
    P.Aczel On an Inference Rule for Parallel Composition Internal Memo Department of Mathematics, University of Manchester, 1983.Google Scholar
  2. [BK83]
    H.Barringer and R.Kuiper Towards the Hierarchical, Temporal Logic, Specification of Concurrent Systems Proc. of the STL/SERC Workshop on the Analysis of Concurrent Systems Cambridge, September 1983.Google Scholar
  3. [BKP84a]
    H.Barringer, R.Kuiper and A.Pnueli Now You May Compose Temporal Logic Specifications Proc. of the 16th ACM Symposium on the Theory of Computing Washington, May 1984.Google Scholar
  4. [BKP84b]
    H.Barringer, R.Kuiper and A.Pnueli A Compositional Temporal Approach to a CSP-like Language Internal Report Department of Computer Science, University of Manchester, Oct. 1984.Google Scholar
  5. [Go84]
    G.D.Gough Decision Procedures for Temporal Logic M.Sc. Dissertation Department of Computer Science, University of Manchester, Oct. 1984.Google Scholar
  6. [HO83]
    B.T. Hailpern and S.S. Owicki Modular Verification of Computer Communication Protocols IEEE Trans. on Commun. COM-31, 1, Jan. 1983, pp56–68.Google Scholar
  7. [Ho81]
    C.A.R. Hoare A Calculus of Total Correctness for Communicating Processes Science of Computer Programming, 1, 1981, pp49–72.Google Scholar
  8. [Jo83]
    C.B. Jones Specification and Design of (Parallel) Programs Proc. IFIP 83, Paris, North Holland, 1983, pp321–332.Google Scholar
  9. [La83]
    L. Lamport Specifying Concurrent Program Modules ACM TOPLAS, Apr 1983, Vol. 5, No. 2, 1983, pp190–222.Google Scholar
  10. [LG81]
    G.M. Levin and D. Gries A Proof Technique for Communicating Sequential Processes Acta Informatica 15, 1981, pp281–302.Google Scholar
  11. [MC81]
    J.Misra and K.M.Chandy Proofs about Networks of Processes IEEE TOSE Vol SE-7, No. 4, July 1981.Google Scholar
  12. [MCS82]
    J.Misra, K.M.Chandy and T.Smith Proving Safety and Liveness of Communicating Processes with Examples Proc. 1st ACM SIGACP/SIGOPS Symp. on PODC, Ottawa, Aug. 1982.Google Scholar
  13. [MP82a]
    Z. Manna and A. Pnueli Verification of Concurrent Programs: The Temporal Framework in “The Correctness Problem in Computer Science” ed. R.S. Boyer and J.S. Moore International Lecture Notes in Computer Science, pp215–273 Academic Press, London, 1982.Google Scholar
  14. [MP82b]
    Z.Manna and A.Pnueli Verification of Concurrent Programs: A Temporal Proof System Computer Science Report, Stanford University, 1983.Google Scholar
  15. [OG76]
    S.S. Owicki and D. Gries An Axiomatic Proof Technique for Parallel Programs 1 Acta Informatica, 6, 1976, pp319–340.Google Scholar
  16. [OL82]
    S.S. Owicki and L. Lamport Proving Liveness Properties of Concurrent Programs ACM TOPLAS, Vol. 4, No. 3, July 1982, pp455–495.Google Scholar
  17. [Pn79]
    The Temporal Semantics of Concurrent Computation Proc. of the Symp. on Semantics of Concurrent Computation Evian, France, July 1979 Springer-Verlag, LNCS Vol. 70, pp1–20.Google Scholar
  18. [Pr67]
    A.Prior Past, Present and Future Oxford University Press, 1967.Google Scholar
  19. [SCFG82]
    A.P.Sistla, E.M.Clarke, N.Francez and Y.Gurevich Can Buffers be Specified in Linear Temporal Logic? Proc. 1st ACM SIGACP/SICOPS Symp. on PODC, Ottawa, Aug. 1982.Google Scholar
  20. [SJ84]
    Sa Jin Temporal Logic Specification of Communication Protocols Ph.D. Transfer Report Department of Computer Science, University of Manchester, Sep. 1984.Google Scholar
  21. [Wo81]
    P.Wolper Temporal Logic can be more Expressive Proc. of the 22nd Symp. on FOCS, Oct. 1981.Google Scholar
  22. [ZH80]
    Zhou Chao Chen and C.A.R.Hoare Partial Correctness of Communicating Processes and Protocols Proc. of 2nd Int. Conf. on Distributed Computing Systems, 1981.Google Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • Howard Barringer
    • 1
  • Ruurd Kuiper
    • 1
  1. 1.Department of Computer ScienceUniversity of ManchesterManchesterEngland

Personalised recommendations