Hume box calculus: Robust system development through software transformation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 46740 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 977284 (Why is no real title available?)
- scientific article; zbMATH DE number 1929900 (Why is no real title available?)
- A Transformation System for Developing Recursive Programs
- A brief history of process algebra
- A survey of strategies in rule-based program transformation systems
- Algorithm + strategy = parallelism
- CSP theorems for communicating B machines
- Discovering applications of higher order functions through proof planning
- General parameterised refinement and recursion for the M-net calculus
- NESTED ALGORITHMIC SKELETONS FROM HIGHER ORDER FUNCTIONS
- TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK*
- The existence of refinement mappings
This page was built for publication: Hume box calculus: Robust system development through software transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656858)