Propositional modal logic of programs

Authors:
Michael J. Fischer;Richard E. Ladner
Affiliations:
-;-
Venue:
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Year:
1977

Citing 4
Cited 29

Guarded commands, nondeterminacy and formal derivation of programs

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Theory of Program Structures: Schemes, Semantics, Verification

Theory of Program Structures: Schemes, Semantics, Verification
Effectivity Problems of Algorithmic Logic

Proceedings of the 2nd Colloquium on Automata, Languages and Programming

Nondeterminism in logics of programs

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Propositional logics of programs: systems, models, and complexity

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program logic without binding is decidable

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 practical decision method for propositional dynamic logic (Preliminary Report)

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A completeness technique for d-axiomatizable semantics

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Tree-size bounded alternation(Extended Abstract)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Dynamic algebras and the nature of induction

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Mathematical modal logic: a view of its evolution

Journal of Applied Logic
Complexity and succinctness of public announcement logic

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
From Church and Prior to PSL

25 Years of Model Checking
Run-Time Monitoring of Electronic Contracts

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
From Philosophical to Industrial Logics

ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
$\mathcal{CL}$: An Action-Based Logic for Reasoning about Contracts

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Decidability of the Guarded Fragment with the Transitive Closure

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the Specification of Full Contracts

Electronic Notes in Theoretical Computer Science (ENTCS)
A proof-checker for dynamic logic

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
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
Model checking contracts: a case study

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Logic-based knowledge representation

Artificial intelligence today
From monadic logic to PSL

Pillars of computer science
Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Reasoning About Games

Studia Logica
PDL with intersection and converse is decidable

CSL'05 Proceedings of the 19th international conference on Computer Science Logic
An axiomatization of arrays for kleene algebra with tests

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
A Family of Dynamic Description Logics for Representing and Reasoning About Actions

Journal of Automated Reasoning
Coinductive Axiomatization of Recursive Type Equality and Subtyping

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a fundamental propositional logical system for describing correctness, termination and equivalence of programs. We define a formal syntax and semantics for the propositional modal logic of programs and give several consequences of the definition. Principal conclusions are that deciding satisfiability requires time dn/log nfor some d 1 and that satisfiability, even in an extended system, can be decided in nondeterministic time cnfor some c. We provide applications of the decision procedure to regular expressions, Ianov schemes, and classical systems of modal logic.