Sciweavers

4 search results - page 1 / 1
» Normal Bisimulations in Calculi with Passivation
Sort
View
FOSSACS
2009
Springer
13 years 11 months ago
Normal Bisimulations in Calculi with Passivation
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterization...
Sergueï Lenglet, Alan Schmitt, Jean-Bernard S...
LICS
2008
IEEE
13 years 11 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 5 months ago
Sound Bisimulations for Higher-Order Distributed Process Calculus
Abstract. While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we develop a bis...
Adrien Piérard, Eijiro Sumii
CSL
2007
Springer
13 years 11 months ago
Typed Normal Form Bisimulation
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Søren B. Lassen, Paul Blain Levy