 | 2011 |
|---|
| 37 |       | Ioana Cristescu,
Daniel Hirschkoff:
Termination in a Pi-calculus with Subtyping
EXPRESS 2011: 44 |
| 36 | | Romain Demangeon,
Daniel Hirschkoff,
Davide Sangiorgi:
Strong Normalisation in λ-Calculi with References.
FSEN 2011: 128-142 |
| 2010 |
|---|
| 35 | | Romain Demangeon,
Daniel Hirschkoff,
Davide Sangiorgi:
Termination in Impure Concurrent Languages.
CONCUR 2010: 328-342 |
| 34 | | Daniel Hirschkoff,
Damien Pous:
On Bisimilarity and Substitution in Presence of Replication.
ICALP (2) 2010: 454-465 |
| 33 | | Romain Demangeon,
Daniel Hirschkoff,
Davide Sangiorgi:
Termination in higher-order concurrent calculi.
J. Log. Algebr. Program. 79(7): 550-577 (2010) |
| 2009 |
|---|
| 32 | | Romain Demangeon,
Daniel Hirschkoff,
Davide Sangiorgi:
Termination in Higher-Order Concurrent Calculi.
FSEN 2009: 81-96 |
| 31 | | Romain Demangeon,
Daniel Hirschkoff,
Davide Sangiorgi:
Mobile Processes and Termination.
Semantics and Algebraic Specification 2009: 250-273 |
| 30 | | Daniel Hirschkoff,
Aurélien Pardon,
Tom Hirschowitz,
Samuel Hym,
Damien Pous:
Encapsulation and Dynamic Modularity in the Pi-Calculus
CoRR abs/0906.5446: (2009) |
| 29 | | Daniel Hirschkoff,
Aurélien Pardon,
Tom Hirschowitz,
Samuel Hym,
Damien Pous:
Encapsulation and Dynamic Modularity in the pi-calculus.
Electr. Notes Theor. Comput. Sci. 241: 85-100 (2009) |
| 2008 |
|---|
| 28 | | Romain Demangeon,
Daniel Hirschkoff,
Davide Sangiorgi:
Static and dynamic typing for the termination of mobile processes.
IFIP TCS 2008: 413-427 |
| 27 | | Daniel Hirschkoff,
Étienne Lozes,
Davide Sangiorgi:
Separability in the Ambient Logic
CoRR abs/0806.3849: (2008) |
| 26 | | Daniel Hirschkoff,
Damien Pous:
On characterising strong bisimilarity in a fragment of CCS with replication
CoRR abs/0810.2061: (2008) |
| 25 | | Daniel Hirschkoff,
Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the p-calculus.
Logical Methods in Computer Science 4(2): (2008) |
| 24 | | Étienne Lozes,
Daniel Hirschkoff,
Davide Sangiorgi:
Separability in the Ambient Logic.
Logical Methods in Computer Science 4(3): (2008) |
| 2007 |
|---|
| 23 | | Daniel Hirschkoff,
Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-Calculus.
FoSSaCS 2007: 228-242 |
| 22 | | Romain Demangeon,
Daniel Hirschkoff,
Naoki Kobayashi,
Davide Sangiorgi:
On the Complexity of Termination Inference for Processes.
TGC 2007: 140-155 |
| 21 | | Daniel Hirschkoff,
Damien Pous,
Davide Sangiorgi:
An efficient abstract machine for Safe Ambients.
J. Log. Algebr. Program. 71(2): 114-149 (2007) |
| 2006 |
|---|
| 20 | | Daniel Hirschkoff,
Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-calculus
CoRR abs/cs/0608059: (2006) |
| 19 | | Daniel Hirschkoff,
Étienne Lozes,
Davide Sangiorgi:
On the Expressiveness of the Ambient Logic.
Logical Methods in Computer Science 2(2): (2006) |
| 2005 |
|---|
| 18 | | Daniel Hirschkoff,
Damien Pous,
Davide Sangiorgi:
A Correct Abstract Machine for Safe Ambients.
COORDINATION 2005: 17-32 |
| 17 | | 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 | | Daniel Hirschkoff,
Étienne Lozes,
Davide Sangiorgi:
On the Expressiveness of the Ambient Logic
CoRR abs/cs/0510010: (2005) |
| 15 | | 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 | | Daniel Hirschkoff:
An Extensional Spatial Logic for Mobile Processes.
CONCUR 2004: 325-339 |
| 13 | | 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 | | David Teller,
Pascal Zimmer,
Daniel Hirschkoff:
Using ambients to control resources.
Int. J. Inf. Sec. 2(3-4): 126-144 (2004) |
| 2003 |
|---|
| 11 | | Daniel Hirschkoff,
Étienne Lozes,
Davide Sangiorgi:
Minimality Results for the Spatial Logics.
FSTTCS 2003: 252-264 |
| 10 | | 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 | | David Teller,
Pascal Zimmer,
Daniel Hirschkoff:
Using Ambients to Control Resources.
CONCUR 2002: 288-303 |
| 8 | | Daniel Hirschkoff,
Étienne Lozes,
Davide Sangiorgi:
Separability, Expressiveness, and Decidability in the Ambient Logic.
LICS 2002: 423-432 |
| 2001 |
|---|
| 7 | | 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 | | Mario Coppo,
Daniel Hirschkoff:
Incremental Inference of Partial Types.
ICTCS 2001: 50-73 |
| 5 | | Daniel Hirschkoff:
Bisimulation verification using the up to techniques.
STTT 3(3): 271-285 (2001) |
| 1999 |
|---|
| 4 | | Daniel Hirschkoff:
On the Benefits of Using the Up-To Techniques for Bisimulation Verification.
TACAS 1999: 285-299 |
| 3 | | 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): 370-385 (1999) |
| 1998 |
|---|
| 2 | | Daniel Hirschkoff:
Automatically Proving Up-to Bisimulation.
Electr. Notes Theor. Comput. Sci. 18: 75-89 (1998) |
| 1997 |
|---|
| 1 | | Daniel Hirschkoff:
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions.
TPHOLs 1997: 153-169 |
Data released under the ODC-BY 1.0 license — See also our legal information page