scientific article
From MaRDI portal
Publication:3860820
zbMath0425.68021MaRDI QIDQ3860820
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
powerdomainsdenotational semanticsterminationunbounded nondeterminismnondeterministic assignment statements
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items (5)
Proving total correctness of nondeterministic programs in infinitary logic ⋮ General correctness: A unification of partial and total correctness ⋮ Semantics of algorithmic languages ⋮ On infinite computations in denotational semantics ⋮ Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
This page was built for publication:
