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

Authors

33

  1. JD
    John Derrick

    University of Kent, United Kingdom

    2 publications · 35 citations

    2

    h-index

  2. RT
    Roland T. Mittermeir

    University of Klagenfurt, Austria

    2 publications · 183 citations

    2

    h-index

  3. RM
    R. Mili

    The University of Texas at Dallas, United States

    2 publications · 183 citations

    2

    h-index

  4. AM
    A. Mili

    West Virginia University, United States

    2 publications · 183 citations

    2

    h-index

  5. SM
    Stephen Muggleton

    Imperial College London, United Kingdom

    1 publications · 29 citations

    1

    h-index

1–5 of 33

Venues

  1. Formal Aspects of Computing

    4 publications · 81 citations

    4

    h-index

  2. Science of Computer Programming

    2 publications · 64 citations

    2

    h-index

  3. Research Repository (Delft University of Technology)

    Repository · 1 publications · 27 citations

    1

    h-index

  4. 1

    h-index

  5. Software & Systems Modeling

    SoSyM · 1 publications · 17 citations

    1

    h-index

1–5