Proving Partial Order Properties
暂无分享,去创建一个
[1] Doron A. Peled,et al. Defining Conditional Independence Using Collapses , 1992, Theor. Comput. Sci..
[2] Amir Pnueli,et al. Specifying and proving serializability in temporal logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.
[3] Willem P. de Roever,et al. The upsilon-Calculus as an Assertion-Language for Fairness Arguments , 1989, Inf. Comput..
[4] Amir Pnueli,et al. On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.
[5] Zohar Manna,et al. Completing the Temporal Picture , 1989, Theor. Comput. Sci..
[6] Wojciech Penczek,et al. Concurrent Systems and Inevitability , 1989, Theor. Comput. Sci..
[7] Marta Kwiatkowska,et al. Fairness for non-interleaving concurrency , 1989 .
[8] Wolfgang Reisig,et al. Temporal Logic and Causality in Concurrent Systems , 1988, Concurrency.
[9] Zohar Manna,et al. The anchored version of the temporal framework , 1988, REX Workshop.
[10] Doron A. Peled,et al. Interleaving set temporal logic , 1987, PODC '87.
[11] Luc Bougé,et al. Repeated Snapshots in Distributed Systems with Synchronous Communications and their Implementation in CSP , 1987, Theor. Comput. Sci..
[12] Haim Gaifman,et al. Partial Order Models of Concurrency and the Computation of Functions , 1987, LICS.
[13] P. S. Thiagarajan,et al. Elementary Net Systems , 1986, Advances in Petri Nets.
[14] Maciej Koutny,et al. Concurrent and Maximally Concurrent Evolution of Nonsequential Systems , 1986, Theor. Comput. Sci..
[15] Joseph Y. Halpern,et al. “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.
[16] Willem P. de Roever,et al. A Proof Rule for Fair Termination of Guarded Commands , 1985, Inf. Control..
[17] Leslie Lamport,et al. Distributed snapshots: determining global states of distributed systems , 1985, TOCS.
[18] Zohar Manna,et al. Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs , 1984, Sci. Comput. Program..
[19] Nissim Francez,et al. Generalized fair termination , 1984, POPL '84.
[20] Pierre Wolper,et al. Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, TOPL.
[21] Z. Manna,et al. Verification of concurrent programs: a temporal proof system , 1983 .
[22] Zohar Manna,et al. How to cook a temporal proof system for your pet language , 1983, POPL '83.
[23] Nissim Francez,et al. Decomposition of Distributed Programs into Communication-Closed Layers , 1982, Sci. Comput. Program..
[24] Edmund M. Clarke,et al. Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..
[25] Robert S. Boyer,et al. The Correctness Problem in Computer Science , 1982 .
[26] Amir Pnueli,et al. Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.
[27] Zohar Manna,et al. Verification of concurrent programs, Part I: The temporal framework , 1981 .
[28] Glynn Winskel,et al. Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..
[29] J. W. de Bakker,et al. Mathematical theory of program correctness , 1980, Prentice-Hall international series in computer science.
[30] Glynn Winskel,et al. Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.
[31] David Harel,et al. First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.
[32] Stephen A. Cook,et al. Soundness and Completeness of an Axiom System for Program Verification , 1978, SIAM J. Comput..
[33] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[34] Susan S. Owicki,et al. A consistent and complete deductive system for the verification of parallel programs , 1976, STOC '76.
[35] Edsger W. Dijkstra,et al. Guarded commands, non-determinacy and a calculus for the derivation of programs , 1975, Language Hierarchies and Interfaces.
[36] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[37] Joseph R. Shoenfield,et al. Mathematical logic , 1967 .
[38] C. Petri. Kommunikation mit Automaten , 1962 .