The temporal logic of branching time
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Data flow analysis of communicating processes
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Propositional Dynamic Logic of Flowcharts
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
A Decision Procedure for the Propositional µ-Calculus
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
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
The complexity of reasoning about knowledge and time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An internal semantics for modal logic
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Efficient temporal reasoning (extended abstract)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A branching time logic with past operators
Journal of Computer and System Sciences
Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Reasoning in expressive description logics
Handbook of automated reasoning
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Model Checking Knowledge and Linear Time: PSPACE Cases
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
An Incremental Technique for Automata-Based Decision Procedures
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Automata-Based Axiom Pinpointing
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Matching Trace Patterns with Regular Policies
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Weak Alternating Timed Automata
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A uniform framework for concept definitions in description logics
Journal of Artificial Intelligence Research
Model theoretic complexity of automatic structures
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Automata-Based Axiom Pinpointing
Journal of Automated Reasoning
Enriching EL-Concepts with Greatest Fixpoints
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Synthesizing solutions to the leader election problem using model checking and genetic programming
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Finding finite herbrand models
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
We present a new technique for obtaining decision procedures for modal logics of programs. The technique centers around a new class of finite automata on infinite trees for which the emptiness problem can be solved in polynomial time. The decision procedures then consist of constructing an automaton Af for a given formula f, such that Af accepts some tree if and only if f is satisfiable. We illustrate our technique by giving an exponential decision procedure for deterministic propositional dynamic logic and a variant of the &mgr-calculus of Kozen.