Duality in specification languages: A lattice-theoretical approach
From MaRDI portal
Publication:913495
DOI10.1007/BF00259469zbMath0699.68038OpenAlexW2025812198MaRDI QIDQ913495
Publication date: 1990
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00259469
Logical aspects of lattices and related structures (03G10) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) General topics in the theory of software (68N01) Theory of software (68N99)
Related Items
Angelic nondeterminism in the unifying theories of programming ⋮ DUALITY: A simple formalism for the analysis of UNITY ⋮ Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism ⋮ Refinement concepts formalised in higher order logic ⋮ Games and winning strategies ⋮ Processes and formalisms for unbounded choice ⋮ Combining angels, demons and miracles in program specifications ⋮ Alternating states for dual nondeterminism in imperative programming ⋮ Dual unbounded nondeterminacy, recursion, and fixpoints ⋮ Program inversion in the refinement calculus ⋮ Algebra of Monotonic Boolean Transformers ⋮ Contracts, games, and refinement. ⋮ Nondeterminacy and recursion via stacks and games ⋮ The lattice of data refinement
