Strongest Postconditions

Strongest Postconditions is the most precise logical condition that describes the set of possible final states guaranteed to hold after the correct execution of a program statement, given an initial precondition, within the framework of Hoare Logic and Refinement Calculus.

20

Publications

902

Citations

40

Authors

26

Institutions

Publications per year

2017–2026

3

Authors

40

  1. MG
    Maurizio Gabbrielli

    University of Bologna, Italy

    2 publications · 78 citations

    2

    h-index

  2. EM
    Elena Marchiori

    Radboud University Nijmegen, Netherlands

    2 publications · 78 citations

    2

    h-index

  3. AC
    Adam Chlipala

    Massachusetts Institute of Technology, United States

    2 publications · 108 citations

    2

    h-index

  4. TA
    Torben Amtoft

    Kansas State University, United States

    2 publications · 156 citations

    2

    h-index

  5. SB
    Sruthi Bandhakavi

    University of Illinois Urbana-Champaign, United States

    2 publications · 156 citations

    2

    h-index

1–5 of 40

Venues

  1. Science of Computer Programming

    2 publications · 32 citations

    2

    h-index

  2. 2

    h-index

  3. ACM SIGPLAN Notices

    2 publications · 46 citations

    2

    h-index

  4. Journal of Computer and System Sciences

    1 publications · 29 citations

    1

    h-index

  5. Automated Software Engineering

    1 publications · 38 citations

    1

    h-index

1–5