The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Davide Sangiorgi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marco Pistore, Davide Sangiorgi
    A Partition Refinement Algorithm for the pi-Calculus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CAV, 1996, pp:38-49 [Conf]
  2. Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi
    On Bisimulations for the Asynchronous pi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1996, pp:147-162 [Conf]
  3. Davide Sangiorgi
    Types, or: Where's the Difference Between CCS and pi? [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:76-97 [Conf]
  4. Davide Sangiorgi, Robin Milner
    The Problem of ``Weak Bisimulation up to''. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:32-46 [Conf]
  5. Davide Sangiorgi, David Walker
    On Barbed Equivalences in pi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:292-304 [Conf]
  6. Davide Sangiorgi
    A Theory of Bisimulation for the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:127-142 [Conf]
  7. Daniel Hirschkoff, Damien Pous, Davide Sangiorgi
    A Correct Abstract Machine for Safe Ambients. [Citation Graph (0, 0)][DBLP]
    COORDINATION, 2005, pp:17-32 [Conf]
  8. Davide Sangiorgi
    Beyond Bisimulation: The "up-to" Techniques. [Citation Graph (0, 0)][DBLP]
    FMCO, 2005, pp:161-171 [Conf]
  9. Davide Sangiorgi
    The Bisimulation Proof Method: Enhancements and Open Problems. [Citation Graph (0, 0)][DBLP]
    FMOODS, 2006, pp:18-19 [Conf]
  10. Christine Röckl, Davide Sangiorgi
    A pi-calculus Process Semantics of Concurrent Idealised ALGOL. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 1999, pp:306-321 [Conf]
  11. Davide Sangiorgi
    Reasoning About Concurrent Systems Using Types. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 1999, pp:31-40 [Conf]
  12. Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi
    Minimality Results for the Spatial Logics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:252-264 [Conf]
  13. Yuxin Deng, Davide Sangiorgi
    Towards an Algebraic Theory of Typed Mobile Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:445-456 [Conf]
  14. Massimo Merro, Davide Sangiorgi
    On Asynchrony in Name-Passing Calculi. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:856-867 [Conf]
  15. Robin Milner, Davide Sangiorgi
    Barbed Bisimulation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:685-695 [Conf]
  16. Davide Sangiorgi
    Internal Mobility and Agent-Passing Calculi. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:672-683 [Conf]
  17. Davide Sangiorgi
    The Name Discipline of Uniform Receptiveness (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:303-313 [Conf]
  18. Davide Sangiorgi, Andrea Valente
    A Distributed Abstract Machine for Safe Ambients. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:408-420 [Conf]
  19. Yuxin Deng, Davide Sangiorgi
    Ensuring Termination by Typability. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:619-632 [Conf]
  20. Michele Boreale, Davide Sangiorgi
    Bisimulation in Name-Passing Calculi without Matching. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:165-175 [Conf]
  21. Marcelo P. Fiore, Eugenio Moggi, Davide Sangiorgi
    A Fully-Abstract Model for the pi-Calculus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:43-54 [Conf]
  22. 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]
  23. Benjamin C. Pierce, Davide Sangiorgi
    Typing and Subtyping for Mobile Processes [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:376-385 [Conf]
  24. Davide Sangiorgi
    Bisimulation: From The Origins to Today. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:298-302 [Conf]
  25. Davide Sangiorgi
    The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:102-109 [Conf]
  26. Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi
    Comparisons Among Classes of Y-Tree Systolic Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:254-260 [Conf]
  27. Davide Sangiorgi
    On the Proof Method for Bisimulation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:479-488 [Conf]
  28. Davide Sangiorgi
    An Investigation into Functions as Processes. [Citation Graph (0, 0)][DBLP]
    MFPS, 1993, pp:143-159 [Conf]
  29. Francesca Levi, Davide Sangiorgi
    Controlling Interference in Ambients. [Citation Graph (0, 0)][DBLP]
    POPL, 2000, pp:352-364 [Conf]
  30. Benjamin C. Pierce, Davide Sangiorgi
    Behavioral Equivalence in the Polymorphic Pi-calculus. [Citation Graph (0, 0)][DBLP]
    POPL, 1997, pp:242-255 [Conf]
  31. Davide Sangiorgi
    Extensionality and Intensionality of the Ambient Logics. [Citation Graph (0, 0)][DBLP]
    POPL, 2001, pp:4-13 [Conf]
  32. Josva Kleist, Davide Sangiorgi
    Imperative objects and mobile processes. [Citation Graph (0, 0)][DBLP]
    PROCOMET, 1998, pp:285-303 [Conf]
  33. Davide Sangiorgi
    Bisimulation in Higher-Order Process Calculi. [Citation Graph (0, 0)][DBLP]
    PROCOMET, 1994, pp:207-224 [Conf]
  34. Joachim Parrow, Davide Sangiorgi
    Algebraic Theories for Name-Passing Calculi. [Citation Graph (0, 0)][DBLP]
    REX School/Symposium, 1993, pp:509-529 [Conf]
  35. Davide Sangiorgi
    Taming Mobile Processes Using Types. [Citation Graph (0, 0)][DBLP]
    SEFM, 2003, pp:64-0 [Conf]
  36. Michele Boreale, Davide Sangiorgi
    A Fully Abstract Semantics for Causality in the Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:243-254 [Conf]
  37. Davide Sangiorgi
    Locality and True-concurrency in Calculi for Mobile Processes. [Citation Graph (0, 0)][DBLP]
    TACS, 1994, pp:405-424 [Conf]
  38. Davide Sangiorgi
    From pi-Calculus to Higher-Order pi-Calculus - and Back. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:151-166 [Conf]
  39. Davide Sangiorgi
    Pi-I: A Symmetric Calculus Based on Internal Mobility. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:172-186 [Conf]
  40. Michele Boreale, Roberto Bruni, Luís Caires, Rocco De Nicola, Ivan Lanese, Michele Loreti, Francisco Martins, Ugo Montanari, António Ravara, Davide Sangiorgi, Vasco Thudichum Vasconcelos, Gianluigi Zavattaro
    SCC: A Service Centered Calculus. [Citation Graph (0, 0)][DBLP]
    WS-FM, 2006, pp:38-57 [Conf]
  41. Michele Boreale, Davide Sangiorgi
    A Fully Abstract Semantics for Causality in the \pi-Calculus. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:5, pp:353-400 [Journal]
  42. Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi
    Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1992, v:29, n:6/7, pp:623-643 [Journal]
  43. Rocco De Nicola, Davide Sangiorgi
    Types in concurrency. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2005, v:42, n:2-3, pp:79-81 [Journal]
  44. Davide Sangiorgi
    A Theory of Bisimulation for the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:1, pp:69-97 [Journal]
  45. 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]
  46. Nicola Mezzetti, Davide Sangiorgi
    Towards a Calculus For Wireless Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:158, n:, pp:331-353 [Journal]
  47. Davide Sangiorgi
    Bisimulation and Co-induction: Some Problems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:311-315 [Journal]
  48. Marcelo P. Fiore, Eugenio Moggi, Davide Sangiorgi
    A Fully Abstract Model for the [pi]-calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:179, n:1, pp:76-117 [Journal]
  49. Joachim Parrow, Davide Sangiorgi
    Algebraic Theories for Name-Passing Calculi [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:2, pp:174-197 [Journal]
  50. Marco Pistore, Davide Sangiorgi
    A Partition Refinement Algorithm for the -Calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:164, n:2, pp:264-321 [Journal]
  51. Davide Sangiorgi
    The Lazy Lambda Calculus in a Concurrency Scenario [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:111, n:1, pp:120-153 [Journal]
  52. Davide Sangiorgi
    Bisimulation for Higher-Order Process Calculi. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:131, n:2, pp:141-178 [Journal]
  53. Davide Sangiorgi
    An Interpretation of Typed Objects into Typed pi-Calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:143, n:1, pp:34-73 [Journal]
  54. Yuxin Deng, Davide Sangiorgi
    Ensuring termination by typability. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:7, pp:1045-1082 [Journal]
  55. Emanuela Fachini, Jozef Gruska, Andrea Maggiolo-Schettini, Davide Sangiorgi
    Simulation of Systolic Tree Automata on Trellis Automata. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:2, pp:87-110 [Journal]
  56. Benjamin C. Pierce, Davide Sangiorgi
    Behavioral equivalence in the polymorphic pi-calculus. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:3, pp:531-584 [Journal]
  57. 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]
  58. Massimo Merro, Davide Sangiorgi
    On asynchrony in name-passing calculi. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2004, v:14, n:5, pp:715-767 [Journal]
  59. Benjamin C. Pierce, Davide Sangiorgi
    Typing and Subtyping for Mobile Processes. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1996, v:6, n:5, pp:409-453 [Journal]
  60. Davide Sangiorgi
    On the Foundations of Final Coalgebra Semantics: Non-Well-Founded Sets, Partial Orders, Metric Spaces. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1998, v:8, n:5, pp:447-480 [Journal]
  61. Davide Sangiorgi
    From lambda to pi; or, Rediscovering continuations. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1999, v:9, n:4, pp:367-401 [Journal]
  62. Paola Giannini, Davide Sangiorgi, Andrea Valente
    Safe Ambients: Abstract machine and distributed implementation. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2006, v:59, n:3, pp:209-249 [Journal]
  63. Josva Kleist, Davide Sangiorgi
    Imperative objects as mobile processes. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2002, v:44, n:3, pp:293-342 [Journal]
  64. Davide Sangiorgi
    Review: Communicating and Mobile Systems: the -calculus, - Robin Milner, Cambridge University Press, Cambridge, 1999, 174 pages, ISBN 0-521-64320-1. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2000, v:38, n:1-3, pp:151-153 [Journal]
  65. Davide Sangiorgi
    Typed pi-calculus at Work: A Correctness Proof of Jones's Parallelisation Transformation on Concurrent Objects. [Citation Graph (0, 0)][DBLP]
    TAPOS, 1999, v:5, n:1, pp:25-33 [Journal]
  66. Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi
    On Bisimulations for the Asynchronous pi-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:195, n:2, pp:291-324 [Journal]
  67. Michele Boreale, Davide Sangiorgi
    Some Congruence Properties for Pi-Calculus Bisimilarities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:198, n:1-2, pp:159-176 [Journal]
  68. 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]
  69. Yuxin Deng, Davide Sangiorgi
    Towards an algebraic theory of typed mobile processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:2-3, pp:188-212 [Journal]
  70. Emanuela Fachini, Andrea Maggiolo-Schettini, Giovanni Resta, Davide Sangiorgi
    Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:2, pp:249-260 [Journal]
  71. Davide Sangiorgi
    Asynchronous process calculi: the first- and higher-order paradigms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:253, n:2, pp:311-350 [Journal]
  72. Davide Sangiorgi
    Locality and Interleaving Semantics in Calculi for Mobile Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:1, pp:39-83 [Journal]
  73. Davide Sangiorgi
    pi-Calculus, Internal Mobility, and Agent-Passing Calculi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:167, n:1&2, pp:235-274 [Journal]
  74. Davide Sangiorgi
    The Name Discipline of Uniform Receptiveness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:457-493 [Journal]
  75. Davide Sangiorgi, Robert de Simone
    Ninth International Conference on Concurrency Theory 1998 - Editorial. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:274, n:1-2, pp:1- [Journal]
  76. Francesca Levi, Davide Sangiorgi
    Mobile safe ambients. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2003, v:25, n:1, pp:1-69 [Journal]
  77. Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
    Environmental Bisimulations for Higher-Order Languages. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:293-302 [Conf]
  78. Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
    Logical Bisimulations and Functional Languages. [Citation Graph (0, 0)][DBLP]
    FSEN, 2007, pp:364-379 [Conf]
  79. 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]

  80. Lazy functions and mobile processes. [Citation Graph (, )][DBLP]


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


  82. A Hybrid Type System for Lock-Freedom of Mobile Processes. [Citation Graph (, )][DBLP]


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


  84. On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi. [Citation Graph (, )][DBLP]


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


  86. On the Expressiveness and Decidability of Higher-Order Process Calculi. [Citation Graph (, )][DBLP]


  87. Type Systems for Bigraphs. [Citation Graph (, )][DBLP]


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


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


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


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


Search in 0.007secs, Finished in 0.011secs
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