2 citations · 2 across the 2 of their papers we have counts for
3 papers
From CCS to CSP: the m-among-n Synchronisation Approach
Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield
We present an alternative translation from CCS to an extension of CSP based on m-among-n synchronisation (called CSPmn). This translation is correct up to strong bisimulation. Unli…
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…
Locally Nameless Permutation Types
Edsko de Vries, Vasileios Koutavas
We define "Locally Nameless Permutation Types", which fuse permutation types as used in Nominal Isabelle with the locally nameless representation. We show that this combination is…