Refinement Calculus

Refinement Calculus is a formal method in program development that provides a calculus of refinement rules for stepwise transforming abstract, possibly non-executable specifications into executable programs via behavior-preserving (correctness-preserving) transformations.

152

Publications

5.7K

Citations

237

Authors

139

Institutions

Publications per year

2017–2026

8

Authors

237

  1. CM
    Carroll Morgan

    Oxford Research Group, United Kingdom

    6 publications · 468 citations

    6

    h-index

  2. AC
    Ana Cavalcanti

    University of York, United Kingdom

    6 publications · 147 citations

    6

    h-index

  3. JW
    Jim Woodcock

    University of York, United Kingdom

    5 publications · 107 citations

    5

    h-index

  4. MB
    Michael Butler

    University of Southampton, United Kingdom

    5 publications · 161 citations

    5

    h-index

  5. IJ
    Ian J. Hayes

    The University of Queensland, Australia

    5 publications · 163 citations

    5

    h-index

1–5 of 237

Venues

  1. Formal Aspects of Computing

    19 publications · 454 citations

    13

    h-index

  2. Theoretical Computer Science

    8 publications · 512 citations

    8

    h-index

  3. Science of Computer Programming

    8 publications · 457 citations

    8

    h-index

  4. Acta Informatica

    6 publications · 365 citations

    6

    h-index

  5. Electronic Notes in Theoretical Computer Science

    ENTCS · 4 publications · 78 citations

    4

    h-index

1–5