A general completeness result in refinement

DOI10.1007/978-3-540-44616-3_12MaRDI QIDQ2722025zbMATH OpenFDO

Authors Yoshiki Kinoshita, John Power

Publication date 11 July 2001

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

Full work available at URL https://doi.org/10.1007/978-3-540-44616-3_12

Mathematics Subject Classification ID

Enriched categories (over closed or monoidal categories) (18D20) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Data refinement and algebraic structure
• Incompleteness of relational simulations in the blocking paradigm
• Algebraic proofs of consistency and completeness
• Process simulation and refinement
• A calculus of refinements for program derivations

Cited in

(10)

• Data refinement and algebraic structure
• Lawvere theories enriched over a general base
• A single complete relational rule for coalgebraic refinement
• Refinement by Interpretation in a General Setting
• Introducing backward refinement into B
• Category theoretic models of data refinement
• Axiomatics for data refinement in call by value programming languages
• Completeness of ASM refinement
• Incompleteness of relational simulations in the blocking paradigm
• Algebraic proofs of consistency and completeness

This page was built for publication: A general completeness result in refinement

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