Data refinement by calculation

DOI10.1007/BF00277386zbMath0699.68029OpenAlexW4255418790MaRDI QIDQ913482

Carroll Morgan, Paul H. B. Gardiner

Publication date: 1990

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00277386

zbMATH Keywords

specificationsdata typeData refinement

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) General topics in the theory of software (68N01)

Related Items (20)

Angelic nondeterminism in the unifying theories of programming ⋮ Safety and progress of recursive procedures ⋮ Auxiliary variables in data refinement ⋮ Some proofs of data refinement ⋮ Command algebras, recursion and program transformation ⋮ Predicate transformers and higher-order programs ⋮ Algebraic proofs of consistency and completeness ⋮ A single complete rule for data refinement ⋮ Angelic processes for CSP via the UTP ⋮ Constraint-aware Schema Transformation ⋮ A tactic language for refinement of state-rich concurrent specifications ⋮ Alternating states for dual nondeterminism in imperative programming ⋮ Calculating modules in contextual logic program refinement ⋮ Trace-based derivation of a scalable lock-free stack algorithm ⋮ Strongly Typed Rewriting For Coupled Software Transformation ⋮ Nondeterminacy and recursion via stacks and games ⋮ Soundness of data refinement for a higher-order imperative language ⋮ Model-based specification ⋮ Program refinement in fair transition systems ⋮ The lattice of data refinement

This page was built for publication: Data refinement by calculation