dblp.uni-trier.dewww.uni-trier.de

Daniel Hirschkoff Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
31EERomain Demangeon, Daniel Hirschkoff, Davide Sangiorgi: Mobile Processes and Termination. Semantics and Algebraic Specification 2009: 250-273
30EEDaniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous: Encapsulation and Dynamic Modularity in the Pi-Calculus CoRR abs/0906.5446: (2009)
29EEDaniel 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
28EERomain Demangeon, Daniel Hirschkoff, Davide Sangiorgi: Static and dynamic typing for the termination of mobile processes. IFIP TCS 2008: 413-427
27EEDaniel Hirschkoff, Étienne Lozes, Davide Sangiorgi: Separability in the Ambient Logic CoRR abs/0806.3849: (2008)
26EEDaniel Hirschkoff, Damien Pous: On characterising strong bisimilarity in a fragment of CCS with replication CoRR abs/0810.2061: (2008)
25EEDaniel 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)
24EEÉtienne Lozes, Daniel Hirschkoff, Davide Sangiorgi: Separability in the Ambient Logic. Logical Methods in Computer Science 4(3): (2008)
2007
23EEDaniel Hirschkoff, Damien Pous: A Distribution Law for CCS and a New Congruence Result for the pi-Calculus. FoSSaCS 2007: 228-242
22EERomain Demangeon, Daniel Hirschkoff, Naoki Kobayashi, Davide Sangiorgi: On the Complexity of Termination Inference for Processes. TGC 2007: 140-155
21EEDaniel Hirschkoff, Damien Pous, Davide Sangiorgi: An efficient abstract machine for Safe Ambients. J. Log. Algebr. Program. 71(2): 114-149 (2007)
2006
20EEDaniel Hirschkoff, Damien Pous: A Distribution Law for CCS and a New Congruence Result for the pi-calculus CoRR abs/cs/0608059: (2006)
19EEDaniel Hirschkoff, Étienne Lozes, Davide Sangiorgi: On the Expressiveness of the Ambient Logic. Logical Methods in Computer Science 2(2): (2006)
2005
18EEDaniel Hirschkoff, Damien Pous, Davide Sangiorgi: A Correct Abstract Machine for Safe Ambients. COORDINATION 2005: 17-32
17EEDaniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani: Component-Oriented Programming with Sharing: Containment is Not Ownership. GPCE 2005: 389-404
16EEDaniel Hirschkoff, Étienne Lozes, Davide Sangiorgi: On the Expressiveness of the Ambient Logic CoRR abs/cs/0510010: (2005)
15EEArnaud 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
14EEDaniel Hirschkoff: An Extensional Spatial Logic for Mobile Processes. CONCUR 2004: 325-339
13EEArnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi: On the Representation of McCarthy's amb in the -calculus. Electr. Notes Theor. Comput. Sci. 96: 73-89 (2004)
12EEDavid Teller, Pascal Zimmer, Daniel Hirschkoff: Using ambients to control resources. Int. J. Inf. Sec. 2(3-4): 126-144 (2004)
2003
11EEDaniel Hirschkoff, Étienne Lozes, Davide Sangiorgi: Minimality Results for the Spatial Logics. FSTTCS 2003: 252-264
10EEChristine 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
9EEDavid Teller, Pascal Zimmer, Daniel Hirschkoff: Using Ambients to Control Resources. CONCUR 2002: 288-303
8EEDaniel Hirschkoff, Étienne Lozes, Davide Sangiorgi: Separability, Expressiveness, and Decidability in the Ambient Logic. LICS 2002: 423-432
2001
7EEChristine 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
6EEMario Coppo, Daniel Hirschkoff: Incremental Inference of Partial Types. ICTCS 2001: 50-73
5EEDaniel Hirschkoff: Bisimulation verification using the up to techniques. STTT 3(3): 271-285 (2001)
1999
4EEDaniel Hirschkoff: On the Benefits of Using the Up-To Techniques for Bisimulation Verification. TACAS 1999: 285-299
3EESylvain 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
2EEDaniel Hirschkoff: Automatically Proving Up-to Bisimulation. Electr. Notes Theor. Comput. Sci. 18: (1998)
1997
1EEDaniel Hirschkoff: A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions. TPHOLs 1997: 153-169

Coauthor Index

1Stefan Berghofer [7]
2Sylvain Boulmé [3]
3Arnaud Carayol [13] [15]
4Mario Coppo [6]
5Romain Demangeon [22] [28] [31]
6Thérèse Hardin [3]
7Tom Hirschowitz [17] [29] [30]
8Samuel Hym [29] [30]
9Naoki Kobayashi [22]
10Étienne Lozes [8] [11] [16] [19] [24] [27]
11Valérie Ménissier-Morain [3]
12Aurélien Pardon [29] [30]
13Damien Pous [17] [18] [20] [21] [23] [25] [26] [29] [30]
14Renaud Rioboo [3]
15Christine Röckl [7] [10]
16Davide Sangiorgi [8] [11] [13] [15] [16] [18] [19] [21] [22] [24] [27] [28] [31]
17Alan Schmitt [17]
18Jean-Bernard Stefani [17]
19David Teller [9] [12]
20Pascal Zimmer [9] [12]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)