## Abstract

This paper introduces(one-path) reach ability logic, a language-independent proof system for program verification, which takes an operational semantics as axioms and derivesreach ability rules, which generalize Hoare triples. This system improves on previous work by allowing operational semantics given withconditional* rewrite rules, which are known to support all major styles of operational semantics. In particular, Kahn's big-step and Plot kin's small-step semantic styles are now supported. The reach ability logic proof system is shown sound (i.e., partially correct) and (relatively) complete. Reach ability logic thus eliminates the need to independently define an axiomatic and an operational semantics for each language, and the non-negligible effort to prove the former sound and complete w.r.t. the latter. The soundness result has also been formalized in Coq, allowing reach ability logic derivations to serve as formal proof certificates that rely only on the operational semantics.

Original language | English (US) |
---|---|

Article number | 6571568 |

Pages (from-to) | 358-367 |

Number of pages | 10 |

Journal | Proceedings - Symposium on Logic in Computer Science |

DOIs | |

State | Published - Sep 9 2013 |

Event | 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013 - New Orleans, LA, United States Duration: Jun 25 2013 → Jun 28 2013 |

## Keywords

- Hoare logic
- axiomatic semantics
- logic
- operational semantics
- program verification

## ASJC Scopus subject areas

- Software
- Mathematics(all)