Unifying correctness statements

DOI10.1007/978-3-642-31113-0_11MaRDI QIDQ2908567zbMATH OpenOpenAlexWikidataFDO

Authors Walter Guttmann

Publication date 5 September 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-31113-0_11

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• General correctness algebra
• Algebras for iteration and infinite computations
• Unifying Recursion in Partial, Total and General Correctness
• Partial, total and general correctness
• General correctness: A unification of partial and total correctness

Cited in

(10)

• Infinite executions of lazy and strict computations
• Unifying lazy and strict computations
• Conscriptions: a new relational model for sequential computations
• Partial, total and general correctness
• Unifying theories of programming that distinguish nontermination and abort
• Reasoning about loops in total and general correctness
• General correctness algebra
• Correctness of unification without occur check in prolog
• Algebras for iteration and infinite computations
• Algebras for Iteration, Infinite Executions and Correctness of Sequential Computations

Describes a project that uses

Uses Software

• Isabelle

This page was built for publication: Unifying correctness statements

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