An Analysis of Total Correctness Refinement Models for Partial Relation Semantics II

DOI10.1093/JIGPAL/11.3.319MaRDI QIDQ4454299zbMATH OpenOpenAlexFDO

Authors Moshe Deutsch, Martin C. Henson

Publication date 8 March 2004

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c0b2b900be1bbcc2368d2e25a08d4f4cefb80c47

zbMATH Keywords

data refinementoperation refinementrelation semantics

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2052653
• Relational concurrent refinement. III: Traces, partial relations and automata
• A relation algebraic model of robust correctness
• Partial correctness: The term-wise approach
• Relational semantics of linear logic and higher-order model checking
• On the consistency, expressiveness, and precision of partial modeling formalisms
• scientific article; zbMATH DE number 4022609
• Relational semantics revisited
• More relational concurrent refinement: traces and partial relations

Cited in

(5)

• scientific article; zbMATH DE number 2013581 (Why is no real title available?)
• scientific article; zbMATH DE number 2052653 (Why is no real title available?)
• An analysis of refinement in an abortive paradigm
• scientific article; zbMATH DE number 1670751 (Why is no real title available?)
• An analysis of operation-refinement in an abortive paradigm

This page was built for publication: An Analysis of Total Correctness Refinement Models for Partial Relation Semantics II

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