We show how to use Howe’s method to prove that context bisimilarity is a congruence for process calculi equipped with their usual semantics. We apply the method to two extensions of HOπ, with passivation and with join patterns, illustrating different proof techniques.Nous montrons comment utiliser la méthode de Howe pour prouver que la bissimilarité contextuelle d’un calcul de processus muni de sa sémantique habituelle est une congruence. Nous appliquons cette méthode à deux extensions de HOπ, l’une avec passivation, l’autre avec des motifs à jointure, pour mettre en évidence des techniques de preuve différentes
Nous développons diverses méthodes permettant d'automatiser des preuves de bisimulation up-to ...
We apply powerful proof-techniques of concurrency theory to study the observational theory of Thiele...
International audienceWe propose a categorical framework for structural operational semantics, in wh...
We show how to use Howe’s method to prove that context bisimilarity is a congruence for process calc...
International audienceWe show how to use Howe's method to prove that context bisimilarity is a congr...
We show how to use Howe\u27s method to prove that context bisimilarity is a congruence for process c...
AbstractWe study the problem of characterizing contextual equivalence in higher-order languages with...
International audienceWe show how to apply Howe's method for the proof of congruence of early bisimi...
This report shows how to apply Howe's method for the proof of congruence of early bisimilarities in ...
In the last few years the problem of deriving labelled transitions and bisimulation congruences from...
International audienceWe study the problem of characterizing contextual equivalence in higher-order ...
We apply powerful proof-techniques of concurrency theory to study the ob-servational theory of Thiel...
In process calculi, concurrent and interacting systems are modelled by processes that run in paralle...
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging ...
Abstractχ-Calculus was proposed as a process calculus that has a uniform treatment of names. Prelimi...
Nous développons diverses méthodes permettant d'automatiser des preuves de bisimulation up-to ...
We apply powerful proof-techniques of concurrency theory to study the observational theory of Thiele...
International audienceWe propose a categorical framework for structural operational semantics, in wh...
We show how to use Howe’s method to prove that context bisimilarity is a congruence for process calc...
International audienceWe show how to use Howe's method to prove that context bisimilarity is a congr...
We show how to use Howe\u27s method to prove that context bisimilarity is a congruence for process c...
AbstractWe study the problem of characterizing contextual equivalence in higher-order languages with...
International audienceWe show how to apply Howe's method for the proof of congruence of early bisimi...
This report shows how to apply Howe's method for the proof of congruence of early bisimilarities in ...
In the last few years the problem of deriving labelled transitions and bisimulation congruences from...
International audienceWe study the problem of characterizing contextual equivalence in higher-order ...
We apply powerful proof-techniques of concurrency theory to study the ob-servational theory of Thiel...
In process calculi, concurrent and interacting systems are modelled by processes that run in paralle...
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging ...
Abstractχ-Calculus was proposed as a process calculus that has a uniform treatment of names. Prelimi...
Nous développons diverses méthodes permettant d'automatiser des preuves de bisimulation up-to ...
We apply powerful proof-techniques of concurrency theory to study the observational theory of Thiele...
International audienceWe propose a categorical framework for structural operational semantics, in wh...