One-path reachability logic

Grigore Rosu, Andrei Stefanescu, Stefan Ciobaca, Brandon M. Moore

Research output: Contribution to journalConference articlepeer-review


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 languageEnglish (US)
Article number6571568
Pages (from-to)358-367
Number of pages10
JournalProceedings - Symposium on Logic in Computer Science
StatePublished - Sep 9 2013
Event2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013 - New Orleans, LA, United States
Duration: Jun 25 2013Jun 28 2013


  • Hoare logic
  • axiomatic semantics
  • logic
  • operational semantics
  • program verification

ASJC Scopus subject areas

  • Software
  • Mathematics(all)


Dive into the research topics of 'One-path reachability logic'. Together they form a unique fingerprint.

Cite this