Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
We propose a new representation to describe mobile agents computations, where the underlying control structures are diffusing computations. Usually, distributed coms are abstracte...
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
Abstract. We define an out-degree for F-coalgebras and show that the coalgebras of outdegree at most form a covariety. As a subcategory of all Fcoalgebras, this class has a termin...