Temporal and Modal Logic

[1]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[2]  Moshe Y. Vardi.  Verification of Concurrent Programs: The Automata-Theoretic Framework , 1991, Ann. Pure Appl. Log..

[3]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[5]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[6]  V. Rich.  Personal communication , 1989, Nature.

[7]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[8]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9]  Ron Koymans.  Specifying Message Passing Systems Requires Extending Temporal Logic , 1987, Temporal Logic in Specification.

[10]  Z. Manna,et al.  A hierarchy of temporal properties , 1987, PODC '87.

[11]  Edmund M. Clarke,et al.  Avoiding the state explosion problem in temporal logic model checking , 1987, PODC '87.

[12]  Wolfgang Thomas,et al.  Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree , 1987, ICALP.

[13]  Orna Grumberg,et al.  Research on Automatic Verification of Finite-State Concurrent Systems , 1987 .

[14]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[15]  Joseph Y. Halpern.  USING REASONING ABOUT KNOWLEDGE TO ANALYZE DISTRIBUTED SYSTEMS , 1987 .

[16]  Pierre Wolper,et al.  On the Relation of Programs and Computations to Models of Temporal Logic , 1987, Temporal Logic in Specification.

[17]  Pierre Wolper,et al.  The Complementation Problem for Büchi Automata with Appplications to Temporal Logic , 1987, Theor. Comput. Sci..

[18]  A. Prasad Sistla,et al.  Reasoning with Many Processes , 1987, LICS.

[19]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[20]  Edmund M. Clarke,et al.  Automatic Verification of Sequential Circuits Using Temporal Logic , 1986, IEEE Transactions on Computers.

[21]  Joseph Y. Halpern,et al.  The complexity of reasoning about knowledge and time , 1986, STOC '86.

[22]  Pierre Wolper,et al.  Reasoning about fair concurrent programs , 1986, STOC '86.

[23]  Edmund M. Clarke,et al.  Reasoning about networks with many identical finite-state processes , 1986, PODC '86.

[24]  Edmund M. Clarke,et al.  Automatic verification of asynchronous circuits using temporal logic , 1986 .

[25]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[26]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[27]  A. P. Sistla,et al.  Automatic verification of finite-state concurrent systems using temporal logic specifications , 1986, TOPL.

[28]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[29]  Yoram Moses,et al.  Knowledge and common knowledge in a Byzantine environment I: crash failures , 1986 .

[30]  Richard E. Ladner,et al.  The Logic of Distributed Protocols , 1986, TARK.

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

[32]  Amir Pnueli,et al.  A really abstract concurrent model and its temporal logic , 1986, POPL '86.

[33]  Pierre Wolper,et al.  Expressing interesting properties of programs in propositional temporal logic , 1986, POPL '86.

[34]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[35]  Krzysztof R. Apt,et al.  Logics and Models of Concurrent Systems , 1989, NATO ASI Series.

[36]  Larry J. Stockmeyer,et al.  Improved upper and lower bounds for modal logics of programs , 1985, STOC '85.

[37]  A. Prasad Sistla,et al.  On characterization of safety and liveness properties in temporal logic , 1985, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[38]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[39]  A. P. Sistla,et al.  The complexity of propositional linear temporal logics , 1985, JACM.

[40]  Moshe Y. Vardi.  The Taming of Converse: Reasoning about Two-way Computations , 1985, Logic of Programs.

[41]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[42]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[43]  Edmund M. Clarke,et al.  Hierarchical Verification of Asynchronous Circuits Using Temporal Logic , 1985, Theor. Comput. Sci..

[44]  Pierre Wolper,et al.  The tableau method for temporal logic: an overview , 1985 .

[45]  A. Prasad Sistla,et al.  Can Message Buffers Be Axiomatized in Linear Temporal Logic? , 1984, Inf. Control..

[46]  A. Prasad Sistla,et al.  Deciding Full Branching Time Logic , 1985, Inf. Control..

[47]  Amir Pnueli,et al.  Now you may compose temporal logic specifications , 1984, STOC '84.

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

[49]  Micha Sharir,et al.  Probabilistic temporal logics for finite and bounded models , 1984, STOC '84.

