Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
How to cook a temporal proof system for your pet language
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of branching time
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Propositional Dynamic Logic of looping and converse
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Automata theoretic techniques for modal logics of programs: (Extended abstract)
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Interleaving set temporal logic
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Hyperdocuments as automata: trace-based browsing property verification
ECHT '92 Proceedings of the ACM conference on Hypertext
A branching time logic with past operators
Journal of Computer and System Sciences
Hyperdocuments as automata: verification of trace-based browsing properties by model checking
ACM Transactions on Information Systems (TOIS)
Proving correctness of compiler optimizations by temporal logic
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Some Considerations on Branching Areas of Time
Journal of Logic, Language and Information
Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
The finite graph problem for two-way alternating automata
Theoretical Computer Science - Foundations of software science and computation structures
Compiler Optimization Correctness by Temporal Logic
Higher-Order and Symbolic Computation
Deciding Global Partial-Order Properties
Formal Methods in System Design
Journal of Computer and System Sciences
Adding Partial Orders to Linear Temporal Logic
Fundamenta Informaticae
AXIOMATIZATIONS OF TEMPORAL LOGICS ON TRACE SYSTEMS
Fundamenta Informaticae
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Current Temporal Logics are all oriented towards the description of totally ordered sequences. This limits their usefulness for reasoning about systems whose computations cannot easily be mapped into totally ordered sequences. Here, we propose a temporal logic geared towards describing partially ordered sets and apply it to dynamic distributed systems. Even though the logic we define does not have the finite model property, we establish that it has a one exponential decision procedure and a complete axiomatization.