default search action
Daniel Hirschkoff
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c34]Daniel Hirschkoff, Guilhem Jaber, Enguerrand Prebet
:
Deciding Contextual Equivalence of ν-Calculus with Effectful Contexts. FoSSaCS 2023: 24-45 - [c33]Daniel Hirschkoff, Enguerrand Prebet:
Using Pi-Calculus Names as Locks. EXPRESS/SOS 2023: 76-96 - 2022
- [j15]Adrien Durier, Daniel Hirschkoff
Eager functions as processes. Theor. Comput. Sci. 913: 8-42 (2022) - [i9]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Eager Functions as Processes (long version). CoRR abs/2202.03187 (2022) - 2021
- [c32]Daniel Hirschkoff, Enguerrand Prebet
On sequentiality and well-bracketing in the π-calculus. LICS 2021: 1-13 - [i8]Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi:
On sequentiality and well-bracketing in the π-calculus. CoRR abs/2104.10942 (2021) - [i7]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Eager Functions as Processes. CoRR abs/2112.02863 (2021) - 2020
- [j14]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Towards 'up to context' reasoning about higher-order processes. Theor. Comput. Sci. 807: 154-168 (2020) - [c31]Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi:
On the Representation of References in the Pi-Calculus. CONCUR 2020: 34:1-34:20
2010 – 2019
- 2019
- [j13]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Divergence and unique solution of equations. Log. Methods Comput. Sci. 15(3) (2019) - [c30]Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi:
Modeling Imperative Constructs in the Pi-Calculus. ICTCS 2019: 136-138 - 2018
- [c29]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Eager Functions as Processes. LICS 2018: 364-373 - [i6]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Divergence and unique solution of equations. CoRR abs/1806.11354 (2018) - 2017
- [c28]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Divergence and Unique Solution of Equations. CONCUR 2017: 11:1-11:16 - 2016
- [j12]Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Name-passing calculi: From fusions to preorders and types. Inf. Comput. 251: 335-360 (2016) - [j11]Ioana Cristescu, Daniel Hirschkoff:
Termination in a π-calculus with subtyping. Math. Struct. Comput. Sci. 26(8): 1395-1432 (2016) - 2015
- [j10]Daniel Hirschkoff, Jean-Marie Madiot, Xian Xu:
A behavioural theory for a π-calculus with preorders. J. Log. Algebraic Methods Program. 84(6): 806-825 (2015) - [c27]Daniel Hirschkoff, Jean-Marie Madiot, Xian Xu:
A Behavioural Theory for a π-calculus with Preorders. FSEN 2015: 143-158 - 2014
- [c26]Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Symmetries and Dualities in Name-Passing Process Calculi. Computing with New Resources 2014: 307-322 - 2013
- [c25]Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Name-Passing Calculi: From Fusions to Preorders and Types. LICS 2013: 378-387 - 2012
- [c24]Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Duality and i/o-Types in the π-Calculus. CONCUR 2012: 302-316 - 2011
- [c23]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Strong Normalisation in λ-Calculi with References. FSEN 2011: 128-142 - [c22]Ioana Cristescu, Daniel Hirschkoff:
Termination in a Pi-calculus with Subtyping. EXPRESS 2011: 44 - 2010
- [j9]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Termination in higher-order concurrent calculi. J. Log. Algebraic Methods Program. 79(7): 550-577 (2010) - [c21]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Termination in Impure Concurrent Languages. CONCUR 2010: 328-342 - [c20]Daniel Hirschkoff, Damien Pous
On Bisimilarity and Substitution in Presence of Replication. ICALP (2) 2010: 454-465
2000 – 2009
- 2009
- [b1]Daniel Hirschkoff:
Calculs de processus: observations et inspections. (Process calculi: observations, inspections). École normale supérieure de Lyon, France, 2009 - [c19]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Mobile Processes and Termination. Semantics and Algebraic Specification 2009: 250-273 - [c18]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Termination in Higher-Order Concurrent Calculi. FSEN 2009: 81-96 - [i5]Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous:
Encapsulation and Dynamic Modularity in the Pi-Calculus. CoRR abs/0906.5446 (2009) - 2008
- [j8]Daniel Hirschkoff, Damien Pous
A Distribution Law for CCS and a New Congruence Result for the p-calculus. Log. Methods Comput. Sci. 4(2) (2008) - [j7]Étienne Lozes, Daniel Hirschkoff, Davide Sangiorgi:
Separability in the Ambient Logic. Log. Methods Comput. Sci. 4(3) (2008) - [c17]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Static and dynamic typing for the termination of mobile processes. IFIP TCS 2008: 413-427 - [c16]Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous
Encapsulation and Dynamic Modularity in the pi-calculus. PLACES@DisCoTec 2008: 85-100 - [i4]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Separability in the Ambient Logic. CoRR abs/0806.3849 (2008) - [i3]Daniel Hirschkoff, Damien Pous:
On characterising strong bisimilarity in a fragment of CCS with replication. CoRR abs/0810.2061 (2008) - 2007
- [j6]Daniel Hirschkoff, Damien Pous
An efficient abstract machine for Safe Ambients. J. Log. Algebraic Methods Program. 71(2): 114-149 (2007) - [c15]Daniel Hirschkoff, Damien Pous
A Distribution Law for CCS and a New Congruence Result for the pi-Calculus. FoSSaCS 2007: 228-242 - [c14]Romain Demangeon, Daniel Hirschkoff, Naoki Kobayashi
On the Complexity of Termination Inference for Processes. TGC 2007: 140-155 - 2006
- [j5]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
On the Expressiveness of the Ambient Logic. Log. Methods Comput. Sci. 2(2) (2006) - [i2]Daniel Hirschkoff, Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-calculus. CoRR abs/cs/0608059 (2006) - 2005
- [j4]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) - [c13]Daniel Hirschkoff, Damien Pous
A Correct Abstract Machine for Safe Ambients. COORDINATION 2005: 17-32 - [c12]Daniel Hirschkoff, Tom Hirschowitz, Damien Pous
Component-Oriented Programming with Sharing: Containment is Not Ownership. GPCE 2005: 389-404 - [i1]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
On the Expressiveness of the Ambient Logic. CoRR abs/cs/0510010 (2005) - 2004
- [j3]David Teller, Pascal Zimmer, Daniel Hirschkoff:
Using ambients to control resources. Int. J. Inf. Sec. 2(3-4): 126-144 (2004) - [c11]Daniel Hirschkoff:
An Extensional Spatial Logic for Mobile Processes. CONCUR 2004: 325-339 - 2003
- [j2]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) - [c10]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Minimality Results for the Spatial Logics. FSTTCS 2003: 252-264 - [c9]Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi:
On the Representation of McCarthy's amb in the π-calculus. EXPRESS 2003: 73-89 - 2002
- [c8]David Teller, Pascal Zimmer, Daniel Hirschkoff:
Using Ambients to Control Resources. CONCUR 2002: 288-303 - [c7]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Separability, Expressiveness, and Decidability in the Ambient Logic. LICS 2002: 423-432 - 2001
- [j1]Daniel Hirschkoff:
Bisimulation verification using the up to techniques. Int. J. Softw. Tools Technol. Transf. 3(3): 271-285 (2001) - [c6]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 - [c5]Mario Coppo, Daniel Hirschkoff:
Incremental Inference of Partial Types. ICTCS 2001: 50-73
1990 – 1999
- 1999
- [c4]Daniel Hirschkoff:
On the Benefits of Using the Up-To Techniques for Bisimulation Verification. TACAS 1999: 285-299 - [c3]Sylvain Boulmé, Thérèse Hardin, Daniel Hirschkoff, Valérie Ménissier-Morain, Renaud Rioboo:
On the way to certify Computer Algebra Systems. Calculemus 1999: 370-385 - 1998
- [c2]Daniel Hirschkoff:
Automatically Proving Up-to Bisimulation. MFCS Workshop on Concurrency 1998: 75-89 - 1997
- [c1]Daniel Hirschkoff:
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions. TPHOLs 1997: 153-169
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: