Refinement Proof Rules is a formal system of inference rules within refinement calculus that specifies the conditions under which a program statement can be legally refined into a more detailed, semantically consistent implementation while preserving correctness with respect to a given specification.
30
Publications
1.3K
Citations
61
Authors
31
Institutions
Publications per year
2017–2026
4
Parents
Publications
30
Benjamin Delaware, Clément Pit-Claudel, Jason Gross et al. · 2014 · 87 citations
Proving program refinements and transformations
Martin Ward · 1986 · 82 citations
1–5 of 30
Authors
61
- CM
2
h-index
- IJ
2
h-index
- MB
2
h-index
- PM
2
h-index
- JG
2
h-index
1–5 of 61
Institutions
31
The University of Queensland
Brisbane, Australia
2 h-index
7 publications
218 citations
Menlo School
Atherton, United States
1 h-index
3 publications
987 citations
Fondazione Bruno Kessler
Trento, Italy
1 h-index
2 publications
148 citations
University of Freiburg
Freiburg im Breisgau, Germany
1 h-index
3 publications
81 citations
Data61
Sydney, Australia
1 h-index
1 publications
18 citations
University of Waterloo
Waterloo, Canada
1 h-index
1 publications
60 citations
University of Southampton
Southampton, United Kingdom
1 h-index
1 publications
44 citations
ETH Zurich
Zurich, Switzerland
1 h-index
1 publications
60 citations
1–8 of 31
Venues
- Formal Aspects of Computing
4 publications · 110 citations
4
h-index
- Electronic workshops in computing
2 publications · 64 citations
2
h-index
- IEEE Transactions on Software Engineering
TSE · 2 publications · 403 citations
2
h-index
- ePrints Soton (University of Southampton)
Repository · 2 publications · 84 citations
2
h-index
- Science of Computer Programming
2 publications · 84 citations
2
h-index
1–5