Axiomatising the logic of computer programming
modal logiclogics of programscorrectness of programswhile programssemantical completenesscanonical model constructionsinfinitary inference rule for reasoning about iteration programsproof theory for programming language semantics
Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
- Dynamic modal logic with counting: when reduction axioms work and fail
- Unknown truths and unknowable truths
- Complete Axiomatization of a Relative Modal Logic with Composition and Intersection
- Logic of transition systems
- Notes on logics of metric spaces
- Propositional quantification in logics of contingency
- Local properties in modal logic
- Tactical theorem proving in program verification
- Semantical analysis of specification logic
- Infinitary propositional normal modal logic
- Getting started: Beginnings in the logic of action
- Hyperboolean Algebras and Hyperboolean Modal Logic
- To be announced
- Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?
- Dynamic extensions of arrow logic
- Strong completeness and limited canonicity for PDL
- Coalition and group announcement logic
- Announcement as effort on topological spaces
- A logical framework for evolving software systems
- Erratum to: ``Strong completeness and limited canonicity for PDL
- Coalition and relativised group announcement logic
- Logics with group announcements and distributed knowledge: completeness and expressive power
- Group announcement logic
- Announcement as effort on topological spaces
- A model existence theorem in infinitary propositional modal logic
- A hybridization of irreflexive modal logics
- An essay in combinatory dynamic logic
- Determinism and non-determinism in PDL
- Axiomatizing fixpoint logics
- A dynamic logic of action
- Branching versus linear logics yet again
- `Knowable' as `known after an announcement'
- The countable Henkin principle
- Quantifier-free epistemic term-modal logic with assignment operator
- A case study in the mechanical verification of fault tolerance
- Action incompleteness
- Modal logic with names
- Temporal Logics with Reference Pointers and Computation Tree Logics
- Logics for actor networks: a two-stage constrained-hybridisation approach
- PDL with intersection of programs: a complete axiomatization
- Monadic bounded algebras
This page was built for publication: Axiomatising the logic of computer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158956)
