|
1310
|
A disciplne of programming
– E W Dijkstra
- 1976
|
|
1219
|
An axiomatic basis for computer programming
– C. A. R. Hoare
- 1969
|
|
647
|
The B Book - Assigning Programs to Meanings
– J R Abrial
- 1996
|
|
54
|
Retrenchment: An Engineering Variation on Refinement
– R. Banach , M. Poppleton
|
|
237
|
Refinement Calculus, A Systematic Introduction
– R J R Back, J von Wright
- 1998
|
|
19
|
Retrenchment, Refinement and Simulation
– R. Banach, M. Poppleton
|
|
11
|
Retrenchment: Extending the Reach of Refinement
– M. R. Poppleton , R. H. Banach
|
|
126
|
Data Refinement: Model-Oriented Proof Methods and their Comparison
– W-P de Roever, K Engelhardt
- 1998
|
|
18
|
Sharp Retrenchment, Modulated Refinement and Simulation
– R. Banach , M. Poppleton
|
|
19
|
Maximally Abstract Retrenchments
– C. Jeske, R. Banach
- 2000
|
|
10
|
Retrenchment: Extending Refinement for Continuous and Control Systems
– M.R. Poppleton, R.H. Banach
- 2000
|
|
7
|
Formal Methods for Continuous Systems: Liberalising Refinement in B
– M R Poppleton
- 2001
|
|
18
|
Prespecification in data refinement
– C A R Hoare, J He, J W Sanders
- 1987
|
|
148
|
A theoretical basis for stepwise refinement and the programming calculus
– J M Morris
|
|
31
|
A single complete rule for data refinement
– Paul H B Gardiner, Carroll Morgan
- 1993
|
|
28
|
Partial Logics Reconsidered: A Conservative Approach
– Olaf Owe
- 1997
|
|
16
|
Retrenchment and Punctured Simulation
– R. Banach , M. Poppleton
|
|
12
|
The clean termination of iterative programs
– A Blikle
- 1981
|
|
13
|
The clean termination of pascal programs
– D Coleman, J W Hughes
- 1979
|
