scientific article
From MaRDI portal
Publication:3917476
zbMath0465.68002MaRDI QIDQ3917476
Krzysztof R. Apt, Gordon D. Plotkin
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
operational semanticscompletenessdenotational semanticssoundnessparallel programweakest precondition semanticssmall programming languageHoare-like proof system for total correctness
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Related Items (16)
Structured algebraic specifications: A kernel language ⋮ Continuous semilattices ⋮ A theory for nondeterminism, parallelism, communication, and concurrency ⋮ The origins of structural operational semantics ⋮ Merging regular processes by means of fixed-point theory ⋮ While-programs with nondeterministic assignments and the logic ALNA ⋮ The weakest precondition calculus: Recursion and duality ⋮ Interpretations of recursion under unbounded nondeterminacy ⋮ A representable approach to finite nondeterminism ⋮ Fixed point theorems and semantics: A folk tale ⋮ A continuous semantics for unbounded nondeterminism ⋮ Logical foundations for programming semantics ⋮ Unnamed Item ⋮ On infinite computations in denotational semantics ⋮ Fair termination revisited - with delay ⋮ On powerdomains and modality
This page was built for publication:
