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