A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions. - Daniel Hirschkoff (TPHOLs, 1997)

Automatically Proving Up-to Bisimulation. - Daniel Hirschkoff (MFCS Workshop on Concurrency, 1998)

On the Benefits of Using the Up-To Techniques for Bisimulation Verification. - Daniel Hirschkoff (TACAS, 1999)

On the way to certify Computer Algebra Systems. - Sylvain Boulmé; Thérèse Hardin; Daniel Hirschkoff; Valérie Ménissier-Morain; Renaud Rioboo (Calculemus, 1999)

Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts. - Christine Röckl; Daniel Hirschkoff; Stefan Berghofer (FoSSaCS, 2001)

Incremental Inference of Partial Types. - Mario Coppo; Daniel Hirschkoff (ICTCS, 2001)

Bisimulation verification using the up to techniques. - Daniel Hirschkoff (Int. J. Softw. Tools Technol. Transf., 2001)

Separability, Expressiveness, and Decidability in the Ambient Logic. - Daniel Hirschkoff; Étienne Lozes; Davide Sangiorgi (LICS, 2002)

Minimality Results for the Spatial Logics. - Daniel Hirschkoff; Étienne Lozes; Davide Sangiorgi (FSTTCS, 2003)

On the Representation of McCarthy's amb in the π-calculus. - Arnaud Carayol; Daniel Hirschkoff; Davide Sangiorgi (EXPRESS, 2003)

A fully adequate shallow embedding of the [pi]-calculus in Isabelle/HOL with mechanized syntax analysis. - Christine Röckl; Daniel Hirschkoff (J. Funct. Program., 2003)

An Extensional Spatial Logic for Mobile Processes. - Daniel Hirschkoff (CONCUR, 2004)

Using ambients to control resources. - David Teller; Pascal Zimmer; Daniel Hirschkoff (Int. J. Inf. Sec., 2004)

A Correct Abstract Machine for Safe Ambients. - Daniel Hirschkoff; Damien Pous; Davide Sangiorgi (COORDINATION, 2005)

Component-Oriented Programming with Sharing: Containment is Not Ownership. - Daniel Hirschkoff; Tom Hirschowitz; Damien Pous; Alan Schmitt; Jean-Bernard Stefani (GPCE, 2005)

On the representation of McCarthy's amb in the Pi-calculus. - Arnaud Carayol; Daniel Hirschkoff; Davide Sangiorgi (Theor. Comput. Sci., 2005)

A Distribution Law for CCS and a New Congruence Result for the pi-calculus - Daniel Hirschkoff; Damien Pous (CoRR, 2006)

On the Expressiveness of the Ambient Logic. - Daniel Hirschkoff; Étienne Lozes; Davide Sangiorgi (Log. Methods Comput. Sci., 2006)

A Distribution Law for CCS and a New Congruence Result for the pi-Calculus. - Daniel Hirschkoff; Damien Pous (FoSSaCS, 2007)

On the Complexity of Termination Inference for Processes. - Romain Demangeon; Daniel Hirschkoff; Naoki Kobayashi 001; Davide Sangiorgi (TGC, 2007)

An efficient abstract machine for Safe Ambients. - Daniel Hirschkoff; Damien Pous; Davide Sangiorgi (J. Log. Algebraic Methods Program., 2007)

Static and dynamic typing for the termination of mobile processes. - Romain Demangeon; Daniel Hirschkoff; Davide Sangiorgi (IFIP TCS, 2008)

On characterising strong bisimilarity in a fragment of CCS with replication - Daniel Hirschkoff; Damien Pous (CoRR, 2008)

Encapsulation and Dynamic Modularity in the pi-calculus. - Daniel Hirschkoff; Aurélien Pardon; Tom Hirschowitz; Samuel Hym; Damien Pous (PLACES@DisCoTec, 2008)

A Distribution Law for CCS and a New Congruence Result for the p-calculus. - Daniel Hirschkoff; Damien Pous (Log. Methods Comput. Sci., 2008)

