Normal design algebra

DOI10.1016/j.jlap.2009.07.002zbMath1184.68179OpenAlexW2031460417WikidataQ114851551 ScholiaQ114851551MaRDI QIDQ844885

Bernhard Möller, Walter Guttmann

Publication date: 5 February 2010

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/files/38979/38979.pdf

zbMATH Keywords

semanticssemiringKleene algebralinear recursionfixpointomega algebraunifying theories of programming

Mathematics Subject Classification ID

Logic programming (68N17) Theory of software (68N99)

Related Items (7)

An algebraic approach to computations with progress ⋮ Automated reasoning for probabilistic sequential programs with theorem proving ⋮ Unifying theories of reactive design contracts ⋮ Algebras for iteration and infinite computations ⋮ Automated verification of reactive and concurrent programs by calculation ⋮ Isabelle/UTP: A Mechanised Theory Engineering Framework ⋮ Infinite executions of lazy and strict computations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed-point calculus
• Kleene under a modal demonic star
• Relational algebraic semantics of deterministic and nondeterministic programs
• Theory of program structures: Schemes, semantics, verification
• Formal program development. IFIP TC2/WG 2.1 State-of-the-Art report
• A completeness theorem for Kleene algebras and the algebra of regular events
• Characterizing determinacy in Kleene algebras
• Algebraically complete semirings and Greibach normal form
• Towards a refinement algebra
• A lattice-theoretical fixpoint theorem and its applications
• Algebraic Notions of Termination
• Lazy Relations
• Automated Reasoning in Kleene Algebra
• The Linear Algebra of UTP
• Refinement Algebra with Operators for Enabledness and Termination
• Programs, Recursion and Unbounded Choice
• Programming as a Discipline of Mathematical Nature
• Kleene algebra with domain
• Modal Design Algebra
• Mathematics of Program Construction
• Omega Algebra, Demonic Refinement Algebra and Commands
• A relational model of data for large shared data banks
• Relational Methods in Computer Science
• Relational Methods in Computer Science
• Relational Methods in Computer Science

This page was built for publication: Normal design algebra