Data refinement by calculation
From MaRDI portal
Recommendations
Cited in
(28)- Refinement and retrenchment for programming language data types
- Calculating modules in contextual logic program refinement
- Model-based specification
- Nondeterminacy and recursion via stacks and games
- Alternating states for dual nondeterminism in imperative programming
- Angelic nondeterminism in the unifying theories of programming
- Soundness of data refinement for a higher-order imperative language
- Trace-based derivation of a scalable lock-free stack algorithm
- Angelic processes for CSP via the UTP
- Constraint-aware schema transformation
- Safety and progress of recursive procedures
- Encoding, decoding and data refinement
- scientific article; zbMATH DE number 1836399 (Why is no real title available?)
- Auxiliary variables in data refinement
- Data refinement of remote procedures
- Program refinement in fair transition systems
- Strongly typed rewriting for coupled software transformation
- A tactic language for refinement of state-rich concurrent specifications
- Automatic Data Refinement
- Command algebras, recursion and program transformation
- Some proofs of data refinement
- The lattice of data refinement
- scientific article; zbMATH DE number 1512616 (Why is no real title available?)
- Prespecification in data refinement
- A single complete rule for data refinement
- Data refinement of invariant based programs
- Algebraic proofs of consistency and completeness
- Predicate transformers and higher-order programs
This page was built for publication: Data refinement by calculation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913482)
