| 2008 |
|---|
| 26 | EE | Romain Demangeon,
Daniel Hirschkoff,
Davide Sangiorgi:
Static and dynamic typing for the termination of mobile processes.
IFIP TCS 2008: 413-427 |
| 25 | EE | Daniel Hirschkoff,
Étienne Lozes,
Davide Sangiorgi:
Separability in the Ambient Logic
CoRR abs/0806.3849: (2008) |
| 24 | EE | Daniel Hirschkoff,
Damien Pous:
On characterising strong bisimilarity in a fragment of CCS with replication
CoRR abs/0810.2061: (2008) |
| 2007 |
|---|
| 23 | EE | Daniel Hirschkoff,
Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-Calculus.
FoSSaCS 2007: 228-242 |
| 22 | EE | Romain Demangeon,
Daniel Hirschkoff,
Naoki Kobayashi,
Davide Sangiorgi:
On the Complexity of Termination Inference for Processes.
TGC 2007: 140-155 |
| 21 | EE | Daniel Hirschkoff,
Damien Pous,
Davide Sangiorgi:
An efficient abstract machine for Safe Ambients.
J. Log. Algebr. Program. 71(2): 114-149 (2007) |
| 2006 |
|---|
| 20 | EE | Daniel Hirschkoff,
Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-calculus
CoRR abs/cs/0608059: (2006) |
| 19 | EE | Daniel Hirschkoff,
Étienne Lozes,
Davide Sangiorgi:
On the Expressiveness of the Ambient Logic.
Logical Methods in Computer Science 2(2): (2006) |
| 2005 |
|---|
| 18 | EE | Daniel Hirschkoff,
Damien Pous,
Davide Sangiorgi:
A Correct Abstract Machine for Safe Ambients.
COORDINATION 2005: 17-32 |
| 17 | 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 |
| 16 | EE | Daniel Hirschkoff,
Étienne Lozes,
Davide Sangiorgi:
On the Expressiveness of the Ambient Logic
CoRR abs/cs/0510010: (2005) |
| 15 | EE | Arnaud Carayol,
Daniel Hirschkoff,
Davide Sangiorgi:
On the representation of McCarthy's amb in the Pi-calculus.
Theor. Comput. Sci. 330(3): 439-473 (2005) |
| 2004 |
|---|
| 14 | EE | Daniel Hirschkoff:
An Extensional Spatial Logic for Mobile Processes.
CONCUR 2004: 325-339 |
| 13 | EE | Arnaud Carayol,
Daniel Hirschkoff,
Davide Sangiorgi:
On the Representation of McCarthy's amb in the -calculus.
Electr. Notes Theor. Comput. Sci. 96: 73-89 (2004) |
| 12 | EE | David Teller,
Pascal Zimmer,
Daniel Hirschkoff:
Using ambients to control resources.
Int. J. Inf. Sec. 2(3-4): 126-144 (2004) |
| 2003 |
|---|
| 11 | EE | Daniel Hirschkoff,
Étienne Lozes,
Davide Sangiorgi:
Minimality Results for the Spatial Logics.
FSTTCS 2003: 252-264 |
| 10 | EE | Christine Röckl,
Daniel Hirschkoff:
A fully adequate shallow embedding of the [pi]-calculus in Isabelle/HOL with mechanized syntax analysis.
J. Funct. Program. 13(2): 415-451 (2003) |
| 2002 |
|---|
| 9 | EE | David Teller,
Pascal Zimmer,
Daniel Hirschkoff:
Using Ambients to Control Resources.
CONCUR 2002: 288-303 |
| 8 | EE | Daniel Hirschkoff,
Étienne Lozes,
Davide Sangiorgi:
Separability, Expressiveness, and Decidability in the Ambient Logic.
LICS 2002: 423-432 |
| 2001 |
|---|
| 7 | EE | Christine Röckl,
Daniel Hirschkoff,
Stefan Berghofer:
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts.
FoSSaCS 2001: 364-378 |
| 6 | EE | Mario Coppo,
Daniel Hirschkoff:
Incremental Inference of Partial Types.
ICTCS 2001: 50-73 |
| 5 | EE | Daniel Hirschkoff:
Bisimulation verification using the up to techniques.
STTT 3(3): 271-285 (2001) |
| 1999 |
|---|
| 4 | EE | Daniel Hirschkoff:
On the Benefits of Using the Up-To Techniques for Bisimulation Verification.
TACAS 1999: 285-299 |
| 3 | EE | Sylvain Boulmé,
Thérèse Hardin,
Daniel Hirschkoff,
Valérie Ménissier-Morain,
Renaud Rioboo:
On the way to certify Computer Algebra Systems.
Electr. Notes Theor. Comput. Sci. 23(3): (1999) |
| 1998 |
|---|
| 2 | EE | Daniel Hirschkoff:
Automatically Proving Up-to Bisimulation.
Electr. Notes Theor. Comput. Sci. 18: (1998) |
| 1997 |
|---|
| 1 | | Daniel Hirschkoff:
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions.
TPHOLs 1997: 153-169 |
