Interleaving set temporal logic
暂无分享,去创建一个
[1] Joseph Y. Halpern,et al. Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.
[2] Leslie Lamport. What it means for a concurrent program to satisfy a specification: why no one has specified priority , 1985, POPL '85.
[3] Edmund M. Clarke,et al. Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.
[4] Ugo Montanari,et al. Partial ordering derivations for CCS , 1985, FCT.
[5] Leslie Lamport,et al. Distributed Systems: Methods and Tools for Specification, An Advanced Course, April 3-12, 1984 and April 16-25, 1985, Munich, Germany , 1985, Advanced Course: Distributed Systems.
[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] Pierre Wolper,et al. Reasoning about fair concurrent programs , 1986, STOC '86.
[10] Wolfgang Reisig,et al. Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness , 1984, ICALP.
[11] Maurice Herlihy,et al. Axioms for concurrent objects , 1987, POPL '87.
[12] R. K. Shyamasundar,et al. An Implementation of P and V , 1981, Inf. Process. Lett..
[13] Leslie Lamport,et al. What Good is Temporal Logic? , 1983, IFIP Congress.
[14] Shmuel Katz,et al. Appraising fairness in distributed languages , 1987, POPL '87.
[15] Mordechai Ben-Ari,et al. The temporal logic of branching time , 1981, POPL '81.
[16] Saharon Shelah,et al. Reasoning with Time and Chance , 1982, Inf. Control..
[17] Chin-Laung Lei,et al. Modalities for model checking (extended abstract): branching time strikes back , 1985, POPL.
[18] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[19] E. Emerson,et al. Modalities for model checking (extended abstract): branching time strikes back , 1985, ACM-SIGACT Symposium on Principles of Programming Languages.
[20] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[21] Nissim Francez,et al. Decomposition of Distributed Programs into Communication-Closed Layers , 1982, Sci. Comput. Program..
[22] Amir Pnueli,et al. Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.
[23] Zohar Manna,et al. Verification of concurrent programs, Part I: The temporal framework , 1981 .
[24] E. A Emerson,et al. Model Checking Under Generalized Fairness Constraints , 1984 .
[25] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[26] Gordon Plotkin,et al. An Operational Semantics for CSP. , 1982 .
[27] Willem P. de Roever,et al. A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..
[28] Robert S. Boyer,et al. The Correctness Problem in Computer Science , 1982 .
[29] FrancezNissim,et al. A Proof System for Communicating Sequential Processes , 1980 .
[30] Zohar Manna,et al. How to cook a temporal proof system for your pet language , 1983, POPL '83.
[31] Karl R. Abrahamson. Decidability and expressiveness of logics of processes , 1980 .
[32] Ilaria Castellani,et al. On the Semantics of Concurrency: Partial Orders and Transition Systems , 1987, TAPSOFT, Vol.1.
[33] Joseph Y. Halpern,et al. “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.
[34] Leslie Lamport,et al. Distributed snapshots: determining global states of distributed systems , 1985, TOCS.