Davide Sangiorgi

According to our database1, Davide Sangiorgi
  • authored at least 135 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Equations, Contractions, and Unique Solutions.
ACM Trans. Comput. Log., 2017

Session types revisited.
Inf. Comput., 2017

Divergence and Unique Solution of Equations.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Light logics and higher-order processes.
Mathematical Structures in Computer Science, 2016

Name-passing calculi: From fusions to preorders and types.
Inf. Comput., 2016

Environmental bisimulations for probabilistic higher-order languages.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2015
Preface: Special issue on objects and services.
Mathematical Structures in Computer Science, 2015

Equations, Contractions, and Unique Solutions.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

The Proof Technique of Unique Solutions of Contractions.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

On Applicative Similarity, Sequentiality, and Full Abstraction.
Proceedings of the Correct System Design, 2015

2014
Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi.
Proceedings of the Computational Logic, 2014

On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems.
Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

On coinductive equivalences for higher-order probabilistic functional programs.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

On the discriminating power of passivation and higher-order interaction.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Trees from Functions as Processes.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Bisimulations Up-to: Beyond First-Order Transition Systems.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract).
Proceedings of the Coalgebraic Methods in Computer Science, 2014

Symmetries and Dualities in Name-Passing Process Calculi.
Proceedings of the Computing with New Resources, 2014

2013
On Coinductive Equivalences for Higher-Order Probabilistic Functional Programs (Long Version).
CoRR, 2013

Name-Passing Calculi: From Fusions to Preorders and Types.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012
Concurrency theory: timed automata, testing, program synthesis.
Distributed Computing, 2012

Session types revisited.
Proceedings of the Principles and Practice of Declarative Programming, 2012

An Object Group-Based Component Model.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2012

Duality and i/o-Types in the π-Calculus.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Pi-Calculus.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Environmental bisimulations for higher-order languages.
ACM Trans. Program. Lang. Syst., 2011

On the expressiveness and decidability of higher-order process calculi.
Inf. Comput., 2011

Strong Normalisation in λ-Calculi with References.
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

Ownership Types for the Join Calculus.
Proceedings of the Formal Techniques for Distributed Systems, 2011

HATS Abstract Behavioral Specification: The Architectural View.
Proceedings of the Formal Methods for Components and Objects, 10th International Symposium, 2011

Tools and Verification.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

2010
A hybrid type system for lock-freedom of mobile processes.
ACM Trans. Program. Lang. Syst., 2010

An operational semantics for a calculus for wireless systems.
Theor. Comput. Sci., 2010

Termination in higher-order concurrent calculi.
J. Log. Algebr. Program., 2010

Light Logics and Higher-Order Processes
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

A Model of Evolvable Components.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Functions as Processes: Termination and the lm[(m)\tilde]\lambda\mu\widetilde{\mu}-Calculus.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

A Component Model for the ABS Language.
Proceedings of the Formal Methods for Components and Objects - 9th International Symposium, 2010

Termination in Impure Concurrent Languages.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
On the origins of bisimulation and coinduction.
ACM Trans. Program. Lang. Syst., 2009

On the Expressiveness of Polyadicity in Higher-Order Process Calculi.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Termination in Higher-Order Concurrent Calculi.
Proceedings of the Fundamentals of Software Engineering, 2009

Mobile Processes and Termination.
Proceedings of the Semantics and Algebraic Specification, 2009

2008
Separability in the Ambient Logic.
Logical Methods in Computer Science, 2008

Separability in the Ambient Logic
CoRR, 2008

Type Systems for Bigraphs.
Proceedings of the Trustworthy Global Computing, 4th International Symposium, 2008

On the Expressiveness and Decidability of Higher-Order Process Calculi.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Static and dynamic typing for the termination of mobile processes.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

A Hybrid Type System for Lock-Freedom of Mobile Processes.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007
An efficient abstract machine for Safe Ambients.
J. Log. Algebr. Program., 2007

On the Complexity of Termination Inference for Processes.
Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

Environmental Bisimulations for Higher-Order Languages.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Logical Bisimulations and Functional Languages.
Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

2006
Towards an algebraic theory of typed mobile processes.
Theor. Comput. Sci., 2006

Safe Ambients: Abstract machine and distributed implementation.
Sci. Comput. Program., 2006

Termination of processes.
Mathematical Structures in Computer Science, 2006

On the Expressiveness of the Ambient Logic.
Logical Methods in Computer Science, 2006

Ensuring termination by typability.
Inf. Comput., 2006

Bisimulation and Co-induction: Some Problems.
Electr. Notes Theor. Comput. Sci., 2006

Towards a Calculus For Wireless Systems.
Electr. Notes Theor. Comput. Sci., 2006

SCC: A Service Centered Calculus.
Proceedings of the Web Services and Formal Methods, Third International Workshop, 2006

The Bisimulation Proof Method: Enhancements and Open Problems.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2006

2005
On the representation of McCarthy's amb in the Pi-calculus.
Theor. Comput. Sci., 2005

On the Expressiveness of the Ambient Logic
CoRR, 2005

Types in concurrency.
Acta Inf., 2005

Beyond Bisimulation: The "up-to" Techniques.
Proceedings of the Formal Methods for Components and Objects, 4th International Symposium, 2005

A Correct Abstract Machine for Safe Ambients.
Proceedings of the Coordination Models and Languages, 7th International Conference, 2005

2004
On asynchrony in name-passing calculi.
Mathematical Structures in Computer Science, 2004

On the Representation of McCarthy's amb in the -calculus.
Electr. Notes Theor. Comput. Sci., 2004

