default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavide Sangiorgi
Person information
- affiliation: University of Bologna, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c95]Davide Sangiorgi:
An Abstract Account of Up-to Techniques for Inductive Behavioural Relations. ISoLA (1) 2024: 62-74- [i10]Ken Sakayori, Davide Sangiorgi:
Extensional and Non-extensional Functions as Processes. CoRR abs/2405.03536 (2024) - 2023
- [c94]Davide Sangiorgi:
Enhanced Induction in Behavioural Relations (Invited Talk). CSL 2023: 4:1-4:6 - [c93]Ken Sakayori
, Davide Sangiorgi:
Extensional and Non-extensional Functions as Processes. LICS 2023: 1-13 - [c92]Ilaria Castellani, Ornela Dardha, Luca Padovani, Davide Sangiorgi:
EXPRESSing Session Types. EXPRESS/SOS 2023: 8-25 - 2022
- [j58]Luca Aceto, Orna Kupferman, Mickael Randour, Davide Sangiorgi:
Interviews with the 2022 CONCUR Test-of-Time Award Recipients. Bull. EATCS 138 (2022) - [j57]Davide Sangiorgi:
From enhanced coinduction towards enhanced induction. Proc. ACM Program. Lang. 6(POPL): 1-29 (2022) - [j56]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Eager functions as processes. Theor. Comput. Sci. 913: 8-42 (2022) - [c91]Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi:
CONCUR Test-Of-Time Award 2022 (Invited Paper). CONCUR 2022: 1:1-1:3 - [c90]Guilhem Jaber, Davide Sangiorgi:
Games, Mobile Processes, and Functions. CSL 2022: 25:1-25:18 - [c89]Ornela Dardha, Elena Giachino, Davide Sangiorgi:
Session Types Revisited: A Decade Later. PPDP 2022: 12:1-12:4 - [i9]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Eager Functions as Processes (long version). CoRR abs/2202.03187 (2022) - 2021
- [j55]Jean-Marie Madiot, Damien Pous, Davide Sangiorgi:
Modular coinduction up-to for higher-order languages via first-order transition systems. Log. Methods Comput. Sci. 17(3) (2021) - [c88]Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi:
On sequentiality and well-bracketing in the π-calculus. LICS 2021: 1-13 - [i8]Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi:
On sequentiality and well-bracketing in the π-calculus. CoRR abs/2104.10942 (2021) - [i7]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Eager Functions as Processes. CoRR abs/2112.02863 (2021) - 2020
- [j54]Chun Tian, Davide Sangiorgi:
Unique solutions of contractions, CCS, and their HOL formalisation. Inf. Comput. 275: 104606 (2020) - [j53]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Towards 'up to context' reasoning about higher-order processes. Theor. Comput. Sci. 807: 154-168 (2020) - [c87]Saverio Giallorenzo, Ivan Lanese, Fabrizio Montesi, Davide Sangiorgi, Stefano Pio Zingaro:
The Servers of Serverless Computing: A Formal Revisitation of Functions as a Service. Gabbrielli's Festschrift 2020: 5:1-5:21 - [c86]Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi:
On the Representation of References in the Pi-Calculus. CONCUR 2020: 34:1-34:20 - [i6]Jean-Marie Madiot, Damien Pous, Davide Sangiorgi:
Modular coinduction up-to for higher-order languages via first-order transition systems. CoRR abs/2001.07063 (2020)
2010 – 2019
- 2019
- [j52]Damien Pous, Davide Sangiorgi:
Bisimulation and Coinduction Enhancements: A Historical Perspective. Formal Aspects Comput. 31(6): 733-749 (2019) - [j51]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Divergence and unique solution of equations. Log. Methods Comput. Sci. 15(3) (2019) - [j50]Davide Sangiorgi, Valeria Vignudelli:
Environmental Bisimulations for Probabilistic Higher-order Languages. ACM Trans. Program. Lang. Syst. 41(4): 22:1-22:64 (2019) - [c85]Davide Sangiorgi:
Asynchronous \pi -calculus at Work: The Call-by-Need Strategy. The Art of Modelling Computational Systems 2019: 33-49 - [c84]Ivan Lanese, Davide Sangiorgi, Gianluigi Zavattaro:
Playing with Bisimulation in Erlang. Models, Languages, and Tools for Concurrent and Distributed Programming 2019: 71-91 - [c83]Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi:
Modeling Imperative Constructs in the Pi-Calculus. ICTCS 2019: 136-138 - 2018
- [j49]Davide Sangiorgi, Xian Xu:
Trees from Functions as Processes. Log. Methods Comput. Sci. 14(3) (2018) - [c82]Davide Sangiorgi:
Bisimilarity Via Unique-Solution Techniques. ICTCS 2018: 7-11 - [c81]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Eager Functions as Processes. LICS 2018: 364-373 - [c80]Chun Tian, Davide Sangiorgi:
Unique Solutions of Contractions, CCS, and their HOL Formalisation. EXPRESS/SOS 2018: 122-139 - [i5]Davide Sangiorgi, Xian Xu:
Trees from Functions as Processes. CoRR abs/1804.05797 (2018) - [i4]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Divergence and unique solution of equations. CoRR abs/1806.11354 (2018) - 2017
- [j48]Ornela Dardha, Elena Giachino, Davide Sangiorgi:
Session types revisited. Inf. Comput. 256: 253-286 (2017) - [j47]Davide Sangiorgi:
Equations, Contractions, and Unique Solutions. ACM Trans. Comput. Log. 18(1): 4:1-4:30 (2017) - [c79]Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Divergence and Unique Solution of Equations. CONCUR 2017: 11:1-11:16 - 2016
- [j46]Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Name-passing calculi: From fusions to preorders and types. Inf. Comput. 251: 335-360 (2016) - [j45]Ugo Dal Lago, Simone Martini, Davide Sangiorgi:
Light logics and higher-order processes. Math. Struct. Comput. Sci. 26(6): 969-992 (2016) - [c78]Davide Sangiorgi, Valeria Vignudelli:
Environmental bisimulations for probabilistic higher-order languages. POPL 2016: 595-607 - [e5]Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, Davide Sangiorgi:
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. LIPIcs 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-013-2 [contents] - 2015
- [j44]Ivan Lanese, Davide Sangiorgi:
Preface: Special issue on objects and services. Math. Struct. Comput. Sci. 25(3): 480-481 (2015) - [c77]Raphaëlle Crubillé, Ugo Dal Lago, Davide Sangiorgi, Valeria Vignudelli:
On Applicative Similarity, Sequentiality, and Full Abstraction. Correct System Design 2015: 65-82 - [c76]Davide Sangiorgi:
The Proof Technique of Unique Solutions of Contractions. ICTAC 2015: 63-68 - [c75]Davide Sangiorgi:
Equations, Contractions, and Unique Solutions. POPL 2015: 421-432 - 2014
- [c74]Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Symmetries and Dualities in Name-Passing Process Calculi. Computing with New Resources 2014: 307-322 - [c73]Davide Sangiorgi:
Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract). CMCS 2014: 3-9 - [c72]Davide Sangiorgi, Xian Xu:
Trees from Functions as Processes. CONCUR 2014: 78-92 - [c71]Jean-Marie Madiot, Damien Pous, Davide Sangiorgi:
Bisimulations Up-to: Beyond First-Order Transition Systems. CONCUR 2014: 93-108 - [c70]Marco Bernardo, Davide Sangiorgi, Valeria Vignudelli:
On the discriminating power of passivation and higher-order interaction. CSL-LICS 2014: 14:1-14:10 - [c69]Ugo Dal Lago, Davide Sangiorgi, Michele Alberti:
On coinductive equivalences for higher-order probabilistic functional programs. POPL 2014: 297-308 - [c68]Marco Bernardo, Davide Sangiorgi, Valeria Vignudelli:
On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems. QEST 2014: 281-296 - [e4]Josep Díaz, Ivan Lanese, Davide Sangiorgi:
Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings. Lecture Notes in Computer Science 8705, Springer 2014, ISBN 978-3-662-44601-0 [contents] - [r2]Jos C. M. Baeten, Davide Sangiorgi:
Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi. Computational Logic 2014: 399-442 - 2013
- [c67]Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Name-Passing Calculi: From Fusions to Preorders and Types. LICS 2013: 378-387 - [i3]Ugo Dal Lago, Davide Sangiorgi, Michele Alberti:
On Coinductive Equivalences for Higher-Order Probabilistic Functional Programs (Long Version). CoRR abs/1311.1722 (2013) - 2012
- [j43]Davide Sangiorgi:
Concurrency theory: timed automata, testing, program synthesis. Distributed Comput. 25(1): 3-4 (2012) - [c66]Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Duality and i/o-Types in the π-Calculus. CONCUR 2012: 302-316 - [c65]Michael Lienhardt, Mario Bravetti, Davide Sangiorgi:
An Object Group-Based Component Model. ISoLA (1) 2012: 64-78 - [c64]Ornela Dardha, Elena Giachino, Davide Sangiorgi:
Session types revisited. PPDP 2012: 139-150 - [p3]Davide Sangiorgi:
Origins of bisimulation and coinduction. Advanced Topics in Bisimulation and Coinduction 2012: 1-37 - [p2]Damien Pous, Davide Sangiorgi:
Enhancements of the bisimulation proof method. Advanced Topics in Bisimulation and Coinduction 2012: 233-289 - [e3]Davide Sangiorgi, Jan J. M. M. Rutten:
Advanced Topics in Bisimulation and Coinduction. Cambridge tracts in theoretical computer science 52, Cambridge University Press 2012, ISBN 978-1-10-700497-9 [contents] - 2011
- [j42]Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt:
On the expressiveness and decidability of higher-order process calculi. Inf. Comput. 209(2): 198-226 (2011) - [j41]Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii:
Environmental bisimulations for higher-order languages. ACM Trans. Program. Lang. Syst. 33(1): 5:1-5:69 (2011) - [c63]Reiner Hähnle, Michiel Helvensteijn, Einar Broch Johnsen, Michael Lienhardt, Davide Sangiorgi, Ina Schaefer, Peter Y. H. Wong:
HATS Abstract Behavioral Specification: The Architectural View. FMCO 2011: 109-132 - [c62]Marco Patrignani, Dave Clarke, Davide Sangiorgi:
Ownership Types for the Join Calculus. FMOODS/FORTE 2011: 289-303 - [c61]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Strong Normalisation in λ-Calculi with References. FSEN 2011: 128-142 - [p1]Massimo Bartoletti, Luís Caires, Ivan Lanese, Franco Mazzanti, Davide Sangiorgi, Hugo Torres Vieira, Roberto Zunino:
Tools and Verification. Results of the SENSORIA Project 2011: 408-427 - [r1]Davide Sangiorgi:
Pi-Calculus. Encyclopedia of Parallel Computing 2011: 1554-1562 - 2010
- [j40]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Termination in higher-order concurrent calculi. J. Log. Algebraic Methods Program. 79(7): 550-577 (2010) - [j39]Ivan Lanese, Davide Sangiorgi:
An operational semantics for a calculus for wireless systems. Theor. Comput. Sci. 411(19): 1928-1948 (2010) - [j38]Naoki Kobayashi, Davide Sangiorgi:
A hybrid type system for lock-freedom of mobile processes. ACM Trans. Program. Lang. Syst. 32(5): 16:1-16:49 (2010) - [c60]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Termination in Impure Concurrent Languages. CONCUR 2010: 328-342 - [c59]Michael Lienhardt, Ivan Lanese, Mario Bravetti, Davide Sangiorgi, Gianluigi Zavattaro, Yannick Welsch, Jan Schäfer, Arnd Poetzsch-Heffter:
A Component Model for the ABS Language. FMCO 2010: 165-183 - [c58]Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt:
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi. ICALP (2) 2010: 442-453 - [c57]Matteo Cimini, Claudio Sacerdoti Coen, Davide Sangiorgi:
Functions as Processes: Termination and the lm[(m)\tilde]\lambda\mu\widetilde{\mu}-Calculus. TGC 2010: 73-86 - [c56]Fabrizio Montesi, Davide Sangiorgi:
A Model of Evolvable Components. TGC 2010: 153-171 - [c55]Ugo Dal Lago, Simone Martini, Davide Sangiorgi:
Light Logics and Higher-Order Processes. EXPRESS 2010: 46-60
2000 – 2009
- 2009
- [j37]Davide Sangiorgi:
On the origins of bisimulation and coinduction. ACM Trans. Program. Lang. Syst. 31(4): 15:1-15:41 (2009) - [c54]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Mobile Processes and Termination. Semantics and Algebraic Specification 2009: 250-273 - [c53]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Termination in Higher-Order Concurrent Calculi. FSEN 2009: 81-96 - [c52]Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt:
On the Expressiveness of Polyadicity in Higher-Order Process Calculi. ICTCS 2009: 143-149 - 2008
- [j36]Étienne Lozes, Daniel Hirschkoff, Davide Sangiorgi:
Separability in the Ambient Logic. Log. Methods Comput. Sci. 4(3) (2008) - [c51]Naoki Kobayashi, Davide Sangiorgi:
A Hybrid Type System for Lock-Freedom of Mobile Processes. CAV 2008: 80-93 - [c50]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Static and dynamic typing for the termination of mobile processes. IFIP TCS 2008: 413-427 - [c49]Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt:
On the Expressiveness and Decidability of Higher-Order Process Calculi. LICS 2008: 145-155 - [c48]Ebbe Elsborg, Thomas T. Hildebrandt, Davide Sangiorgi:
Type Systems for Bigraphs. TGC 2008: 126-140 - [i2]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Separability in the Ambient Logic. CoRR abs/0806.3849 (2008) - 2007
- [j35]Daniel Hirschkoff, Damien Pous, Davide Sangiorgi:
An efficient abstract machine for Safe Ambients. J. Log. Algebraic Methods Program. 71(2): 114-149 (2007) - [c47]Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii:
Logical Bisimulations and Functional Languages. FSEN 2007: 364-379 - [c46]Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii:
Environmental Bisimulations for Higher-Order Languages. LICS 2007: 293-302 - [c45]Romain Demangeon, Daniel Hirschkoff, Naoki Kobayashi, Davide Sangiorgi:
On the Complexity of Termination Inference for Processes. TGC 2007: 140-155 - 2006
- [j34]Yuxin Deng, Davide Sangiorgi:
Ensuring termination by typability. Inf. Comput. 204(7): 1045-1082 (2006) - [j33]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
On the Expressiveness of the Ambient Logic. Log. Methods Comput. Sci. 2(2) (2006) - [j32]Davide Sangiorgi:
Termination of processes. Math. Struct. Comput. Sci. 16(1): 1-39 (2006) - [j31]Paola Giannini, Davide Sangiorgi, Andrea Valente:
Safe Ambients: Abstract machine and distributed implementation. Sci. Comput. Program. 59(3): 209-249 (2006) - [j30]Yuxin Deng, Davide Sangiorgi:
Towards an algebraic theory of typed mobile processes. Theor. Comput. Sci. 350(2-3): 188-212 (2006) - [c44]Davide Sangiorgi:
The Bisimulation Proof Method: Enhancements and Open Problems. FMOODS 2006: 18-19 - [c43]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 - [c42]Nicola Mezzetti, Davide Sangiorgi:
Towards a Calculus For Wireless Systems. MFPS 2006: 331-353 - 2005
- [j29]Rocco De Nicola, Davide Sangiorgi:
Types in concurrency. Acta Informatica 42(2-3): 79-81 (2005) - [j28]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) - [c41]Daniel Hirschkoff, Damien Pous, Davide Sangiorgi:
A Correct Abstract Machine for Safe Ambients. COORDINATION 2005: 17-32 - [c40]Davide Sangiorgi:
Beyond Bisimulation: The "up-to" Techniques. FMCO 2005: 161-171 - [c39]Davide Sangiorgi:
Bisimulation and Co-induction: Some Problems. APC 25 2005: 311-315 - [e2]Rocco De Nicola, Davide Sangiorgi:
Trustworthy Global Computing, International Symposium, TGC 2005, Edinburgh, UK, April 7-9, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3705, Springer 2005, ISBN 3-540-30007-4 [contents] - [i1]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
On the Expressiveness of the Ambient Logic. CoRR abs/cs/0510010 (2005) - 2004
- [j27]Massimo Merro, Davide Sangiorgi:
On asynchrony in name-passing calculi. Math. Struct. Comput. Sci. 14(5): 715-767 (2004) - [c38]Yuxin Deng, Davide Sangiorgi:
Towards an Algebraic Theory of Typed Mobile Processes. ICALP 2004: 445-456 - [c37]Yuxin Deng, Davide Sangiorgi:
Ensuring Termination by Typability. IFIP TCS 2004: 619-632 - [c36]Davide Sangiorgi:
Bisimulation: From The Origins to Today. LICS 2004: 298-302 - 2003
- [j26]Francesca Levi, Davide Sangiorgi:
Mobile safe ambients. ACM Trans. Program. Lang. Syst. 25(1): 1-69 (2003) - [c35]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Minimality Results for the Spatial Logics. FSTTCS 2003: 252-264 - [c34]Davide Sangiorgi:
Taming Mobile Processes Using Types. SEFM 2003: 64- - [c33]Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi:
On the Representation of McCarthy's amb in the π-calculus. EXPRESS 2003: 73-89 - 2002
- [j25]Marcelo P. Fiore, Eugenio Moggi, Davide Sangiorgi:
A Fully Abstract Model for the [pi]-calculus. Inf. Comput. 179(1): 76-117 (2002) - [j24]Josva Kleist, Davide Sangiorgi:
Imperative objects as mobile processes. Sci. Comput. Program. 44(3): 293-342 (2002) - [j23]Davide Sangiorgi, Robert de Simone:
Ninth International Conference on Concurrency Theory 1998 - Editorial. Theor. Comput. Sci. 274(1-2): 1 (2002) - [c32]Davide Sangiorgi:
Types, or: Where's the Difference Between CCS and pi? CONCUR 2002: 76-97 - [c31]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Separability, Expressiveness, and Decidability in the Ambient Logic. LICS 2002: 423-432 - 2001
- [b2]Davide Sangiorgi, David Walker:
The Pi-Calculus - a theory of mobile processes. Cambridge University Press 2001, ISBN 978-0-521-78177-0, pp. I-XII, 1-580 - [j22]Marco Pistore, Davide Sangiorgi:
A Partition Refinement Algorithm for the -Calculus. Inf. Comput. 164(2): 264-321 (2001) - [j21]Davide Sangiorgi:
Asynchronous process calculi: the first- and higher-order paradigms. Theor. Comput. Sci. 253(2): 311-350 (2001) - [c30]Davide Sangiorgi, David Walker:
On Barbed Equivalences in pi-Calculus. CONCUR 2001: 292-304 - [c29]Davide Sangiorgi, Andrea Valente:
A Distributed Abstract Machine for Safe Ambients. ICALP 2001: 408-420 - [c28]Davide Sangiorgi:
Extensionality and Intensionality of the Ambient Logics. POPL 2001: 4-13 - 2000
- [j20]Benjamin C. Pierce, Davide Sangiorgi:
Behavioral equivalence in the polymorphic pi-calculus. J. ACM 47(3): 531-584 (2000) - [j19]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) - [c27]Davide Sangiorgi:
Lazy functions and mobile processes. Proof, Language, and Interaction 2000: 691-720 - [c26]Francesca Levi, Davide Sangiorgi:
Controlling Interference in Ambients. POPL 2000: 352-364
1990 – 1999
- 1999
- [j18]Davide Sangiorgi:
From lambda to pi; or, Rediscovering continuations. Math. Struct. Comput. Sci. 9(4): 367-401 (1999) - [j17]Davide Sangiorgi:
Typed pi-calculus at Work: A Correctness Proof of Jones's Parallelisation Transformation on Concurrent Objects. Theory Pract. Object Syst. 5(1): 25-33 (1999) - [j16]Davide Sangiorgi:
The Name Discipline of Uniform Receptiveness. Theor. Comput. Sci. 221(1-2): 457-493 (1999) - [c25]Davide Sangiorgi:
Reasoning About Concurrent Systems Using Types. FoSSaCS 1999: 31-40 - [c24]Christine Röckl, Davide Sangiorgi:
A pi-calculus Process Semantics of Concurrent Idealised ALGOL. FoSSaCS 1999: 306-321 - 1998
- [j15]Michele Boreale, Davide Sangiorgi:
A Fully Abstract Semantics for Causality in the \pi-Calculus. Acta Informatica 35(5): 353-400 (1998) - [j14]Davide Sangiorgi:
An Interpretation of Typed Objects into Typed pi-Calculus. Inf. Comput. 143(1): 34-73 (1998) - [j13]Davide Sangiorgi:
On the Foundations of Final Coalgebra Semantics: Non-Well-Founded Sets, Partial Orders, Metric Spaces. Math. Struct. Comput. Sci. 8(5): 447-480 (1998) - [j12]Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi:
On Bisimulations for the Asynchronous pi-Calculus. Theor. Comput. Sci. 195(2): 291-324 (1998) - [j11]Michele Boreale, Davide Sangiorgi:
Some Congruence Properties for Pi-Calculus Bisimilarities. Theor. Comput. Sci. 198(1-2): 159-176 (1998) - [c23]Massimo Merro, Davide Sangiorgi:
On Asynchrony in Name-Passing Calculi. ICALP 1998: 856-867 - [c22]Michele Boreale, Davide Sangiorgi:
Bisimulation in Name-Passing Calculi without Matching. LICS 1998: 165-175 - [c21]Josva Kleist, Davide Sangiorgi:
Imperative objects and mobile processes. PROCOMET 1998: 285-303 - [e1]Davide Sangiorgi, Robert de Simone:
CONCUR '98: Concurrency Theory, 9th International Conference, Nice, France, September 8-11, 1998, Proceedings. Lecture Notes in Computer Science 1466, Springer 1998, ISBN 3-540-64896-8 [contents] - 1997
- [c20]Davide Sangiorgi:
The Name Discipline of Uniform Receptiveness (Extended Abstract). ICALP 1997: 303-313 - [c19]Benjamin C. Pierce, Davide Sangiorgi:
Behavioral Equivalence in the Polymorphic Pi-calculus. POPL 1997: 242-255 - 1996
- [j10]Davide Sangiorgi:
A Theory of Bisimulation for the pi-Calculus. Acta Informatica 33(1): 69-97 (1996) - [j9]Davide Sangiorgi:
Bisimulation for Higher-Order Process Calculi. Inf. Comput. 131(2): 141-178 (1996) - [j8]Benjamin C. Pierce, Davide Sangiorgi:
Typing and Subtyping for Mobile Processes. Math. Struct. Comput. Sci. 6(5): 409-453 (1996) - [j7]Davide Sangiorgi:
Locality and Interleaving Semantics in Calculi for Mobile Processes. Theor. Comput. Sci. 155(1): 39-83 (1996) - [j6]Davide Sangiorgi:
pi-Calculus, Internal Mobility, and Agent-Passing Calculi. Theor. Comput. Sci. 167(1&2): 235-274 (1996) - [c18]Marco Pistore, Davide Sangiorgi:
A Partition Refinement Algorithm for the pi-Calculus (Extended Abstract). CAV 1996: 38-49 - [c17]Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi:
On Bisimulations for the Asynchronous pi-Calculus. CONCUR 1996: 147-162 - [c16]Marcelo P. Fiore, Eugenio Moggi, Davide Sangiorgi:
A Fully-Abstract Model for the pi-Calculus (Extended Abstract). LICS 1996: 43-54 - 1995
- [j5]Joachim Parrow, Davide Sangiorgi:
Algebraic Theories for Name-Passing Calculi. Inf. Comput. 120(2): 174-197 (1995) - [c15]Davide Sangiorgi:
Internal Mobility and Agent-Passing Calculi. ICALP 1995: 672-683 - [c14]Davide Sangiorgi:
On the Proof Method for Bisimulation (Extended Abstract). MFCS 1995: 479-488 - [c13]Michele Boreale, Davide Sangiorgi:
A Fully Abstract Semantics for Causality in the Pi-Calculus. STACS 1995: 243-254 - [c12]Davide Sangiorgi:
Pi-I: A Symmetric Calculus Based on Internal Mobility. TAPSOFT 1995: 172-186 - 1994
- [j4]Davide Sangiorgi:
The Lazy Lambda Calculus in a Concurrency Scenario. Inf. Comput. 111(1): 120-153 (1994) - [c11]Davide Sangiorgi:
Bisimulation in Higher-Order Process Calculi. PROCOMET 1994: 207-224 - [c10]Davide Sangiorgi:
Locality and True-concurrency in Calculi for Mobile Processes. TACS 1994: 405-424 - 1993
- [b1]Davide Sangiorgi:
Expressing mobility in process algebras : first-order and higher-order paradigms. University of Edinburgh, UK, 1993 - [c9]Davide Sangiorgi:
A Theory of Bisimulation for the pi-Calculus. CONCUR 1993: 127-142 - [c8]Benjamin C. Pierce, Davide Sangiorgi:
Typing and Subtyping for Mobile Processes. LICS 1993: 376-385 - [c7]Davide Sangiorgi:
An Investigation into Functions as Processes. MFPS 1993: 143-159 - [c6]Joachim Parrow, Davide Sangiorgi:
Algebraic Theories for Name-Passing Calculi. REX School/Symposium 1993: 509-529 - [c5]Davide Sangiorgi:
From pi-Calculus to Higher-Order pi-Calculus - and Back. TAPSOFT 1993: 151-166 - 1992
- [j3]Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi:
Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata. Acta Informatica 29(6/7): 623-643 (1992) - [c4]Davide Sangiorgi, Robin Milner:
The Problem of "Weak Bisimulation up to". CONCUR 1992: 32-46 - [c3]Robin Milner, Davide Sangiorgi:
Barbed Bisimulation. ICALP 1992: 685-695 - [c2]Davide Sangiorgi:
The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract). LICS 1992: 102-109 - 1991
- [j2]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
- [j1]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) - [c1]Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi:
Comparisons Among Classes of Y-Tree Systolic Automata. MFCS 1990: 254-260
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
