Mappings of languages by two-tape devices
Journal of the ACM (JACM)
The synthesis of loop predicates
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
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
The competence/performance dichotomy in programming preliminary report
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Discipline of Programming
Computability and completeness in logics of programs (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On the theory of programming logics
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Propositional modal logic of programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Checking relational specifications with binary decision diagrams
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
Propositional logics of programs: systems, models, and complexity
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
Process logic: preliminary report
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A theory of data dependencies over relational expressions
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Logics for probabilistic programming (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Logical verification and equational verification
ACM SIGACT News
25 Years of Model Checking
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
25 Years of Model Checking
A Tableaux System for Deontic Action Logic
DEON '08 Proceedings of the 9th international conference on Deontic Logic in Computer Science
Formal Methods in System Design
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Decidable reasoning in terminological knowledge representation systems
Journal of Artificial Intelligence Research
Reasoning about Web Services with Local Closed World Assumption
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
A formal language for electronic contracts
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Parallel first-order dynamic logic and its expressiveness and axiomatization
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Pillars of computer science
A description logic based situation calculus
Annals of Mathematics and Artificial Intelligence
Modal logic over higher dimensional automata
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Generalized satisfiability for the description logic ALC
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A Family of Dynamic Description Logics for Representing and Reasoning About Actions
Journal of Automated Reasoning
An appreciation of dexter kozen
Logic and Program Semantics
On the complexity of reasoning about dynamic policies
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Generalized satisfiability for the description logic ALC
Theoretical Computer Science
| Hi-index | 0.00 |
We give a new characterization of the set of satisfiable formulae of propositional dynamic logic (PDL) based on the method of tableaux. From it we derive a heuristically efficient goal-directed proof procedure and a complete axiom system for PDL. The proof procedure illustrates a striking connection between natural deduction and symbolic execution. The completeness proof for the axiom system incorporates a method for the automatic synthesis of invariants. We also augment DL with new modalities throughout, during, and preserves, supply a new semantic foundation for DL programs, and show how to extend the satisfiability characterizations for PDL to throughout.