Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Executing temporal logic programs
Executing temporal logic programs
Temporal logic of programs
Principles of concurrent and distributed programming
Principles of concurrent and distributed programming
An axiomatization of Lamport's temporal logic of actions
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Symbolic Model Checking
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Projection in Temporal Logic Programming
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
ACL2 Theorems About Commercial Microprocessors
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
A Combination of Clausal and Non Clausal Temporal Logic Programs
IJCAI '93 Proceedings of the Workshop on Executable Modal and Temporal Logics
Constructions: A Higher Order Proof System for Mechanizing Mathematics
EUROCAL '85 Invited Lectures from the European Conference on Computer Algebra-Volume I - Volume I
Temporal Logic with Fixed Points
Temporal Logic in Specification
Some Very Compositional Temporal Properties
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Gentzen-Systems for Propositional Temporal Logics
CSL '88 Proceedings of the 2nd Workshop on Computer Science Logic
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
A Deductive Proof System for CTL
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A Complete Proof Systems for QPTL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Compositional reasoning about projected and infinite time
ICECCS '95 Proceedings of the 1st International Conference on Engineering of Complex Computer Systems
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
A framed temporal logic programming language
Journal of Computer Science and Technology
Framed temporal logic programming
Science of Computer Programming
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Complexity of propositional projection temporal logic with star†
Mathematical Structures in Computer Science
Model checking propositional projection temporal logic based on SPIN
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Semantics of framed temporal logic programs
ICLP'05 Proceedings of the 21st international conference on Logic Programming
| Hi-index | 5.23 |
The paper presents a proof system for Propositional Projection Temporal Logic (PPTL) with projection-plus. The syntax, semantics, and logical laws of PPTL are introduced together with an axiom system consisting of axioms and inference rules. To facilitate proofs, some of the frequently used theorems are proved. A normal form of PPTL formulas is presented, and the soundness and completeness of the proof system are demonstrated. To show how the axiom system works, a full omega regular property for the mutual exclusion problem is specified by a PPTL formula and then a deductive proof of the property is performed.