Refinement Ordering
Refinement Ordering is a binary relation on program specifications that belongs to the class of correctness-preserving transformations, differentiating itself by formalizing the hierarchical improvement of abstract programs into more concrete implementations through monotonic reduction of nondeterminism.
18
Publications
1.1K
Citations
33
Authors
22
Institutions
Publications per year
2017–2026
1
Parents
18
1–5 of 18
33
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 33
22
University of Klagenfurt
Klagenfurt, Austria
2 h-index
2 publications
183 citations
University of Sheffield
Sheffield, United Kingdom
2 h-index
2 publications
35 citations
University of Oxford
Oxford, United Kingdom
2 h-index
2 publications
59 citations
Technical University of Munich
Munich, Germany
1 h-index
1 publications
61 citations
West Virginia University
Morgantown, United States
1 h-index
1 publications
144 citations
Technische Universität Dresden
Dresden, Germany
1 h-index
2 publications
34 citations

University of Waikato
Hamilton, New Zealand
1 h-index
3 publications
126 citations

University of York
York, United Kingdom
1 h-index
1 publications
10 citations
1–8 of 22
4 publications · 81 citations
4
h-index
2 publications · 64 citations
2
h-index
Repository · 1 publications · 27 citations
1
h-index
JETAI · 1 publications · 29 citations
1
h-index
SoSyM · 1 publications · 17 citations
1
h-index
1–5