Laws of data refinement
type: Item
instance of: scholarly article
title: Laws of data refinement
zbMATH Open document ID: 0661.68018
author: Joseph M. Morris
published in: Acta Informatica
publication date: 1989-01-01T00:00:00Z
review text: The underlying philosophy of the method is that there is no semantic distinction between specifications and programs. A specification notation has more expressive statements and richer data types that are expensive or even impossible to implement. The programming language is the implementable subset of the specification language. Data refinement is viewed as systematic piecewise replacement of more sophisticated data types with simpler types. A new formal definition of data refinement is given and a set of laws is derived.
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 4080887
zbMATH Keywords: specification language
zbMATH Keywords: data types
zbMATH Keywords: data refinement
MaRDI profile type: Publication
Recommended article: The lattice of data refinement
Recommended article: A single complete rule for data refinement
Recommended article: Some proofs of data refinement
Recommended article: Q4885874
Recommended article: Sound and complete rules for data reification
Recommended article: Refining imprecise data by integrity constraints
Recommended article: Data refinement and algebraic structure
Recommended article: Data Refinement with Probability in Mind
Recommended article: An algebraic formulation for data refinement
description: scientific article; zbMATH DE number 4080887