Proving Partial Order Liveness Properties

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.

[1]  Willem P. de Roever,et al.  A Proof Rule for Fair Termination of Guarded Commands , 1985, Inf. Control..

[2]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[3]  Maciej Koutny,et al.  Concurrent and Maximally Concurrent Evolution of Nonsequential Systems , 1986, Theor. Comput. Sci..

[4]  Edsger Wybe Dijkstra,et al.  Cooperating Sequential Processes, Technical Report EWD-123 , 1965 .

[5]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[6]  Pierre Wolper,et al.  A temporal logic for reasoning about partially ordered computations (Extended Abstract) , 1984, PODC '84.

[7]  Zohar Manna,et al.  Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs , 1984, Sci. Comput. Program..

[8]  E. Allen Emerson,et al.  Alternative Semantics for Temporal Logics , 1981, Theor. Comput. Sci..

[9]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[10]  P. S. Thiagarajan.  Elementary Net Systems , 1986 .

[11]  Zohar Manna,et al.  The anchored version of the temporal framework , 1988, REX Workshop.

[12]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[13]  C. Petri.  Kommunikation mit Automaten , 1962 .

[14]  Leslie Lamport,et al.  Paradigms for Distributed Programs , 1984, Advanced Course: Distributed Systems.

[15]  Nissim Francez,et al.  Decomposition of Distributed Programs into Communication-Closed Layers , 1982, Sci. Comput. Program..

[16]  E. A Emerson,et al.  Alternative Semantics for Temporal Logics , 1981, Theor. Comput. Sci..

[17]  Marta Kwiatkowska,et al.  Fairness for non-interleaving concurrency , 1989 .

[18]  Nissim Francez,et al.  Generalized fair termination , 1984, POPL '84.

[19]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[20]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[21]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[22]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[23]  Zohar Manna,et al.  Completing the Temporal Picture , 1991, Theor. Comput. Sci..

[24]  Doron A. Peled,et al.  An efficient verification method for parallel and distributed programs , 1988, REX Workshop.

[25]  Doron A. Peled,et al.  Defining Conditional Independence Using Collapses , 1992, Theor. Comput. Sci..

[26]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

[27]  Amir Pnueli,et al.  Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[28]  Zohar Manna,et al.  Verification of concurrent programs, Part I: The temporal framework , 1981 .

[29]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, Logic of Programs.

[30]  Susan S. Owicki,et al.  A consistent and complete deductive system for the verification of parallel programs , 1976, STOC '76.

[31]  Amir Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[32]  Doron A. Peled,et al.  Interleaving set temporal logic , 1987, PODC '87.

[33]  Haim Gaifman,et al.  Partial Order Models of Concurrency and the Computation of Functions , 1987, LICS.

[34]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[35]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[36]  Lutz Priese,et al.  Fairness , 1988, Bull. EATCS.

[37]  Z. Manna,et al.  Verification of concurrent programs: a temporal proof system , 1983 .

[38]  Wolfgang Reisig,et al.  Temporal Logic and Causality in Concurrent Systems , 1988, Concurrency.