Combining angels, demons and miracles in program specifications
type: Item
instance of: scholarly article
title: Combining angels, demons and miracles in program specifications
zbMATH Open document ID: 0754.68078
DOI: 10.1016/0304-3975(92)90309-4
author: S. Singh
published in: Theoretical Computer Science
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 06B35
zbMATH DE Number: 96047
zbMATH Keywords: demonic nondeterminism
zbMATH Keywords: complete lattice of monotonic predicate transformers
zbMATH Keywords: unbounded nondeterminism
zbMATH Keywords: angelic nondeterminism
MaRDI profile type: Publication
full work available at URL: 0304-3975(92)90309-4
OpenAlex ID: W1973316014
cites work: Q3888507
cites work: Q3898009
cites work: On correct refinement of programs
cites work: A calculus of refinements for program derivations
cites work: Duality in specification languages: A lattice-theoretical approach
cites work: A theory for nondeterminism, parallelism, communication, and concurrency
cites work: Q3899466
cites work: Programming as a Discipline of Mathematical Nature
cites work: Laws of programming
cites work: A generalization of Naundorf's fixpoint theorem
cites work: Command algebras, recursion and program transformation
cites work: General correctness: A unification of partial and total correctness
cites work: The specification statement
cites work: Types and invariants in the refinement calculus
cites work: A theoretical basis for stepwise refinement and the programming calculus
cites work: Q3920613
cites work: Q4195918
description: scientific article; zbMATH DE number 96047