The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel Hirschkoff: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel Hirschkoff
    An Extensional Spatial Logic for Mobile Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:325-339 [Conf]
  2. David Teller, Pascal Zimmer, Daniel Hirschkoff
    Using Ambients to Control Resources. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:288-303 [Conf]
  3. Daniel Hirschkoff, Damien Pous, Davide Sangiorgi
    A Correct Abstract Machine for Safe Ambients. [Citation Graph (0, 0)][DBLP]
    COORDINATION, 2005, pp:17-32 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:364-378 [Conf]
  5. Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi
    Minimality Results for the Spatial Logics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:252-264 [Conf]
  6. Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani
    Component-Oriented Programming with Sharing: Containment is Not Ownership. [Citation Graph (0, 0)][DBLP]
    GPCE, 2005, pp:389-404 [Conf]
  7. Mario Coppo, Daniel Hirschkoff
    Incremental Inference of Partial Types. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:50-73 [Conf]
  8. Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi
    Separability, Expressiveness, and Decidability in the Ambient Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:423-432 [Conf]
  9. Daniel Hirschkoff
    On the Benefits of Using the Up-To Techniques for Bisimulation Verification. [Citation Graph (0, 0)][DBLP]
    TACAS, 1999, pp:285-299 [Conf]
  10. Daniel Hirschkoff
    A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1997, pp:153-169 [Conf]
  11. Sylvain Boulmé, Thérèse Hardin, Daniel Hirschkoff, Valérie Ménissier-Morain, Renaud Rioboo
    On the way to certify Computer Algebra Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:23, n:3, pp:- [Journal]
  12. Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi
    On the Representation of McCarthy's amb in the -calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:96, n:, pp:73-89 [Journal]
  13. Daniel Hirschkoff
    Automatically Proving Up-to Bisimulation. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:18, n:, pp:- [Journal]
  14. David Teller, Pascal Zimmer, Daniel Hirschkoff
    Using ambients to control resources. [Citation Graph (0, 0)][DBLP]
    Int. J. Inf. Sec., 2004, v:2, n:3-4, pp:126-144 [Journal]
  15. Christine Röckl, Daniel Hirschkoff
    A fully adequate shallow embedding of the [pi]-calculus in Isabelle/HOL with mechanized syntax analysis. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:2, pp:415-451 [Journal]
  16. Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi
    On the Expressiveness of the Ambient Logic. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:2, pp:- [Journal]
  17. Daniel Hirschkoff
    Bisimulation verification using the up to techniques. [Citation Graph (0, 0)][DBLP]
    STTT, 2001, v:3, n:3, pp:271-285 [Journal]
  18. Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi
    On the representation of McCarthy's amb in the Pi-calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:3, pp:439-473 [Journal]
  19. Daniel Hirschkoff, Damien Pous
    A Distribution Law for CCS and a New Congruence Result for the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:228-242 [Conf]
  20. Daniel Hirschkoff, Damien Pous
    A Distribution Law for CCS and a New Congruence Result for the pi-calculus [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  21. Daniel Hirschkoff, Damien Pous, Davide Sangiorgi
    An efficient abstract machine for Safe Ambients. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:71, n:2, pp:114-149 [Journal]

  22. Mobile Processes and Termination. [Citation Graph (, )][DBLP]


  23. Termination in Impure Concurrent Languages. [Citation Graph (, )][DBLP]


  24. On Bisimilarity and Substitution in Presence of Replication. [Citation Graph (, )][DBLP]


  25. Static and dynamic typing for the termination of mobile processes. [Citation Graph (, )][DBLP]


  26. On the Complexity of Termination Inference for Processes. [Citation Graph (, )][DBLP]


  27. Termination in Higher-Order Concurrent Calculi. [Citation Graph (, )][DBLP]


  28. On the Expressiveness of the Ambient Logic [Citation Graph (, )][DBLP]


  29. Separability in the Ambient Logic [Citation Graph (, )][DBLP]


  30. On characterising strong bisimilarity in a fragment of CCS with replication [Citation Graph (, )][DBLP]


  31. Encapsulation and Dynamic Modularity in the Pi-Calculus [Citation Graph (, )][DBLP]


  32. Encapsulation and Dynamic Modularity in the pi-calculus. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002