Some Properties of Predicate Transformers
From MaRDI portal
Publication:4158461
DOI10.1145/322077.322088zbMATH Open0379.68016OpenAlexW2117436651WikidataQ127705819 ScholiaQ127705819MaRDI QIDQ4158461FDOQ4158461
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
Cited In (21)
- Mitigating covert channels based on analysis of the potential for communication
- Two normal form theorems for CSP programs
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
- Unifying theories of reactive design contracts
- Domain theory for concurrency
- Programs as partial graphs. I: Flow equivalence and correctness
- Parallelized sequential composition and hardware weak memory models
- Predicate transformers as power operations
- On the total correctness of nondeterministic programs
- A unified approach for studying the properties of transition systems
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- Semantics of non-deterministic possibility computation
- A note on specifying and verifying concurrent processes
- General correctness: A unification of partial and total correctness
- Semantics of algorithmic languages
- Category theoretic models of data refinement
- Correctness of concurrent processes
- Command algebras, recursion and program transformation
- Interpretations of recursion under unbounded nondeterminacy
- 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)
