A single complete refinement rule for Z

DOI10.1093/LOGCOM/10.5.663zbMATH Open0966.68141OpenAlexW2078077003MaRDI QIDQ4522331FDOQ4522331

John Derrick

Publication date: 19 December 2000

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://kar.kent.ac.uk/16369/1/A_single_complete_refinement_rule_for_Z.pdf

zbMATH Keywords

data refinementZ specification language

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65)

Cited In (8)

• Title not available (Why is that?)
• Guarded Operations, Refinement and Simulation
• Title not available (Why is that?)
• An analysis of refinement in an abortive paradigm
• A Practical Single Refinement Method for B
• Title not available (Why is that?)
• Zhdanov's rules work both ways
• A single complete rule for data refinement

   Recommendations

• A single complete rule for data refinement 👍 👎
• Prespecification in data refinement 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Laws of data refinement 👍 👎

This page was built for publication: A single complete refinement rule for Z

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