Bisimulation: From The Origins to Today.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Ensuring Termination by Typability.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Towards an Algebraic Theory of Typed Mobile Processes.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Mobile safe ambients.
ACM Trans. Program. Lang. Syst., 2003

Taming Mobile Processes Using Types.
Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003

Minimality Results for the Spatial Logics.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Ninth International Conference on Concurrency Theory 1998 - Editorial.
Theor. Comput. Sci., 2002

Imperative objects as mobile processes.
Sci. Comput. Program., 2002

A Fully Abstract Model for the [pi]-calculus.
Inf. Comput., 2002

Separability, Expressiveness, and Decidability in the Ambient Logic.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Types, or: Where's the Difference Between CCS and pi?
Proceedings of the CONCUR 2002, 2002

2001
Asynchronous process calculi: the first- and higher-order paradigms.
Theor. Comput. Sci., 2001

A Partition Refinement Algorithm for the -Calculus.
Inf. Comput., 2001

Extensionality and Intensionality of the Ambient Logics.
Proceedings of the Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001

A Distributed Abstract Machine for Safe Ambients.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

On Barbed Equivalences in pi-Calculus.
Proceedings of the CONCUR 2001, 2001

The Pi-Calculus - a theory of mobile processes.
Cambridge University Press, ISBN: 978-0-521-78177-0, 2001

2000
Review: Communicating and Mobile Systems: the -calculus, - Robin Milner, Cambridge University Press, Cambridge, 1999, 174 pages, ISBN 0-521-64320-1.
Sci. Comput. Program., 2000

Behavioral equivalence in the polymorphic pi-calculus.
J. ACM, 2000

Controlling Interference in Ambients.
Proceedings of the POPL 2000, 2000

Lazy functions and mobile processes.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
The Name Discipline of Uniform Receptiveness.
Theor. Comput. Sci., 1999

Typed pi-calculus at Work: A Correctness Proof of Jones's Parallelisation Transformation on Concurrent Objects.
TAPOS, 1999

From lambda to pi; or, Rediscovering continuations.
Mathematical Structures in Computer Science, 1999

Reasoning About Concurrent Systems Using Types.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

A pi-calculus Process Semantics of Concurrent Idealised ALGOL.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

1998
Some Congruence Properties for Pi-Calculus Bisimilarities.
Theor. Comput. Sci., 1998

On Bisimulations for the Asynchronous pi-Calculus.
Theor. Comput. Sci., 1998

On the Foundations of Final Coalgebra Semantics: Non-Well-Founded Sets, Partial Orders, Metric Spaces.
Mathematical Structures in Computer Science, 1998

An Interpretation of Typed Objects into Typed pi-Calculus.
Inf. Comput., 1998

A Fully Abstract Semantics for Causality in the \pi-Calculus.
Acta Inf., 1998

Imperative objects and mobile processes.
Proceedings of the Programming Concepts and Methods, 1998

Bisimulation in Name-Passing Calculi without Matching.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

On Asynchrony in Name-Passing Calculi.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Behavioral Equivalence in the Polymorphic Pi-calculus.
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

The Name Discipline of Uniform Receptiveness (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
pi-Calculus, Internal Mobility, and Agent-Passing Calculi.
Theor. Comput. Sci., 1996

Locality and Interleaving Semantics in Calculi for Mobile Processes.
Theor. Comput. Sci., 1996

Typing and Subtyping for Mobile Processes.
Mathematical Structures in Computer Science, 1996

Bisimulation for Higher-Order Process Calculi.
Inf. Comput., 1996

A Theory of Bisimulation for the pi-Calculus.
Acta Inf., 1996

A Fully-Abstract Model for the pi-Calculus (Extended Abstract).
Proceedings of the Proceedings, 1996

On Bisimulations for the Asynchronous pi-Calculus.
Proceedings of the CONCUR '96, 1996

A Partition Refinement Algorithm for the pi-Calculus (Extended Abstract).
Proceedings of the Computer Aided Verification, 8th International Conference, 1996

1995
Algebraic Theories for Name-Passing Calculi
Inf. Comput., August, 1995

Pi-I: A Symmetric Calculus Based on Internal Mobility.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

A Fully Abstract Semantics for Causality in the Pi-Calculus.
STACS, 1995

On the Proof Method for Bisimulation (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Internal Mobility and Agent-Passing Calculi.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
The Lazy Lambda Calculus in a Concurrency Scenario
Inf. Comput., May, 1994

Locality and True-concurrency in Calculi for Mobile Processes.
Proceedings of the Theoretical Aspects of Computer Software, 1994

Bisimulation in Higher-Order Process Calculi.
Proceedings of the Programming Concepts, 1994

1993
Expressing mobility in process algebras : first-order and higher-order paradigms.
PhD thesis, 1993

From pi-Calculus to Higher-Order pi-Calculus - and Back.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Algebraic Theories for Name-Passing Calculi.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

An Investigation into Functions as Processes.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

Typing and Subtyping for Mobile Processes
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

A Theory of Bisimulation for the pi-Calculus.
Proceedings of the CONCUR '93, 1993

1992
Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata.
Acta Inf., 1992

The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract)
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Barbed Bisimulation.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

The Problem of "Weak Bisimulation up to".
Proceedings of the CONCUR '92, 1992

1991
Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata.
Theor. Comput. Sci., 1991

1990
Simulation of Systolic Tree Automata on Trellis Automata.
Int. J. Found. Comput. Sci., 1990

Comparisons Among Classes of Y-Tree Systolic Automata.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990


  Loading...