1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.PL2021
From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques
Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos
We present a bounded equivalence verification technique for higher-order programs with local state. This technique combines fully abstract symbolic environmental bisimulations simi…
cs.PL2020★ 1 cited
Symbolic Execution Game Semantics
Yu-Yang Lin, Nikos Tzevelekos
We present a framework for symbolically executing and model checking higher-order programs with external (open) methods. We focus on the client-library paradigm and in particular w…
cs.PL2018
Higher-Order Bounded Model Checking
Yu-Yang Lin, Nikos Tzevelekos
We present a Bounded Model Checking technique for higher-order programs. The vehicle of our study is a higher-order calculus with general references. Our technique is a symbolic st…