Adequate proof principles for invariance and liveness properties of concurrent programs
Science of Computer Programming
The logical basis for computer programming. Volume 1: deductive reasoning
The logical basis for computer programming. Volume 1: deductive reasoning
The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Special relations in automated deduction
Journal of the ACM (JACM) - The MIT Press scientific computation series
A decision procedure for combinations of propositional temporal logic and other specialized theories
Journal of Automated Reasoning
Proc. of the 8th international conference on Automated deduction
Temporal-logic theorem proving
Temporal-logic theorem proving
Theoretical Computer Science
Journal of Symbolic Computation
The logical basis for computer programming: vol. 2, deductive systems
The logical basis for computer programming: vol. 2, deductive systems
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Nonmonotonic Logic II: Nonmonotonic Modal Theories
Journal of the ACM (JACM)
A Deductive Approach to Program Synthesis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Decision Method for Temporal Logic Based on Resolution
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the Conference on Logic of Programs
A Decision Method for Linear Temporal Logic
Proceedings of the 7th International Conference on Automated Deduction
A method of automatic proof for the specification and verification of protocols
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Verification of concurrent programs: a temporal proof system
Verification of concurrent programs: a temporal proof system
A proof editor for propositional temporal logic
A proof editor for propositional temporal logic
Reasoning about digital circuits
Reasoning about digital circuits
ACM Transactions on Database Systems (TODS)
Temporal analysis of &lgr;&sgr; activity systems
ANSS '92 Proceedings of the 25th annual symposium on Simulation
ACM Transactions on Computational Logic (TOCL)
Temporal resolution using a breadth-first search
Annals of Mathematics and Artificial Intelligence
Proof Planning for Feature Interactions: A Preliminary Report
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Algorithms for Guiding Clausal Temporal Resolution
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
First Order Linear Temporal Logic over Finite Time Structures
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
A resolution method for temporal logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Proof planning for first-order temporal logic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Invariant-Free Clausal Temporal Resolution
Journal of Automated Reasoning
Dynamic logic with trace semantics
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Hi-index | 0.00 |
This paper presents a proof system for first-order temporal logic. The system extends the nonclausal resolution method for ordinary first-order logic with equality, to handle quantifiers and temporal operators. Soundness and completeness issues are considered. The use of the system for verifying concurrent programs is discussed and variants of the system for other modal logics are also described.