What every computer scientist should know about floating-point arithmetic
ACM Computing Surveys (CSUR)
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Digital control systems
Modern control engineering (3rd ed.)
Modern control engineering (3rd ed.)
Lightweight formal methods for computer algebra systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
Modern Control Systems
Digital Control of Dynamic Systems
Digital Control of Dynamic Systems
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Linear Control System Analysis and Design: Conventional and Modern
Linear Control System Analysis and Design: Conventional and Modern
A Skeptic’s Approach to Combining HOL and Maple
Journal of Automated Reasoning
Integrating Computer Algebra and Reasoning through the Type System of Aldor
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
More Powerful Z Data Refinement: Pushing the State of the Art in Industrial Refinement
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
Retrenchment, Refinement, and Simulation
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
Retrenchment: An Engineering Variation on Refinement
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Retrenchment and Punctured Simulation
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Retrenchment: Extending the Reach of Refinement
ASE '99 Proceedings of the 14th IEEE international conference on Automated software engineering
Maximally Abstract Retrenchments
ICFEM '00 Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods
From z to c: illustration of a rigorous development method (specification hierarchy)
From z to c: illustration of a rigorous development method (specification hierarchy)
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
Retrenchment: extending refinement for continuous and control systems
IW-FM'00 Proceedings of the 4th Irish conference on Formal Methods
Engineering and theoretical underpinnings of retrenchment
Science of Computer Programming
Retrenching the purse: finite sequence numbers, and the tower pattern
FM'05 Proceedings of the 2005 international conference on Formal Methods
Retrenchment and the b-toolkit
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
| Hi-index | 0.00 |
We review retrenchment as a liberalisation of refinement, for the description of applications too rich (e.g. using continuous and infinite types) for refinement. A specialisation of the notion, evolving retrenchment, is introduced, motivated by the need for an approximate, evolving notion of simulation. The focus of the paper is the case study, a substantial second-order linear control system. The design step from continuous to zero-order hold discrete system is expressible as an evolving retrenchment. Thus we demonstrate that the retrenchment approach can formalise the development of useful applications, which are outside the scope of refinement.The work is presented in a data type-enriched language containing the B language of J.-R. Abrial.