Some Properties of Predicate Transformers

DOI10.1145/322077.322088MaRDI QIDQ4158461zbMATH OpenOpenAlexWikidataFDO

Authors Tony Hoare

Publication date 1978

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322077.322088

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(21)

• Programs as partial graphs. I: Flow equivalence and correctness
• A unified approach for studying the properties of transition systems
• Parallelized sequential composition and hardware weak memory models
• Semantics of algorithmic languages
• General correctness: A unification of partial and total correctness
• Command algebras, recursion and program transformation
• On the total correctness of nondeterministic programs
• Category theoretic models of data refinement
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• Predicate transformers as power operations
• Correctness of concurrent processes
• Interpretations of recursion under unbounded nondeterminacy
• Two normal form theorems for CSP programs
• A note on specifying and verifying concurrent processes
• Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
• On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
• Mitigating covert channels based on analysis of the potential for communication
• Unifying theories of reactive design contracts
• Semantics of non-deterministic possibility computation
• Domain theory for concurrency
• Expressing program looping in regular dynamic logic

This page was built for publication: Some Properties of Predicate Transformers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158461)