Davide Sangiorgi

Q: What Schools Are Affiliated With Davide Sangiorgi

Davide Sangiorgi is affiliated with the following schools: University of Edinburgh, University of Genoa, University of Bologna

Davide Sangiorgi's AcademicInfluence.com Rankings

Davide Sangiorgi

Computer Science

#2284

World Rank

#2380

Historical Rank

Database

#3566

World Rank

#3716

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Davide Sangiorgi Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Davide Sangiorgi is an Italian professor of computer science at the University of Bologna. He has previously held research positions at the University of Edinburgh and at Inria. He has received his PhD from the University of Edinburgh under the supervision of Robin Milner in 1993. He has had visiting positions at Centrum Wiskunde & Informatica , University of Cambridge, University of Oxford.

(See a Problem?)

Davide Sangiorgi's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Communicating and Mobile Systems: the π-calculus, (2000) (1615)
The Pi-Calculus - a theory of mobile processes (2001) (1278)
Expressing mobility in process algebras : first-order and higher-order paradigms (1993) (609)
Typing and subtyping for mobile processes (1993) (543)
Barbed Bisimulation (1992) (503)
Introduction to Bisimulation and Coinduction (2011) (291)
On the bisimulation proof method (1998) (257)
Controlling interference in ambients (2000) (257)
On Bisimulations for the Asynchronous pi-Calculus (1996) (254)
On the origins of bisimulation and coinduction (2009) (205)
The Problem of "Weak Bisimulation up to" (1992) (191)
CONCUR'98 Concurrency Theory (1998) (180)
Bisimulation for Higher-Order Process Calculi (1994) (180)
pi-Calculus, Internal Mobility, and Agent-Passing Calculi (1996) (178)
SCC: A Service Centered Calculus (2006) (168)
Environmental Bisimulations for Higher-Order Languages (2007) (164)
The lazy lambda calculus in a concurrency scenario (1992) (144)
Session types revisited (2012) (137)
A theory of bisimulation for the π-calculus (1996) (135)
On asynchrony in name-passing calculi (1998) (130)
- calculus , internal mobility , and agent-passing calculi (1995) (130)
Mobile safe ambients (2003) (127)
A Theory of Bisimulation for the pi-Calculus (1993) (124)
Behavioral equivalence in the polymorphic pi-calculus (2000) (120)
The Name Discipline of Uniform Receptiveness (1999) (115)
A Fully Abstract Model for the [pi]-calculus (1996) (108)
Algebraic Theories for Name-Passing Calculi (1993) (105)
Towards a Calculus For Wireless Systems (2006) (91)
Enhancements of the bisimulation proof method (2012) (88)
Extensionality and intensionality of the ambient logics (2001) (86)
On the Expressiveness and Decidability of Higher-Order Process Calculi (2008) (83)
From pi-Calculus to Higher-Order pi-Calculus - and Back (1993) (81)
Locality and Interleaving Semantics in Calculi for Mobile Processes (1996) (74)
A fully abstract semantics for causality in the $\pi$-calculus (1998) (73)
An Interpretation of Typed Objects into Typed pi-Calculus (1998) (66)
An operational semantics for a calculus for wireless systems (2010) (66)
Lazy functions and mobile processes (2000) (63)
On coinductive equivalences for higher-order probabilistic functional programs (2013) (60)
Bisimulation in name-passing calculi without matching (1998) (55)
Ensuring termination by typability (2006) (55)
A Distributed Abstract Machine for Safe Ambients (2001) (54)
On Barbed Equivalences in pi-Calculus (2001) (53)
A hybrid type system for lock-freedom of mobile processes (2008) (51)
Imperative objects and mobile processes (1998) (48)
A Fully Abstract Semantics for Causality in the Pi-Calculus (1995) (47)
Separability, expressiveness, and decidability in the ambient logic (2002) (47)
From -calculus to Higher-order -calculus | and Back (2007) (45)
Termination of processes (2006) (45)
Asynchronous process calculi: the first- and higher-order paradigms (2001) (43)
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi (2010) (41)
Advanced Topics in Bisimulation and Coinduction: List of contributors (2011) (40)
Some Congruence Properties for Pi-Calculus Bisimilarities (1998) (39)
A Partition Refinement Algorithm for the -Calculus (2001) (36)
Particle Dynamics (2011) (35)
On the Representation of McCarthy's amb in the π-calculus (2004) (34)
On the Proof Method for Bisimulation (Extended Abstract) (1995) (34)
Internal Mobility and Agent-Passing Calculi (1995) (34)
Techniques of \ weak bisimulation up to " (1992) (32)
Typed pi-calculus at Work: A Correctness Proof of Jones's Parallelisation Transformation on Concurrent Objects (1999) (28)
Light logics and higher-order processes (2010) (28)
The Name Discipline of Uniform Receptiveness (Extended Abstract) (1997) (28)
Minimality Results for the Spatial Logics (2003) (27)
An Investigation into Functions as Processes (1993) (26)
Environmental bisimulations for probabilistic higher-order languages (2016) (25)
Particle Methods (2011) (25)
Bisimulation: from the origins to today (2004) (23)
Termination in Impure Concurrent Languages (2010) (23)
A Model of Evolvable Components (2010) (23)
Locality and True-concurrency in Calculi for Mobile Processes (1994) (22)
On the Expressiveness of the Ambient Logic (2005) (22)
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA (2008) (21)
Termination in higher-order concurrent calculi (2009) (21)
A fully-abstract model for the /spl pi/-calculus (1996) (21)
Bisimulations Up-to: Beyond First-Order Transition Systems (2014) (20)
HATS Abstract Behavioral Specification: The Architectural View (2011) (19)
Asynchronous process calculi: the first-order and higher-order paradigms (Tutorial) (1999) (19)
Towards an algebraic theory of typed mobile processes (2006) (19)
Behavioral equivalence in the polymorphic pi-calculus (1997) (18)
From λ to π; or, Rediscovering continuations (1999) (18)
Parallel Ocean Program (POP) (2011) (18)
A Partition Refinement Algorithm for the pi-Calculus (Extended Abstract) (1996) (17)
Mobile Processes and Termination (2009) (17)
Interpreting Functions as Pi-Calculus Processes: A Tutorial (1999) (16)
A Correct Abstract Machine for Safe Ambients (2005) (16)
Type Systems for Bigraphs (2009) (16)
On Applicative Similarity, Sequentiality, and Full Abstraction (2015) (16)
An efficient abstract machine for Safe Ambients (2007) (15)
Logical bisimulations and functional languages (2007) (15)
Safe Ambients: Abstract machine and distributed implementation (2006) (15)
A pi-calculus Process Semantics of Concurrent Idealised ALGOL (1999) (14)
On the Complexity of Termination Inference for Processes (2007) (13)
Eager Functions as Processes (2018) (12)
A Component Model for the ABS Language (2010) (12)
Pi-I: A Symmetric Calculus Based on Internal Mobility (1995) (12)
Ownership Types for the Join Calculus (2011) (12)
Types, or: Where's the Difference Between CCS and pi? (2002) (11)
Equations, Contractions, and Unique Solutions (2015) (11)
Functions as processes: termination and the λµµ-calculus (2010) (10)
On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems (2014) (10)
On the origins of Bisimulation, Coinduction, and Fixed Points (2007) (10)
Trees from Functions as Processes (2014) (9)
Duality and i/o-Types in the π-Calculus (2012) (9)
An Object Group-Based Component Model (2012) (9)
Imperative objects as mobile processes (2002) (9)
Name-Passing Calculi: From Fusions to Preorders and Types (2013) (8)
Divergence and Unique Solution of Equations (2017) (8)
On the discriminating power of passivation and higher-order interaction (2014) (7)
An Interpretation of Typed Objects into Typed -calculus an Interpretation of Typed Objects into Typed -calculus (1996) (7)
From lambda to pi; or, Rediscovering continuations (1999) (7)
Bisimulation and Coinduction Enhancements: A Historical Perspective (2019) (7)
Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata (1991) (7)
Separability in the Ambient Logic (2008) (6)
Comparisons Among Classes of Y-Tree Systolic Automata (1990) (5)
Tools and Verification (2011) (5)
Trustworthy Global Computing, International Symposium, TGC 2005, Edinburgh, UK, April 7-9, 2005, Revised Selected Papers (2005) (5)
On the Representation of References in the Pi-Calculus (2020) (5)
Playing with Bisimulation in Erlang (2019) (5)
Simulation of Systolic Tree Automata on Trellis Automata (1990) (5)
Theoretical Computer Science (2014) (5)
On the Foundations of Final Coalgebra Semantics: Non-Well-Founded Sets, Partial Orders, Metric Spaces (1998) (5)
Parallel I/O Library (PIO) (2011) (4)
The Bisimulation Proof Method: Enhancements and Open Problems (2006) (4)
Beyond Bisimulation: The "up-to" Techniques (2005) (4)
Static and dynamic typing for the termination of mobile processes (2008) (4)
Games, Mobile Processes, and Functions (2022) (3)
Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi (2014) (3)
A Partition Reenement Algorithm for the -calculus ? (1996) (3)
Reasoning About Concurrent Systems Using Types (1999) (3)
Functions as Processes: Termination and the lm[(m)\tilde]\lambda\mu\widetilde{\mu}-Calculus (2010) (3)
Concurrency theory: timed automata, testing, program synthesis (2012) (3)
A partition refinement algorithm for the π-calculus (1996) (2)
The Servers of Serverless Computing: A Formal Revisitation of Functions as a Service (2020) (2)
Origins of bisimulation and coinduction. (2011) (2)
Classes of systolic Y-tree automata and a comparison with systolic trellis automata (1992) (2)
Environmental Bisimulations for Probabilistic Higher-order Languages (2019) (2)
Parallel Random Access Machines (PRAM) (2011) (2)
Abstract games for in nite state processes (2018) (2)
Appendices to “ Environmental Bisimulations for Higher-Order Languages ” (2008) (2)
Introduction to Bisimulation and Coinduction: Coinduction and the duality with induction (2011) (2)
Beyond Bisimulation : The “ upto ” Techniques (2)
Eager Functions as Processes (long version) (2022) (1)
Bisimulation and Co-induction: Some Problems (2006) (1)
Introduction to Bisimulation and Coinduction: Preface (2011) (1)
Proceedings of the 9th International Conference on Concurrency Theory (1998) (1)
On the Expressiveness of Polyadicity in Higher-Order Process Calculi (2009) (1)
Program Graphs (2011) (1)
Towards 'up to context' reasoning about higher-order processes (2020) (1)
Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) (2014) (1)
A Method for Termination in a λ-calculus with References ( paper in preparation ) (2010) (1)
Subexponential time algorithms for embedding H-Minor free graphs (2016) (1)
Termination in impure lambda-calculus (2012) (1)
Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks (2018) (0)
Asynchronous \pi -calculus at Work: The Call-by-Need Strategy (2019) (0)
Enhanced Induction in Behavioural Relations (Invited Talk) (2023) (0)
2 Subexponential Time Algorithms for Embedding H-Minor Free Graphs (2016) (0)
Coinductive techniques for higher-order languages: Invited Presentation at the 6th Interaction and Concurrency Experience (2013) (0)
Symmetries and Dualities in Name-Passing Process Calculi (2014) (0)
Examples and Proofs for the paper Functions as processes: termination and the λ̄μμ̃-calculus (2010) (0)
Other Grants and Activities - Actions européennes (2002) (0)
On Bis imulat ions for the Asynchronous-Caleulus * (0)
New Results - Resource Control and Probabilities (2015) (0)
New Results - Semantics of ad-hoc networks (2010) (0)
Processes with internal activities (2011) (0)
New Results - Resource Control (2010) (0)
Types in concurrency (2005) (0)
The main purpose of BASICS 2009 is to bring together researchers and graduate students in order to advance the theory of computation and interaction and promote its applications. Talented undergraduate students are also welcome to attend. (2009) (0)
Modeling Imperative Constructs in the Pi-Calculus (2019) (0)
Refinements of simulation (2011) (0)
CONCUR Test-Of-Time Award 2022 (Invited Paper) (2022) (0)
Parallel Prefix Algorithms (2011) (0)
REVIEWS-The p-calculus (2002) (0)
The Proof Technique of Unique Solutions of Contractions (2015) (0)
Taming mobile processes using types (2003) (0)
Strong Normalisation in λ-Calculi with References (2011) (0)
Modular coinduction up-to for higher-order languages via first-order transition systems (2020) (0)
Concurrency theory: timed automata, testing, program synthesis (2011) (0)
Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults (2019) (0)
Ninth International Conference on Concurrency Theory 1998 - Editorial (2002) (0)
Proceedings of the 1st international conference on Trustworthy global computing (2005) (0)
Front Matter, Table of Contents, Preface, Organization, List of Authors (2016) (0)
Place-Transition Nets (2011) (0)
Parallel Operating System (2011) (0)
Surrogater i Øjeblik: mod migrerering i Obliq (1998) (0)
New Results - Expressiveness of computational models (2010) (0)
Theoretical Computer Science, 11th Italian Conference, ICTCS 2009, Cremona, Italy, September 28-30, 2009, Proceedings (2009) (0)
Introduction to Bisimulation and Coinduction: Algebraic properties of bisimilarity (2011) (0)
Other approaches to behavioural equivalences (2011) (0)
Equations, Contractions, and Unique Solutions (2015) (0)
Unique Solutions of Contractions, CCS, and their HOL Formalisation (2018) (0)
Bisimilarity Via Unique-Solution Techniques (2018) (0)
New Results - Verification of extensional properties (2010) (0)
Games, mobile processes, Dfunctions (2022) (0)
3 A Typed Join Calculus with Owners : J (2011) (0)
From 7c-calculus to Higher-Order 7r-calculus and back (2005) (0)
Session Types Revisited: A Decade Later (2022) (0)
LIPIcs, Volume 55, ICALP'16, Complete Volume (2016) (0)
Online Scheduling of Unit Length Jobs with Commitment and Penalties (2018) (0)
On sequentiality and well-bracketing in the π-calculus (2021) (0)
CONCUR '98 Concurrency Theory: 9th International Conference, Nice, France, September 8-11, 1998, Proceedings (1998) (0)
New Results - Primitives for adaptable and evolvable components (2010) (0)
Solutions to selected exercises (2011) (0)
Review: Communicating and Mobile Systems: the -calculus, - Robin Milner, Cambridge University Press, Cambridge, 1999, 174 pages, ISBN 0-521-64320-1 (2000) (0)
Preface: Special issue on objects and services (2014) (0)
From enhanced coinduction towards enhanced induction (2022) (0)
Advanced Topics in Bisimulation and Coinduction: Preface (2011) (0)
New Results - Verification techniques forextensional properties (2015) (0)

This paper list is powered by the following services:

Other Resources About Davide Sangiorgi

What Schools Are Affiliated With Davide Sangiorgi?

Davide Sangiorgi is affiliated with the following schools: