5 citations · 17 across the 11 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.PL2018★ 2 cited
All-Path Reachability Logic
Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta +3
This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g., concurrent) languages, referred to as all-path r…
cs.LO2018
A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems
Ştefan Ciobâcă, Dorel Lucanu
We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-s…