From Hoare Logic to Matching Logic Reachability
From MaRDI portal
Publication:4647855
DOI10.1007/978-3-642-32759-9_32zbMath1372.68066OpenAlexW2098780033MaRDI QIDQ4647855
Andrei Ştefănescu, Grigore Roşu
Publication date: 8 November 2012
Published in: FM 2012: Formal Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32759-9_32
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (9)
Verifying Reachability-Logic Properties on Rewriting-Logic Specifications ⋮ From Rewriting Logic, to Programming Language Semantics, to Program Verification ⋮ The rewriting logic semantics project: a progress report ⋮ Program equivalence by circular reasoning ⋮ A generic framework for symbolic execution: a coinductive approach ⋮ A language-independent proof system for full program equivalence ⋮ Symbolic execution based on language transformation ⋮ All-Path Reachability Logic ⋮ Programming and symbolic computation in Maude
Uses Software
This page was built for publication: From Hoare Logic to Matching Logic Reachability
