Refinement Algebra

Refinement Algebra is a formal algebraic system that belongs to the class of mathematical frameworks used in program development, distinguished by its axiomatic treatment of program refinement through operations such as sequencing, choice, and refinement order, enabling the stepwise derivation of correct programs from specifications.

20

Publications

571

Citations

28

Authors

18

Institutions

Publications per year

2017–2026

1

Authors

28

  1. JW
    Joakim Wright

    Åbo Akademi University, Finland

    3 publications · 114 citations

    3

    h-index

  2. HD
    Hans Dobbertin

    Federal Office for Information Security, Germany

    2 publications · 47 citations

    2

    h-index

  3. LS
    Lu­ís Soares Barbosa

    University of Minho, Portugal

    2 publications · 74 citations

    2

    h-index

  4. TD
    Tim D. Hudson

    Texas A&M University, United States

    1 publications · 14 citations

    1

    h-index

  5. ZS
    Zhong Shao

    Yale University, United States

    1 publications · 17 citations

    1

    h-index

1–5 of 28

Venues

  1. Formal Aspects of Computing

    3 publications · 92 citations

    3

    h-index

  2. Theoretical Computer Science

    2 publications · 74 citations

    2

    h-index

  3. Science of Computer Programming

    2 publications · 94 citations

    2

    h-index

  4. Transactions of the American Mathematical Society

    TRAN · 1 publications · 21 citations

    1

    h-index

  5. Proceedings of the American Mathematical Society

    PROC · 1 publications · 37 citations

    1

    h-index

1–5