Unifying Theories of Programming That Distinguish Nontermination and Abort

DOI10.1007/978-3-642-13321-3_12zbMath1286.68079OpenAlexW1835285141MaRDI QIDQ3575272

Ian J. Hayes, Steve Dunne, Larissa A. Meinicke

Publication date: 26 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://research.tees.ac.uk/en/publications/3b43b974-8a4f-406b-a6a4-13fc1a25f77e

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

An algebraic approach to computations with progress ⋮ Conscriptions: A New Relational Model for Sequential Computations ⋮ Unifying Lazy and Strict Computations ⋮ A Unary Semigroup Trace Algebra ⋮ Towards a UTP Semantics for Modelica ⋮ Unifying theories of time with generalised reactive processes ⋮ Algebras for iteration and infinite computations ⋮ Infinite executions of lazy and strict computations

This page was built for publication: Unifying Theories of Programming That Distinguish Nontermination and Abort