Floyd-Hoare Logic Defines Semantics
The first-order patrial correctness assertions provable in Floyd-Hoare logic about an uninterpreted while-program scheme determine the scheme up to equivalence. This settles an open problem of Meyer and Halpern. The simple proof of this fact carries over to other partial correctness axiomatizations...
Main Author: | Meyer, Albert R. |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149117 |
Similar Items
-
Semantical Considerations on Floyd-Hoare Logic
by: Pratt, Vaughan R.
Published: (2023) -
Floyd-Hoare Verifiers "Considered Harmful"
by: Shrobe, Howard E.
Published: (2004) -
Hoare's Logic Is Not Complete When It Could Be
by: Bergstra, J., et al.
Published: (2023) -
Definability in Dynamic Logic
by: Meyer, Albert R., et al.
Published: (2023) -
Using Crash Hoare logic for certifying the FSCQ file system
by: Chen, Haogang, et al.
Published: (2021)