2008 |
12 | EE | Daniel Hirschkoff,
Damien Pous:
On characterising strong bisimilarity in a fragment of CCS with replication
CoRR abs/0810.2061: (2008) |
11 | EE | Damien Pous:
Using bisimulation proof techniques for the analysis of distributed abstract machines.
Theor. Comput. Sci. 402(2-3): 199-220 (2008) |
2007 |
10 | EE | Damien Pous:
Complete Lattices and Up-To Techniques.
APLAS 2007: 351-366 |
9 | EE | Daniel Hirschkoff,
Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-Calculus.
FoSSaCS 2007: 228-242 |
8 | EE | Daniel Hirschkoff,
Damien Pous,
Davide Sangiorgi:
An efficient abstract machine for Safe Ambients.
J. Log. Algebr. Program. 71(2): 114-149 (2007) |
7 | EE | Damien Pous:
New up-to techniques for weak bisimulation.
Theor. Comput. Sci. 380(1-2): 164-180 (2007) |
2006 |
6 | EE | Damien Pous:
Weak Bisimulation Up to Elaboration.
CONCUR 2006: 390-405 |
5 | EE | Damien Pous:
On Bisimulation Proofs for the Analysis of Distributed Abstract Machines.
TGC 2006: 150-166 |
4 | EE | Daniel Hirschkoff,
Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-calculus
CoRR abs/cs/0608059: (2006) |
2005 |
3 | EE | Daniel Hirschkoff,
Damien Pous,
Davide Sangiorgi:
A Correct Abstract Machine for Safe Ambients.
COORDINATION 2005: 17-32 |
2 | EE | Daniel Hirschkoff,
Tom Hirschowitz,
Damien Pous,
Alan Schmitt,
Jean-Bernard Stefani:
Component-Oriented Programming with Sharing: Containment is Not Ownership.
GPCE 2005: 389-404 |
1 | EE | Damien Pous:
Up-to Techniques for Weak Bisimulation.
ICALP 2005: 730-741 |