Programs, Recursion and Unbounded Choice

DOI10.1017/CBO9780511569784zbMath0759.68057OpenAlexW1582275525MaRDI QIDQ4023579

Wim H. Hesselink

Publication date: 23 January 1993

Full work available at URL: https://doi.org/10.1017/cbo9780511569784

zbMATH Keywords

semanticsweakest preconditionsequential programspredicate transformationformal specification and verification methodsunbounded choice

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (15)

Proof rules for recursive procedures ⋮ Normal design algebra ⋮ Safety and progress of recursive procedures ⋮ Lazy Relations ⋮ Multirelations with infinite computations ⋮ Repetitions, known or unknown? ⋮ Completeness of ASM Refinement ⋮ Simulation refinement for concurrency verification ⋮ Completeness of fair ASM refinement ⋮ UNITY and Büchi automata ⋮ Partial correctness for probabilistic demonic programs ⋮ Fixpoint semantics and simulation ⋮ Set-Theoretic Models of Computations ⋮ Nondeterminacy and recursion via stacks and games ⋮ Constructive design of a hierarchy of semantics of a transition system by abstract interpretation

This page was built for publication: Programs, Recursion and Unbounded Choice