D. Hirschkoff

发表

On sequentiality and well-bracketing in the π-calculus

D. Sangiorgi, D. Hirschkoff, Enguerrand Prebet, 2021, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Using ambients to control resources

David Teller, Daniel Hirschkoff, Pascal Zimmer, 2004, International Journal of Information Security.

Eager functions as processes

D. Sangiorgi, D. Hirschkoff, Adrien Durier, 2022, Theor. Comput. Sci..

Termination in a π-calculus with Subtyping Ioana Cristescu

D. Hirschkoff, Ioana Cristescu, 2019 .

Automatically Proving Up-to Bisimulation Automatically Proving Up-to Bisimulation

D. Hirschkoff, 1998 .

Encapsulation and Dynamic Modularity in the pi-calculus

D. Pous, D. Hirschkoff, Tom Hirschowitz, 2009, Electron. Notes Theor. Comput. Sci..

Termination in a π-calculus with subtyping

Daniel Hirschkoff, Ioana Cristescu, D. Hirschkoff, 2015, Mathematical Structures in Computer Science.

Eager Functions as Processes

Davide Sangiorgi, Daniel Hirschkoff, Adrien Durier, 2018, LICS.

A brief survey of the theory of the π-calculus

Daniel Hirschkoff, D. Hirschkoff, 2003 .

Eager Functions as Processes (long version)

D. Sangiorgi, D. Hirschkoff, Adrien Durier, 2022, ArXiv.

Minimality Results for the Spatial Logics

Davide Sangiorgi, Daniel Hirschkoff, Étienne Lozes, 2003, FSTTCS.

An efficient abstract machine for Safe Ambients

Davide Sangiorgi, Damien Pous, Daniel Hirschkoff, 2007, J. Log. Algebraic Methods Program..

An Extensional Spatial Logic for Mobile Processes

Daniel Hirschkoff, D. Hirschkoff, 2004, CONCUR.

On the Representation of References in the Pi-Calculus

Davide Sangiorgi, Daniel Hirschkoff, Enguerrand Prebet, 2020, CONCUR.

On the way to certify Computer Algebra Systems

Thérèse Hardin, Daniel Hirschkoff, Sylvain Boulmé, 1999, Calculemus.

Damien Pous, Daniel Hirschkoff, D. Pous, 2010, ICALP.

A Distribution Law for CCS and a New Congruence Result for the p-calculus pdf

Damien Pous, Daniel Hirschkoff, D. Pous, 2006, Log. Methods Comput. Sci..

Divergence and Unique Solution of Equations

Davide Sangiorgi, Daniel Hirschkoff, Adrien Durier, 2017, CONCUR.

A behavioural theory for a π-calculus with preorders

Daniel Hirschkoff, Jean-Marie Madiot, Xian Xu, 2015, J. Log. Algebraic Methods Program..

Symmetries and Dualities in Name-Passing Process Calculi

Davide Sangiorgi, Daniel Hirschkoff, Jean-Marie Madiot, 2014, Computing with New Resources.

On the Expressiveness of the Ambient Logic pdf

Davide Sangiorgi, Daniel Hirschkoff, Étienne Lozes, 2005, Log. Methods Comput. Sci..

Separability, expressiveness, and decidability in the ambient logic

Davide Sangiorgi, Daniel Hirschkoff, Étienne Lozes, 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

A fully adequate shallow embedding of the π-calculus in Isabelle/HOL with mechanized syntax analysis

Daniel Hirschkoff, Christine Röckl, D. Hirschkoff, 2003, Journal of Functional Programming.

Mobile Processes and Termination

Davide Sangiorgi, Daniel Hirschkoff, Romain Demangeon, 2009, Semantics and Algebraic Specification.

On the Representation of McCarthy's amb in the π-calculus

Davide Sangiorgi, Arnaud Carayol, Daniel Hirschkoff, 2004, EXPRESS.

Termination in higher-order concurrent calculi

Davide Sangiorgi, Daniel Hirschkoff, Romain Demangeon, 2009, J. Log. Algebraic Methods Program..

Bisimulation verification using the up to techniques

Daniel Hirschkoff, D. Hirschkoff, 2001, International Journal on Software Tools for Technology Transfer.

On the Benefits of Using the Up-To Techniques for Bisimulation Verification

Daniel Hirschkoff, D. Hirschkoff, 1999, TACAS.

Calculs de processus: observations et inspections. (Process calculi: observations, inspections)

Daniel Hirschkoff, D. Hirschkoff, 2009 .