Refinement and state machine abstraction

DOI10.1016/S0304-3975(00)00169-9MaRDI QIDQ5958757zbMATH OpenOpenAlexFDO

Authors Karl Lermer, Paul Strooper

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00169-9

zbMATH Keywords

abstractionformal methodsmodular software developmentrefinementspecificationstate machine

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Supporting module reuse in refinement
• scientific article; zbMATH DE number 1086636
• Algebraic Methodology and Software Technology
• scientific article; zbMATH DE number 1759495
• scientific article; zbMATH DE number 1303994

Cites work

• A single complete rule for data refinement
• A state-based approach to communicating processes
• scientific article; zbMATH DE number 3902016 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 46957 (Why is no real title available?)
• scientific article; zbMATH DE number 605917 (Why is no real title available?)
• On correct refinement of programs
• Prespecification in data refinement
• Process simulation and refinement
• Proof of correctness of data representations
• The existence of refinement mappings

Cited in

(3)

• Refinement Patterns for Hierarchical UML State Machines
• Refinements in Typed Abstract State Machines
• Algebraic Methodology and Software Technology

Describes a project that uses

Uses Software

• Z

This page was built for publication: Refinement and state machine abstraction

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