Davide Sangiorgi - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

On the expressiveness and decidability of higher-order process calculiIvan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt. iandc, 209(2):198-226, 2011. [doi]

Ownership Types for the Join CalculusMarco Patrignani, Dave Clarke, Davide Sangiorgi. forte 2011: 289-303 [doi]

Environmental bisimulations for higher-order languagesDavide Sangiorgi, Naoki Kobayashi, Eijiro Sumii. TOPLAS, 33(1):5, 2011. [doi]

2010

Functions as Processes: Termination and the lm[(m)/tilde]/lambda/mu/widetilde{/mu}-CalculusMatteo Cimini, Claudio Sacerdoti Coen, Davide Sangiorgi. tgc 2010: 73-86 [doi]

Termination in higher-order concurrent calculiRomain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. jlp, 79(7):550-577, 2010. [doi]

Termination in Impure Concurrent LanguagesRomain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. concur 2010: 328-342 [doi]

A hybrid type system for lock-freedom of mobile processesNaoki Kobayashi, Davide Sangiorgi. TOPLAS, 32(5), 2010. [doi]

On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process CalculiIvan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt. icalp 2010: 442-453 [doi]

An operational semantics for a calculus for wireless systemsIvan Lanese, Davide Sangiorgi. TCS, 411(19):1928-1948, 2010. [doi]

A Model of Evolvable ComponentsFabrizio Montesi, Davide Sangiorgi. tgc 2010: 153-171 [doi]

2009

Termination in Higher-Order Concurrent CalculiRomain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. fsen 2010: 81-96 [doi]

Mobile Processes and TerminationRomain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. BIRTHDAY 2009: 250-273 [doi]

On the origins of bisimulation and coinductionDavide Sangiorgi. TOPLAS, 31(4), 2009. [doi]

2008

2007

2006

SCC: A Service Centered CalculusMichele 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. wsfm 2006: 38-57 [doi]

Ensuring termination by typabilityYuxin Deng, Davide Sangiorgi. iandc, 204(7):1045-1082, 2006. [doi]

Towards an algebraic theory of typed mobile processesYuxin Deng, Davide Sangiorgi. TCS, 350(2-3):188-212, 2006. [doi]

Safe Ambients: Abstract machine and distributed implementationPaola Giannini, Davide Sangiorgi, Andrea Valente. SCP, 59(3):209-249, 2006. [doi]

On the Expressiveness of the Ambient LogicDaniel Hirschkoff, Étienne Lozes, Davide Sangiorgi. lmcs, 2(2), 2006. [doi]

Towards a Calculus For Wireless SystemsNicola Mezzetti, Davide Sangiorgi. ENTCS, 158:331-353, 2006. [doi]

Bisimulation and Co-induction: Some ProblemsDavide Sangiorgi. ENTCS, 162:311-315, 2006. [doi]

Termination of processesDavide Sangiorgi. mscs, 16(1):1-39, 2006. [doi]

The Bisimulation Proof Method: Enhancements and Open ProblemsDavide Sangiorgi. fmoods 2006: 18-19 [doi]

2005

On the representation of McCarthy s amb in the Pi-calculusArnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi. TCS, 330(3):439-473, 2005. [doi]

A Correct Abstract Machine for Safe AmbientsDaniel Hirschkoff, Damien Pous, Davide Sangiorgi. coordination 2005: 17-32 [doi]

Trustworthy Global Computing, International Symposium, TGC 2005, Edinburgh, UK, April 7-9, 2005, Revised Selected PapersRocco De Nicola, Davide Sangiorgi, editors, Volume 3705 of Lecture Notes in Computer Science, Springer, 2005.

Types in concurrencyRocco De Nicola, Davide Sangiorgi. ACTA, 42(2-3):79-81, 2005. [doi]

Beyond Bisimulation: The up-to TechniquesDavide Sangiorgi. FMCO 2006: 161-171 [doi]

2004

2003

Minimality Results for the Spatial LogicsDaniel Hirschkoff, Étienne Lozes, Davide Sangiorgi. fsttcs 2003: 252-264 [doi]

Mobile safe ambientsFrancesca Levi, Davide Sangiorgi. TOPLAS, 25(1):1-69, 2003. [doi]

Taming Mobile Processes Using TypesDavide Sangiorgi. sefm 2003: 64 [doi]

2002

2001

A Partition Refinement Algorithm for the -CalculusMarco Pistore, Davide Sangiorgi. iandc, 164(2):264-321, 2001.

Asynchronous process calculi: the first- and higher-order paradigmsDavide Sangiorgi. TCS, 253(2):311-350, 2001. [doi]

On Barbed Equivalences in pi-CalculusDavide Sangiorgi, David Walker. concur 2001: 292-304 [doi]

The Pi-Calculus - a theory of mobile processesDavide Sangiorgi, David Walker. Cambridge University Press, 2001.

A Distributed Abstract Machine for Safe AmbientsDavide Sangiorgi, Andrea Valente. icalp 2001: 408-420 [doi]

Extensionality and Intensionality of the Ambient LogicsDavide Sangiorgi. POPL 2001: 4-13

2000

Controlling Interference in AmbientsFrancesca Levi, Davide Sangiorgi. POPL 2000: 352-364 [doi]

Behavioral equivalence in the polymorphic pi-calculusBenjamin C. Pierce, Davide Sangiorgi. JACM, 47(3):531-584, 2000. [doi]

Lazy functions and mobile processesDavide Sangiorgi. BIRTHDAY 2000: 691-720

Review: Communicating and Mobile Systems: the -calculus, - Robin Milner, Cambridge University Press, Cambridge, 1999, 174 pages, ISBN 0-521-64320-1Davide Sangiorgi. SCP, 38(1-3):151-153, 2000.

1999

A pi-calculus Process Semantics of Concurrent Idealised ALGOLChristine Röckl, Davide Sangiorgi. fossacs 1999: 306-321

From lambda to pi; or, Rediscovering continuationsDavide Sangiorgi. mscs, 9(4):367-401, 1999.

The Name Discipline of Uniform ReceptivenessDavide Sangiorgi. TCS, 221(1-2):457-493, 1999. [doi]

Typed pi-calculus at Work: A Correctness Proof of Jones s Parallelisation Transformation on Concurrent ObjectsDavide Sangiorgi. tapos, 5(1):25-33, 1999.

Reasoning About Concurrent Systems Using TypesDavide Sangiorgi. fossacs 1999: 31-40

1998

On Bisimulations for the Asynchronous pi-CalculusRoberto M. Amadio, Ilaria Castellani, Davide Sangiorgi. TCS, 195(2):291-324, 1998. [doi]

Bisimulation in Name-Passing Calculi without MatchingMichele Boreale, Davide Sangiorgi. lics 1998: 165-175

Some Congruence Properties for Pi-Calculus BisimilaritiesMichele Boreale, Davide Sangiorgi. TCS, 198(1-2):159-176, 1998. [doi]

A Fully Abstract Semantics for Causality in the /pi-CalculusMichele Boreale, Davide Sangiorgi. ACTA, 35(5):353-400, 1998. [doi]

Imperative objects and mobile processesJosva Kleist, Davide Sangiorgi. procomet 1998: 285-303

On Asynchrony in Name-Passing CalculiMassimo Merro, Davide Sangiorgi. icalp 1998: 856-867 [doi]

CONCUR 98: Concurrency Theory, 9th International Conference, Nice, France, September 8-11, 1998, ProceedingsDavide Sangiorgi, Robert de Simone, editors, Volume 1466 of Lecture Notes in Computer Science, Springer, 1998.

On the Foundations of Final Coalgebra Semantics: Non-Well-Founded Sets, Partial Orders, Metric SpacesDavide Sangiorgi. mscs, 8(5):447-480, 1998.

An Interpretation of Typed Objects into Typed pi-CalculusDavide Sangiorgi. iandc, 143(1):34-73, 1998.

1997

Behavioral Equivalence in the Polymorphic Pi-calculusBenjamin C. Pierce, Davide Sangiorgi. POPL 1997: 242-255 [doi]

The Name Discipline of Uniform Receptiveness (Extended Abstract)Davide Sangiorgi. icalp 1997: 303-313

1996

On Bisimulations for the Asynchronous pi-CalculusRoberto M. Amadio, Ilaria Castellani, Davide Sangiorgi. concur 1996: 147-162

A Fully-Abstract Model for the pi-Calculus (Extended Abstract)Marcelo P. Fiore, Eugenio Moggi, Davide Sangiorgi. lics 1996: 43-54

Typing and Subtyping for Mobile ProcessesBenjamin C. Pierce, Davide Sangiorgi. mscs, 6(5):409-453, 1996.

A Partition Refinement Algorithm for the ::::pi::::-Calculus (Extended Abstract)Marco Pistore, Davide Sangiorgi. cav 1996: 38-49

A Theory of Bisimulation for the pi-CalculusDavide Sangiorgi. ACTA, 33(1):69-97, 1996.

pi-Calculus, Internal Mobility, and Agent-Passing CalculiDavide Sangiorgi. TCS, 167(1&2):235-274, 1996. [doi]

Bisimulation for Higher-Order Process CalculiDavide Sangiorgi. iandc, 131(2):141-178, 1996.

Locality and Interleaving Semantics in Calculi for Mobile ProcessesDavide Sangiorgi. TCS, 155(1):39-83, 1996. [doi]

1995

A Fully Abstract Semantics for Causality in the Pi-CalculusMichele Boreale, Davide Sangiorgi. STACS 1995: 243-254

Algebraic Theories for Name-Passing CalculiJoachim Parrow, Davide Sangiorgi. iandc, 120(2):174-197, August 1995.

Internal Mobility and Agent-Passing CalculiDavide Sangiorgi. icalp 1995: 672-683

On the Proof Method for Bisimulation (Extended Abstract)Davide Sangiorgi. mfcs 1995: 479-488

Pi-I: A Symmetric Calculus Based on Internal MobilityDavide Sangiorgi. tapsoft 1995: 172-186

1994

Locality and True-concurrency in Calculi for Mobile ProcessesDavide Sangiorgi. tacs 1994: 405-424

Bisimulation in Higher-Order Process CalculiDavide Sangiorgi. procomet 1994: 207-224

The Lazy Lambda Calculus in a Concurrency ScenarioDavide Sangiorgi. iandc, 111(1):120-153, May 1994.

1993

Algebraic Theories for Name-Passing CalculiJoachim Parrow, Davide Sangiorgi. rex 1994: 509-529

Typing and Subtyping for Mobile ProcessesBenjamin C. Pierce, Davide Sangiorgi. lics 1993: 376-385

From pi-Calculus to Higher-Order pi-Calculus - and BackDavide Sangiorgi. tapsoft 1993: 151-166

A Theory of Bisimulation for the pi-CalculusDavide Sangiorgi. concur 1993: 127-142

An Investigation into Functions as ProcessesDavide Sangiorgi. mfps 1994: 143-159

1992

Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis AutomataEmanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi. ACTA, 29(6/7):623-643, 1992.

Barbed BisimulationRobin Milner, Davide Sangiorgi. icalp 1992: 685-695

The Problem of Weak Bisimulation up to Davide Sangiorgi, Robin Milner. concur 1992: 32-46

The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract)Davide Sangiorgi. lics 1992: 102-109

PreviousNext