scientific article; zbMATH DE number 3630737

MaRDI QIDQ4192046zbMATH OpenFDO

Authors Manfred Broy, R. Gnatz, Martin Wirsing

Publication date 1979

zbMATH Keywords

Recursive FunctionsNondeterminacyProgram DevelopmentAlgorithmic LanguageCorrectness of Program Transformation RulesFixpoints of FunctionalsGuarded ExpressionsNoncontinuous ConstructsNondeterministic ChoiceSet ComprehensionWide Spectrum Language

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Theory of software (68N99) Abstract data types; algebraic specification (68Q65) Determinacy principles (03E60)

Cited in

(18)

• Lazy Relations
• Domain and range for angelic and demonic compositions
• Alternating states for dual nondeterminism in imperative programming
• Relational algebraic semantics of deterministic and nondeterministic programs
• A continuous semantics for unbounded nondeterminism
• Relation-algebraic semantics
• A theory for nondeterminism, parallelism, communication, and concurrency
• Generated models and the -rule: the nondeterministic case
• Algebras for iteration and infinite computations
• Logical relations and nondeterminism
• Imperative abstractions for functional actions
• Normal design algebra
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• Axioms for signatures with domain and demonic composition
• Semantics of algorithmic languages
• Parallel constructions of maximal path sets and applications to short superstrings
• On correct refinement of programs
• A homage to Martin Wirsing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4192046)