Hume box calculus: Robust system development through software transformation
From MaRDI portal
Publication:656858
DOI10.1007/S10990-011-9067-YzbMATH Open1234.68054OpenAlexW2057774885MaRDI QIDQ656858FDOQ656858
Authors: Gudmund Grov, Greg Michaelson
Publication date: 13 January 2012
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10990-011-9067-y
Recommendations
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Title not available (Why is that?)
- The existence of refinement mappings
- CSP theorems for communicating B machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of strategies in rule-based program transformation systems
- A Transformation System for Developing Recursive Programs
- Title not available (Why is that?)
- A brief history of process algebra
- Algorithm + strategy = parallelism
- General parameterised refinement and recursion for the M-net calculus
- Discovering applications of higher order functions through proof planning
- TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK*
- NESTED ALGORITHMIC SKELETONS FROM HIGHER ORDER FUNCTIONS
Uses Software
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)