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