Hume box calculus: Robust system development through software transformation
From MaRDI portal
Publication:656858
DOI10.1007/s10990-011-9067-yzbMath1234.68054OpenAlexW2057774885MaRDI QIDQ656858
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
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The existence of refinement mappings
- General parameterised refinement and recursion for the M-net calculus
- A brief history of process algebra
- CSP theorems for communicating B machines
- A survey of strategies in rule-based program transformation systems
- 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
- A Transformation System for Developing Recursive Programs
- Algorithm + strategy = parallelism
This page was built for publication: Hume box calculus: Robust system development through software transformation