Corpus ID: 218869991

RHLE: Relational Reasoning for Existential Program Verification.

  title={RHLE: Relational Reasoning for Existential Program Verification.},
  author={R. Dickerson and Q. Ye and B. Delaware},
  journal={arXiv: Programming Languages},
  • R. Dickerson, Q. Ye, B. Delaware
  • Published 2020
  • Computer Science
  • arXiv: Programming Languages
  • Reasoning about nondeterministic programs requires a specification of how their nondeterministic choices are allowed to be resolved. When reasoning about safety properties, it is sound to overapproximate the permitted behaviors. Once its safety is established, a program remains safe for every valid implementation of its nondeterministic choices. Overapproximate specifications are less useful when establishing that a nondeterministic program exhibits some desirable behavior, however, as… CONTINUE READING


    Publications referenced by this paper.
    A Model for Delimited Information Release
    • 215
    • PDF
    A relational logic for higher-order programs
    • 23
    • PDF
    An axiomatic basis for computer programming
    • 1,903
    Certification of programs for secure information flow
    • 1,109
    • PDF
    Incorrectness logic
    • 6
    • PDF
    On Correct Refinement of Programs
    • R. Back
    • Mathematics, Computer Science
    • 1981
    • 143