First-order dynamic logic
AxiomatizationsCorrectnessEquivalence and Determinacy of ProgramsFirst-Order Dynamic LogicFlowchartReasonning About ProgramsRecursive ProgramsSemantics
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) 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) Algorithms in computer science (68W99)
- Differential dynamic logic for hybrid systems
- On infinite computations in denotational semantics
- Ten years of Hoare's logic: A survey. II: Nondeterminism
- DAL -- a logic for data analysis
- Propositional dynamic logic with local assignments
- PDL with data constants
- Non-standard algorithmic and dynamic logic
- Formal theories of knowledge in AI and robotics
- An algebraic study of well-foundedness
- A simple dynamic logic
- First-order approximation of algorithmic theories
- Arithmetical axiomatization of first-order temporal logic
- Infinitary propositional normal modal logic
- Some relationships between logics of programs and complexity theory
- Some general incompleteness results for partial correctness logics
- An automata theoretic decision procedure for the propositional mu- calculus
- The \(\mu\)-calculus as an assertion-language for fairness arguments
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
- On the total correctness of nondeterministic programs
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
- Arithmetical completeness in first-order dynamic logic for concurrent programs
- Proving total correctness of nondeterministic programs in infinitary logic
- A formal system for parallel programs in discrete time and space
- Definability in dynamic logic
- Floyd's principle, correctness theories and program equivalence
- A complete logic for reasoning about programs via nonstandard model theory. I
- On termination problems for finitely interpreted ALGOL-like programs
- On logic of complex algorithms
- Process logic: Expressiveness, decidability, completeness
- Domain theory in logical form
- Completing the temporal picture
- Determinism and non-determinism in PDL
- On models for propositional dynamic logic
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\)
- Axiomatizing fixpoint logics
- Semantics and reasoning with free procedures
- A compositional axiomatization of statecharts
- Multimodal logic programming using equational and order-sorted logic
- Semantic models for total correctness and fairness
- Modelling knowledge and action in distributed systems
- Proving partial order properties
- Logical and schematic characterization of complexity classes
- Stratified least fixpoint logic
- A model existence theorem in infinitary propositional modal logic
- An overview of transaction logic
- Static and dynamic aspects of goal-oriented concurrency control
- An infinite pebble game and applications
- Reuse of proofs in software verification
- Mathematical modal logic: A view of its evolution
- Hoare's logic for nondeterministic regular programs: A nonstandard approach
- Semantical analysis of constructive PDL
- Predicate transformers as power operations
- Free choice and contextually permitted actions
- Towards reasoning about Hoare relations
- An axiomatic approach to existence and liveness for differential equations
- On strictly arithmetical completeness in logics of programs
- A structured temporal logic language: XYZ/SE
- Generalized hyperarithmetical computability over structures
- Precise quantitative information flow analysis -- a symbolic approach
- Tableaux for constructive concurrent dynamic logic
- Recursive programs and denotational semantics in absolute logics of programs
- Intention is choice with commitment
- On algebra of program correctness and incorrectness
- A formalization of programs in first-order logic with a discrete linear order
- Combining Model Checking and Deduction
- Some applications of topology to program semantics
- Categories for dynamic epistemic logic
- On the Completeness of Dynamic Logic
- Frame problem in dynamic logic
- In Scott-Strachey style denotational semantics, parallelism implies nondeterminism
- Positive program logics in systems with arithmetic
- Étude et implémentation d'un système de déduction pour logique algorithmique
- scientific article; zbMATH DE number 3688675 (Why is no real title available?)
- scientific article; zbMATH DE number 3741356 (Why is no real title available?)
- Semantics of looping programs in Propositional Dynamic Logic
- scientific article; zbMATH DE number 140379 (Why is no real title available?)
- An Algorithmic Logic Approach to Formalizing Database Update Semantics
- Complete Axiomatization of a Relative Modal Logic with Composition and Intersection
- Dynamic logic with program specifications and its relational proof system
- Proving correctness of labeled transition systems by semantic tableaux
- scientific article; zbMATH DE number 3797730 (Why is no real title available?)
- Reasoning in Dynamic Logic about Program Termination
- Monadic dynamic algebras
- Modal logics for communicating systems
- Predicative specifications for functional programs describing communicating networks
- Automata on infinite objects and their applications to logic and programming
- Semantic models for total correctness and fairness
- Regular database update logics
- Iterative and recursive matrix theories
- Adding partial orders to linear temporal logic
- Stateful Behavioral Types for Active Objects
- Adversarial logic
- Review of Logical Analysis of Hybrid Systems
- Temporal stream logic modulo theories
- A dynamic logic with branching modalities
- A verified VCGen based on dynamic logic: an exercise in meta-verification with Why3
- Tactical theorem proving in program verification
- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs
- Toward automatic verification of quantum programs
- On the logic of UNITY
This page was built for publication: First-order dynamic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255942)