scientific article; zbMATH DE number 3707731
From MaRDI portal
Publication:3899466
Cited in
(90)- On infinite computations in denotational semantics
- Programs as proofs: A synopsis
- An algebraic approach to the syntax and semantics of languages with subscripted variables
- Hoare's logic for programming languages with two data types
- Ten years of Hoare's logic: A survey. II: Nondeterminism
- Specification-oriented semantics for communicating processes
- Merging regular processes by means of fixed-point theory
- Infinite streams and finite observations in the semantics of uniform concurrency
- Applications of compactness in the Smyth powerdomain of streams
- Interpretations of recursion under unbounded nondeterminacy
- Hiding in stream semantics of uniform concurrency
- The \(\mu\)-calculus as an assertion-language for fairness arguments
- On correct refinement of programs
- Floyd's principle, correctness theories and program equivalence
- A dual problem to least fixed points
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
- Fixed point theorems and semantics: A folk tale
- Hoare's logic and Peano's arithmetic
- A continuous semantics for unbounded nondeterminism
- Domain theory in logical form
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
- Correctness and efficiency of pattern matching algorithms
- The contraction principle as a particular case of Kleene's fixed point theorem
- A compositional axiomatization of statecharts
- Combining angels, demons and miracles in program specifications
- Rendez-vous with metric semantics
- Combinatory reduction systems: Introduction and survey
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Proving partial order properties
- Process algebra with guards: Combining hoare logic with process algebra
- Correctness of fixpoint transformations
- Reasoning about dynamically evolving process structures
- The weakest precondition calculus: Recursion and duality
- Linear time and branching time semantics for recursion with merge
- Relation-algebraic semantics
- The inheritance of dynamic and deontic integrity constraints or: Does the boss have more rights?
- Full abstraction and recursion
- Parallel constructions of maximal path sets and applications to short superstrings
- Full abstraction for the second order subset of an Algol-like language
- The generic approximation lemma
- Hoare's logic and VDM
- Completeness of Hoare-calculi revisited
- On the notion of expressiveness and the rule of adaptation
- De Bakker-Zucker processes revisited
- A specification structure for deadlock-freedom of synchronous processes
- Fifty years of Hoare's logic
- Linear dependent types in a call-by-value scenario
- Recursive programs and denotational semantics in absolute logics of programs
- Relational semantics revisited
- Specifying termination in CSP
- Worker/Wrapper Transformation
- Verification of object-oriented programs: a transformational approach
- A note on Coinduction and Weak Bisimilarity for While Programs
- Completeness of ASM refinement
- ASM refinement and generalizations of forward simulation in data refinement: a comparison
- An axiomatic treatment of SIMD assignment
- A Hoare logic for dynamic networks of asynchronously communicating deterministic processes
- Specification structures and propositions-as-types for concurrency
- Modal and temporal logics for processes
- Operations on fixpoint equation systems
- Formal semantics for mutual belief
- Alignment complete relational Hoare logics for some and all
- A contextual formalization of structural coinduction
- Tony Hoare: his path to the ACM Turing Award
- Logical Relations for PCF
- A fixed point approach to parallel discrete event simulation
- Wythoff games, continued fractions, cedar trees and Fibonacci searches
- A weakest precondition semantics for communicating processes
- Proving program inclusion using Hoare's logic
- Correctness of programs with Pascal-like procedures without global variables
- Two theorems about the completeness of Hoare's logic
- Average case optimality for linear problems
- Expressiveness and the completeness of Hoare's logic
- The axiomatic semantics of programs based on Hoare's logic
- Equivalences among logics of programs
- Results on the propositional \(\mu\)-calculus
- Weakly expressive models for Hoare logic
- Closure functions and general iterates as reflectors
- Semantics of plan revision in intelligent agents
- Extending separation logic with fixpoints and postponed substitution
- Command algebras, recursion and program transformation
- Proving total correctness of recursive procedures
- Semantical analysis of specification logic
- On the completeness of modular proof systems
- A first order logic for partial functions
- Proof obligations for blocks and procedures
- A mechanical analysis of program verification strategies
- Alternating states for dual nondeterminism in imperative programming
- The axiomatization of override and update
- Dual unbounded nondeterminacy, recursion, and fixpoints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3899466)
