We propose a framework to study contextual equivalence of programs written in a call-by-
value functional language with local integer references. It reduces the problem of contextual …

We present a full classification of decidable and undecidable cases for contextual
equivalence in a finitary ML-like language equipped with full ground storage (both integers …

We investigate reachability in pushdown automata over infinite alphabets. We show that, in
terms of reachability/emptiness, these machines can be faithfully represented using only 3r …

We introduce a trace semantics for a call-by-value language with full polymorphism and
higher-order references. This is an operational game semantics model based on a nominal …

Register automata are one of the simplest classes of automata that operate on infinite input
alphabets. Each automaton comes equipped with a finite set of registers where it can store …

We present a full classification of decidable and undecidable cases for contextual
equivalence in a finitary ML-like language equipped with full ground storage (both integers …

We present a bounded equivalence verification technique for higher-order programs with
local state. This technique combines fully abstract symbolic environmental bisimulations …

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 …

We propose Pushdown Normal Form (PDNF) Bisimulation to verify contextual equivalence
in higher-order functional programming languages with local state. Similar to previous work …

Register automata are one of the simplest classes of automata that operate on infinite
alphabets. Each automaton comes equipped with a finite set of registers where it can store …