An axiomatic basis for computer programming
Communications of the ACM
Nondeterminism in logics of programs
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Discipline of Programming
Propositional modal logic of programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A practical decision method for propositional dynamic logic (Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
A propositional modal logic of time intervals
Journal of the ACM (JACM)
What can machines know?: On the properties of knowledge in distributed systems
Journal of the ACM (JACM)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
"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
A dynamic logic of multiprocessing with incomplete information
POPL '80 Proceedings of the 7th 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
Is the interesting part of process logic uninteresting?: a translation from PL to PDL
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A Complete Axiomatization of Interval Temporal Logic with Infinite Time
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
The finite and the infinite in temporal logic
ACM SIGACT News
A Temporal Dynamic Logic for Verifying Hybrid System Invariants
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Run-Time Monitoring of Electronic Contracts
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
Dynamic semantics for tense and aspect
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
B and D are enough to make the Halpern-Shoham logic undecidable
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Reasoning about protocol change and knowledge
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
Axiomatizations Of Interval Logics
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 |
We discuss problems arising in reasoning about on-going processes, using the modal constructs after, throughout, during, and preserves. Earlier work established decidability of the theory whose language included only the first two of these, along with program connectives | , ; and *. Here we give a complete Gentzen-type axiomatizations for useful combinations of the other modalities. We also indicate how such Gentzen-type axiomatizations lead to deterministic exponential time upper bounds on the complexity of decision procedures for these languages. It remains an open problem how to completely axiomatize the combination of modalities during and preserves.