Separability in the Ambient Logic. - Étienne Lozes; Daniel Hirschkoff; Davide Sangiorgi (Log. Methods Comput. Sci., 2008)

Calculs de processus: observations et inspections. (Process calculi: observations, inspections). - Daniel Hirschkoff (2009)

Mobile Processes and Termination. - Romain Demangeon; Daniel Hirschkoff; Davide Sangiorgi (Semantics and Algebraic Specification, 2009)

Termination in Impure Concurrent Languages. - Romain Demangeon; Daniel Hirschkoff; Davide Sangiorgi (CONCUR, 2010)

On Bisimilarity and Substitution in Presence of Replication. - Daniel Hirschkoff; Damien Pous (ICALP (2), 2010)

Termination in higher-order concurrent calculi. - Romain Demangeon; Daniel Hirschkoff; Davide Sangiorgi (J. Log. Algebraic Methods Program., 2010)

Strong Normalisation in λ-Calculi with References. - Romain Demangeon; Daniel Hirschkoff; Davide Sangiorgi (FSEN, 2011)

Termination in a Pi-calculus with Subtyping - Ioana Cristescu; Daniel Hirschkoff (EXPRESS, 2011)

Duality and i/o-Types in the π-Calculus. - Daniel Hirschkoff; Jean-Marie Madiot; Davide Sangiorgi (CONCUR, 2012)

Symmetries and Dualities in Name-Passing Process Calculi. - Daniel Hirschkoff; Jean-Marie Madiot; Davide Sangiorgi (Computing with New Resources, 2014)

A behavioural theory for a π-calculus with preorders. - Daniel Hirschkoff; Jean-Marie Madiot; Xian Xu 001 (J. Log. Algebraic Methods Program., 2015)

Name-passing calculi: From fusions to preorders and types. - Daniel Hirschkoff; Jean-Marie Madiot; Davide Sangiorgi (Inf. Comput., 2016)

Termination in a π-calculus with subtyping. - Ioana Cristescu; Daniel Hirschkoff (Math. Struct. Comput. Sci., 2016)

Modeling Imperative Constructs in the Pi-Calculus. - Daniel Hirschkoff; Enguerrand Prebet; Davide Sangiorgi (ICTCS, 2019)

Divergence and unique solution of equations. - Adrien Durier; Daniel Hirschkoff; Davide Sangiorgi (Log. Methods Comput. Sci., 2019)

On the Representation of References in the Pi-Calculus. - Daniel Hirschkoff; Enguerrand Prebet; Davide Sangiorgi (CONCUR, 2020)

Towards 'up to context' reasoning about higher-order processes. - Adrien Durier; Daniel Hirschkoff; Davide Sangiorgi (Theor. Comput. Sci., 2020)

On sequentiality and well-bracketing in the π-calculus. - Daniel Hirschkoff; Enguerrand Prebet; Davide Sangiorgi (LICS, 2021)

Eager Functions as Processes (long version). - Adrien Durier; Daniel Hirschkoff; Davide Sangiorgi (CoRR, 2022)

Eager functions as processes. - Adrien Durier; Daniel Hirschkoff; Davide Sangiorgi (Theor. Comput. Sci., 2022)

Deciding Contextual Equivalence of ν-Calculus with Effectful Contexts. - Daniel Hirschkoff; Guilhem Jaber; Enguerrand Prebet (FoSSaCS, 2023)

Using Pi-Calculus Names as Locks. - Daniel Hirschkoff; Enguerrand Prebet (EXPRESS/SOS, 2023)

Proof Techniques for Behavioural Relations Based on Unique-Solutions of Equations and Inequations. - Adrien Durier; Daniel Hirschkoff; Davide Sangiorgi (Rebeca for Actor Analysis in Action, 2025)

First-Order Store and Visibility in Name-Passing Calculi. - Daniel Hirschkoff; Iwan Quémerais; Davide Sangiorgi (CONCUR, 2025)