[50]  Daniel Lehmann,et al.  Knowledge, common knowledge and related puzzles (Extended Summary) , 1984, PODC '84.

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

[52]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[53]  E. Allen Emerson,et al.  The Propositional Mu-Calculus is Elementary , 1984, ICALP.

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

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

[56]  Amir Pnueli,et al.  On the extremely fair treatment of probabilistic algorithms , 1983, STOC.

[57]  P. M. Melliar-Smith,et al.  An interval logic for higher-level temporal reasoning , 1983, PODC '83.

[58]  Edmund M. Clarke,et al.  Automatic Verification of Asynchronous Circuits , 1983, Logic of Programs.

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

[60]  Leslie Lamport,et al.  What Good is Temporal Logic? , 1983, IFIP Congress.

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

[62]  P. M. Melliar-Smith,et al.  From State Machines to Temporal Logic: Specification Methods for Protocol Standards , 1982, The Analysis of Concurrent Systems.

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

[64]  Benjamin Charles Moszkowski.  Reasoning about Digital Circuits , 1983 .

[65]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

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

[67]  Mordechai Ben-Ari,et al.  Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness , 1982, J. Comput. Syst. Sci..

[68]  Robert S. Streett,et al.  Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable , 1982, Inf. Control..

[69]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[70]  Saharon Shelah,et al.  Reasoning with Time and Chance , 1982, Inf. Control..

[71]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[72]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[73]  Robert S. Boyer,et al.  The Correctness Problem in Computer Science , 1982 .

[74]  Brent Hailpern.  Verifying Concurrent Processes Using Temporal Logic , 1982, Lecture Notes in Computer Science.

[75]  Pierre Wolper,et al.  Temporal logic can be more expressive , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[76]  Vaughan R. Pratt,et al.  A decidable mu-calculus: Preliminary report , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

[78]  Gary L. Peterson,et al.  Myths About the Mutual Exclusion Problem , 1981, Inf. Process. Lett..

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

[80]  Robert S. Streett.  Propositional Dynamic Logic of looping and converse , 1981, STOC '81.

[81]  Zohar Manna,et al.  Verification of Concurrent Programs: Temporal Proof Principles , 1981, Logic of Programs.

[82]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[83]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[84]  A. Pnueli.  The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[85]  Krithivasan Ramamritham.  Specification and synthesis of synchronizers , 1981 .

[86]  Rohit Parikh,et al.  An Elementary Proof of the Completness of PDL , 1981, Theor. Comput. Sci..

[87]  Zohar Manna,et al.  Logics of Programs , 1981, Lecture Notes in Computer Science.

[88]  Edmund M. Clarke,et al.  Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.

[89]  Brent Hailpern,et al.  Verifying network protocols using temporal logic , 1980 .

[90]  Leslie Lamport,et al.  "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.

[91]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[92]  Karl R. Abrahamson.  Decidability and expressiveness of logics of processes , 1980 .

[93]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[94]  Wolfgang Thomas,et al.  Star-Free Regular Sets of omega-Sequences , 1979, Inf. Control..

[95]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[96]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[97]  Rohit Parikh.  A decidability result for a second order process logic , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[98]  M. S. Laventhal.  SYNTHESIS OF SYNCHRONIZATION CODE FOR DATA ABSTRACTIONS , 1978 .

[99]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

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

[101]  Zohar Manna,et al.  Is “sometime” sometimes better than “always”?: Intermittent assertions in proving program correctness , 1976, ICSE '76.

[102]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[103]  Willem P. de Roever,et al.  Recursive program schemes: semantics and proof theory , 1976, Mathematical Centre Tracts.

[104]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[105]  I. Sinha.  Characteristic ideals in group algebras , 1974 .

[106]  Rod M. Burstall,et al.  Program Proving as Hand Simulation with a Little Induction , 1974, IFIP Congress.

[107]  Albert R. Meyer,et al.  WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .

[108]  Charles Rackoff,et al.  The Emptiness Problem for Automata on Infinite Trees , 1972, SWAT.

[109]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[110]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[111]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[112]  David E. Muller,et al.  Infinite sequences and finite machines , 1963, SWCT.

[113]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .