Axiomatising the logic of computer programming
canonical model constructionscorrectness of programsinfinitary inference rule for reasoning about iteration programslogics of programsmodal logicproof theory for programming language semanticssemantical completenesswhile programs
Modal logic (including the logic of norms) (03B45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
- Strong completeness and limited canonicity for PDL
- Erratum to: ``Strong completeness and limited canonicity for PDL
- Infinitary propositional normal modal logic
- Determinism and non-determinism in PDL
- Axiomatizing fixpoint logics
- Getting started: Beginnings in the logic of action
- Action incompleteness
- Modal logic with names
- A model existence theorem in infinitary propositional modal logic
- A dynamic logic of action
- Local properties in modal logic
- Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?
- Logic of transition systems
- A logical framework for evolving software systems
- Announcement as effort on topological spaces
- Quantifier-free epistemic term-modal logic with assignment operator
- Logics with group announcements and distributed knowledge: completeness and expressive power
- Coalition and relativised group announcement logic
- Logics for actor networks: a two-stage constrained-hybridisation approach
- A hybridization of irreflexive modal logics
- Coalition and group announcement logic
- The countable Henkin principle
- `Knowable' as `known after an announcement'
- PDL with intersection of programs: a complete axiomatization
- Complete Axiomatization of a Relative Modal Logic with Composition and Intersection
- Temporal Logics with Reference Pointers and Computation Tree Logics
- Hyperboolean Algebras and Hyperboolean Modal Logic
- Propositional quantification in logics of contingency
- A case study in the mechanical verification of fault tolerance
- Announcement as effort on topological spaces
- Dynamic extensions of arrow logic
- To be announced
- Dynamic modal logic with counting: when reduction axioms work and fail
- Tactical theorem proving in program verification
- Unknown truths and unknowable truths
- A finitary axiomatization of arbitrary social announcement logic
- Arbitrary announcements in social networks: a finitary proof system
- Topic-based communication between agents
- From knowledge to action: logics of permitted and obligatory announcements
- Monadic bounded algebras
- An essay in combinatory dynamic logic
- Notes on logics of metric spaces
- Branching versus linear logics yet again
- Semantical analysis of specification logic
- Group announcement logic
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)
