Normal design algebra

DOI10.1016/J.JLAP.2009.07.002MaRDI QIDQ844885zbMATH OpenOpenAlexWikidataFDO

Authors Walter Guttmann, Bernhard Möller

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)

Recommendations

• Modal Design Algebra
• The Linear Algebra of UTP
• Integrated Formal Methods
• Unifying Recursion in Partial, Total and General Correctness
• A Relational Investigation of UTP Designs and Prescriptions

Cites work

• scientific article; zbMATH DE number 1612485 (Why is no real title available?)
• scientific article; zbMATH DE number 4210141 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 46424 (Why is no real title available?)
• scientific article; zbMATH DE number 194258 (Why is no real title available?)
• scientific article; zbMATH DE number 3564308 (Why is no real title available?)
• scientific article; zbMATH DE number 3574943 (Why is no real title available?)
• scientific article; zbMATH DE number 3630737 (Why is no real title available?)
• scientific article; zbMATH DE number 732978 (Why is no real title available?)
• scientific article; zbMATH DE number 1086628 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• A completeness theorem for Kleene algebras and the algebra of regular events
• A lattice-theoretical fixpoint theorem and its applications
• A relational model of data for large shared data banks
• Algebraic Notions of Termination
• Algebraically complete semirings and Greibach normal form
• Automated Reasoning in Kleene Algebra
• Characterizing determinacy in Kleene algebras
• Fixed-point calculus
• Formal program development. IFIP TC2/WG 2.1 State-of-the-Art report
• Kleene algebra with domain
• Kleene under a modal demonic star
• Lazy Relations
• Mathematics of Program Construction
• Modal Design Algebra
• Omega Algebra, Demonic Refinement Algebra and Commands
• Programming as a Discipline of Mathematical Nature
• Programs, Recursion and Unbounded Choice
• Refinement Algebra with Operators for Enabledness and Termination
• Relational Methods in Computer Science
• Relational Methods in Computer Science
• Relational Methods in Computer Science
• Relational algebraic semantics of deterministic and nondeterministic programs
• The Linear Algebra of UTP
• Theory of program structures: Schemes, semantics, verification
• Towards a refinement algebra
• Unifying theories for logic programming

Cited in

(11)

• The Linear Algebra of UTP
• Modal Design Algebra
• Automated reasoning for probabilistic sequential programs with theorem proving
• Unifying theories of reactive design contracts
• An algebraic approach to computations with progress
• Algebras for iteration and infinite computations
• Infinite executions of lazy and strict computations
• A probabilistic theory of designs based on distributions
• UTP, \textsf{\textit{Circus}}, and Isabelle
• Isabelle/UTP: a mechanised theory engineering framework
• Automated verification of reactive and concurrent programs by calculation

This page was built for publication: Normal design algebra

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