Skip to main content
SpringerLink
Log in

Proving partial order liveness properties

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1990)

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

Included in the following conference series:

Abstract

A temporal verification method which is based upon partial order semantics of traces [31] is presented. The semantic model used here can express the distributed nature of a program. E.g., properties such as serializability of database transactions, layering of a program, snapshots or the parallel execution of program segments.

This research was supported in part by the European Community ESPRIT Basic Research Action project 3096 (SPEC).

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. R. Apt, Recursive Assertions and Parallel Programs, Acta Informatica 15(1981), 219–232.

    Google Scholar 

  2. K. Apt, N. Francez, S. Katz, Appraising fairness in languages for distributed programming, Distributed Computing, Vol 2, No 4, 1988, 226–241.

    Google Scholar 

  3. P. A. Bernstein, V. Hadzilacos, N. Goodman, Concurrency control and Recovery in Database Systems, Addison-Wesley, 1987.

    Google Scholar 

  4. K. M. Chandy, L. Lamport, Distributed Snaphshots: determining the global state of distributed systems, ACM Transactions on Computer Systems 3 (1), 1985, 63–75.

    Google Scholar 

  5. E. W. Dijkstra, Cooperating Sequential Processes, Technical Report EWD-123, Technological University, Eindhoven, The Netherlands, 1965, Reprinted in: F. Genuys (Editor), Programming languages, Academic Press, London, 1968, 43–112.

    Google Scholar 

  6. E.W. Dijkstra, Guarded commands, Nondeterminancy and Formal Derivation of Programs, Communication of the ACM, 18(1975), 453–457.

    Google Scholar 

  7. Tz. Elrad, N. Francez, Decomposition of distributed programs into communication-closed layers, Science of Computer Programming 2(1982), 155–173

    Google Scholar 

  8. E.A. Emerson, Alternative semantics for temporal logic, Theoretical Computer Science 26(1983), 121–130.

    Google Scholar 

  9. E. A. Emerson, E. M. Clarke, Using branching time temporal logic to synthesize synchronization skeletons, Science of Computer Programming 2, 1982, 241–266.

    Google Scholar 

  10. E.A. Emerson, J.Y. Halpern, “Sometimes” and “not never” revisited: on branching versus linear time temporal logic, Journal of the ACM 33(1986), 151–178.

    Google Scholar 

  11. N. Francez, Fairness, Springer-Verlag, 1986.

    Google Scholar 

  12. N. Francez, D. Kozen, Generalized Fair Termination, Proc. 11th Symposium on Principles of Programming Languages, Salt Lake City, 1984.

    Google Scholar 

  13. H. Gaifman, V. Pratt, Partial Order Models of Concurrency and Computation of Functions, Symposium on Logic in Computer Science, 1987, 72–85.

    Google Scholar 

  14. O. Grümberg, N. Francez, J. A. Makowski, W. P. de Roever, A proof rule for termination of guarded commands, Information and Control, 66, 1985, 83–102.

    Google Scholar 

  15. D. Harel, First order Dynamic Logic, Lecture Notes in Computer Science 68.

    Google Scholar 

  16. C.A.R. Hoare, Communicating sequential processes, Communications of the ACM, 21(1978), 666–677.

    Google Scholar 

  17. R. Janicki, P. E. Lauer, M. Koutny, R. Devillers, Concurrent and maximally Concurrent Evolution of Non-Sequential System, Theoretical Computer Science, 43(1986), 213–238.

    Google Scholar 

  18. S. Katz, D. Peled, Interleaving Set Temporal Logic, 6th ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, August 1987, 178–190.

    Google Scholar 

  19. S. Katz, D. Peled, An efficient verification method for parallel and distributed programs, Rex workshop on Linear Time, Branching Time and Partial order in Logics and models for Concurrency, Noordwijkerhout, The Netherlands, May/June 1988, Lecture Notes on Computer Science 354, 489–507.

    Google Scholar 

  20. S. Katz, D. Peled, Defining Conditional Independence Using Collapses, to appear in BCS-FACS Workshop on Semantics for Concurrency, July 90.

    Google Scholar 

  21. M. Z. Kwiatkowska, Fairness for Non-interleaving Concurrency, Phd. Thesis, Faculty of Science, University of Leicester, 1989.

    Google Scholar 

  22. L. Lamport, Paradigms for distributed programs: computing global states, In: Distributed systems — Methods and tools for specification, An advanced course, Munich, 1985, Edited by M. Paul and H.J. Siegert, Lecture notes in Computer Science, Springer-Verlag, 190, 454–468.

    Google Scholar 

  23. D. Lehman, A. Pnueli, J. Stavi, Impartiality, Justice and Fairness: The ethics of concurrent termination. Proc. of 8th International colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 115, 264–277.

    Google Scholar 

  24. Z. Manna, A. Pnueli, Verification of concurrent programs: the temporal framework, In: The correctness problem in computer science, Edited by R.S. Boyer and J.S. Moore, 1981, 215–273.

    Google Scholar 

  25. Z. Manna, A. Pnueli, Verification of concurrent programs, a temporal proof system, Proceedings of the 4th School on Advanced Programming, Amsterdam, Holland, June 1982, 162–255.

    Google Scholar 

  26. Z. Manna, A. Pnueli, How to cook a temporal proof system for your pet language. Proceedings of the Symposium on Principles on Programming Languages, Austin, Texas, 1983, 141–151.

    Google Scholar 

  27. Z. Manna, A. Pnueli, Adequate proof principles for invariance and liveness properties of concurrent programs, Science of Computer Programming 4, 1984, 257–289.

    Google Scholar 

  28. Z. Manna, A. Pnueli, The Anchored Version of the Temporal Framework, School/Workshop on Linear Time, Branching Time and Partial order in Logics and Models, The Netherlands, Lecture Notes on Computer Science, 254, 201–281.

    Google Scholar 

  29. Z. Manna, A. Pnueli, Completing the Temporal Picture, Proceedings 16th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 372, 534–558.

    Google Scholar 

  30. Z. Manna, P. Wolper, Synthesis of communicating processes from temporal logic specifications, ACM Transactions on Programming Languages and Systems 6, 1984, 68–93.

    Google Scholar 

  31. A. Mazurkiewicz, Trace semantics, Proceedings of an advanced course, Bad Honnef, September 1986, Lecture Notes in Computer Science, 255.

    Google Scholar 

  32. A. Mazurkiewicz, Complete Processes and Inevitability, Rept. No. 86-06, Univ. of Leiden, The Netherlands, 1986.

    Google Scholar 

  33. M. Nielsen, G. Plotkin, G. Winskel, Petri Nets, Event Structures and Domains, Part I, Theoretical Computer Science 13(1981), 85–108.

    Google Scholar 

  34. S. Owicki, A consistent and complete deductive system for the verification of parallel programs, Proceedings of the 8th Annual Symposium, on Theory of Computing, 1976, 73–86.

    Google Scholar 

  35. D. Peled, A. Pnueli, Proving Partial Order Liveness Properties, Technical Report, Weizmann Institute of Science, 1990.

    Google Scholar 

  36. C. A. Petri, Kommunikation mit Automaten, Bonn: Institut für Instrumentelle Matematik, Schriften des IIM Nr. 2(1962).

    Google Scholar 

  37. S. Pinter, P. Wolper, A temporal logic for reasoning about partially ordered computations, Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., August 1984, 23–27.

    Google Scholar 

  38. A. Pnueli, R. Rosner, On the Synthesis of an Asynchronous Reactive Module, 16th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 372, 652–671.

    Google Scholar 

  39. V. Pratt, Modeling Concurrency with Partial orders, International Journal of Parallel Programming, 15 (1986), 33–71.

    Google Scholar 

  40. W. Reisig, Temporal Logic and Causality in Concurrent Systems, Proceedings of CONCURRENCY 88, Hamburg, Lecture Notes in Computer Science, 1988, 121–139.

    Google Scholar 

  41. J. R. Shoenfield, Mathematical Logic, Addison-Wesley 1976.

    Google Scholar 

  42. P. S. Thiagarajan, Elementary Net Systems, Lecture Notes in Computer Science 254, 26–59.

    Google Scholar 

  43. G. Winskel, Event Structures, Proceedings of an advanced course, Bad Honnef, September 1986, Lecture Noted in Computer Science, 255.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Technion, 32000, Haifa, Israel

    Doron Peled

  2. Department of Applied Mathematics, The Weizmann Institute of Science, 76100, Rehovot, Israel

    Amir Pnueli

Authors
  1. Doron Peled
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amir Pnueli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peled, D., Pnueli, A. (1990). Proving partial order liveness properties. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032058

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52826-5

  • Online ISBN: 978-3-540-47159-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation