Davide Sangiorgi

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Enhanced Induction in Behavioural Relations (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022

Eager functions as processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

From enhanced coinduction towards enhanced induction.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2022

Interviews with the 2022 CONCUR Test-of-Time Award Recipients.

[BibT_eX]

[DOI]

Bull. EATCS, 2022

Eager Functions as Processes (long version).

[BibT_eX]

[DOI]

CoRR, 2022

Session Types Revisited: A Decade Later.

[BibT_eX]

[DOI]

Ornela Dardha

Elena Giachino

Proceedings of the PPDP 2022: 24th International Symposium on Principles and Practice of Declarative Programming, Tbilisi, Georgia, September 20, 2022

Games, Mobile Processes, and Functions.

[BibT_eX]

[DOI]

Guilhem Jaber

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

CONCUR Test-Of-Time Award 2022 (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

Modular coinduction up-to for higher-order languages via first-order transition systems.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

On sequentiality and well-bracketing in the π-calculus.

[BibT_eX]

[DOI]

Enguerrand Prebet

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020

Towards 'up to context' reasoning about higher-order processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the Representation of References in the Pi-Calculus.

[BibT_eX]

[DOI]

Enguerrand Prebet

Proceedings of the 31st International Conference on Concurrency Theory, 2020

The Servers of Serverless Computing: A Formal Revisitation of Functions as a Service.

[BibT_eX]

[DOI]

Proceedings of the Recent Developments in the Design and Implementation of Programming Languages, 2020

2019

Environmental Bisimulations for Probabilistic Higher-order Languages.

[BibT_eX]

[DOI]

Valeria Vignudelli

ACM Trans. Program. Lang. Syst., 2019

Divergence and unique solution of equations.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2019

Bisimulation and Coinduction Enhancements: A Historical Perspective.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2019

Modeling Imperative Constructs in the Pi-Calculus.

[BibT_eX]

[DOI]

Enguerrand Prebet

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Asynchronous \pi -calculus at Work: The Call-by-Need Strategy.

[BibT_eX]

[DOI]

Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

Playing with Bisimulation in Erlang.

[BibT_eX]

[DOI]

Ivan Lanese

Gianluigi Zavattaro

Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

2018

Trees from Functions as Processes.

[BibT_eX]

[DOI]

Xian Xu

Log. Methods Comput. Sci., 2018

Unique Solutions of Contractions, CCS, and their HOL Formalisation.

[BibT_eX]

[DOI]

Chun Tian

Proceedings of the Proceedings Combined 25th International Workshop on Expressiveness in Concurrency and 15th Workshop on Structural Operational Semantics, 2018

Bisimilarity Via Unique-Solution Techniques.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

2017

Equations, Contractions, and Unique Solutions.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2017

Session types revisited.

[BibT_eX]

[DOI]

Ornela Dardha

Elena Giachino

Inf. Comput., 2017

2016

Name-passing calculi: From fusions to preorders and types.

[BibT_eX]

[DOI]

Inf. Comput., 2016

2015

Preface: Special issue on objects and services.

[BibT_eX]

[DOI]

Ivan Lanese

Math. Struct. Comput. Sci., 2015

The Proof Technique of Unique Solutions of Contractions.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

On Applicative Similarity, Sequentiality, and Full Abstraction.

[BibT_eX]

[DOI]

Proceedings of the Correct System Design, 2015

2014

Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi.

[BibT_eX]

[DOI]

Jos C. M. Baeten

Proceedings of the Computational Logic, 2014

On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems.

[BibT_eX]

[DOI]

Marco Bernardo

Valeria Vignudelli

Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

On coinductive equivalences for higher-order probabilistic functional programs.

[BibT_eX]

[DOI]

Ugo Dal Lago

Michele Alberti

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.

[BibT_eX]

[DOI]

Marco Bernardo

Valeria Vignudelli

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

Bisimulations Up-to: Beyond First-Order Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2014

Symmetries and Dualities in Name-Passing Process Calculi.

[BibT_eX]

[DOI]

Proceedings of the Computing with New Resources, 2014

2013

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

[BibT_eX]

[DOI]

Ugo Dal Lago

Michele Alberti

CoRR, 2013

2012

Concurrency theory: timed automata, testing, program synthesis.

[BibT_eX]

[DOI]

Distributed Comput., 2012

An Object Group-Based Component Model.

[BibT_eX]

[DOI]

Michael Lienhardt

Mario Bravetti

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2012

Duality and i/o-Types in the π-Calculus.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Origins of bisimulation and coinduction.

[BibT_eX]

Proceedings of the Advanced Topics in Bisimulation and Coinduction., 2012

Enhancements of the bisimulation proof method.

[BibT_eX]

Proceedings of the Advanced Topics in Bisimulation and Coinduction., 2012

2011

Pi-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Parallel Computing, 2011

Environmental bisimulations for higher-order languages.

[BibT_eX]

[DOI]

Naoki Kobayashi

Eijiro Sumii

ACM Trans. Program. Lang. Syst., 2011

On the expressiveness and decidability of higher-order process calculi.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Strong Normalisation in λ-Calculi with References.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

Ownership Types for the Join Calculus.

[BibT_eX]

[DOI]

Marco Patrignani

Dave Clarke

Proceedings of the Formal Techniques for Distributed Systems, 2011

HATS Abstract Behavioral Specification: The Architectural View.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Components and Objects, 10th International Symposium, 2011

Tools and Verification.

[BibT_eX]

[DOI]

Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

2010

A hybrid type system for lock-freedom of mobile processes.

[BibT_eX]

[DOI]

Naoki Kobayashi

ACM Trans. Program. Lang. Syst., 2010

An operational semantics for a calculus for wireless systems.

[BibT_eX]

[DOI]

Ivan Lanese

Theor. Comput. Sci., 2010

Termination in higher-order concurrent calculi.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2010

Light Logics and Higher-Order Processes

[BibT_eX]

[DOI]

Ugo Dal Lago

Simone Martini

Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

A Model of Evolvable Components.

[BibT_eX]

[DOI]

Fabrizio Montesi

Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Functions as Processes: Termination and the lm[(m)\tilde]\lambda\mu\widetilde{\mu}-Calculus.

[BibT_eX]

[DOI]

Matteo Cimini

Claudio Sacerdoti Coen

Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

A Component Model for the ABS Language.

[BibT_eX]

[DOI]

Arnd Poetzsch-Heffter

Proceedings of the Formal Methods for Components and Objects - 9th International Symposium, 2010

Termination in Impure Concurrent Languages.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

On the origins of bisimulation and coinduction.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2009

On the Expressiveness of Polyadicity in Higher-Order Process Calculi.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Mobile Processes and Termination.

[BibT_eX]

[DOI]

Proceedings of the Semantics and Algebraic Specification, 2009

2008

Separability in the Ambient Logic.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

Type Systems for Bigraphs.

[BibT_eX]

[DOI]

Ebbe Elsborg

Thomas T. Hildebrandt

Proceedings of the Trustworthy Global Computing, 4th International Symposium, 2008

Static and dynamic typing for the termination of mobile processes.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007

An efficient abstract machine for Safe Ambients.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2007

On the Complexity of Termination Inference for Processes.

[BibT_eX]

[DOI]

Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

Logical Bisimulations and Functional Languages.

[BibT_eX]

[DOI]

Naoki Kobayashi

Eijiro Sumii

Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

2006

Towards an algebraic theory of typed mobile processes.

[BibT_eX]

[DOI]

Yuxin Deng

Theor. Comput. Sci., 2006

Safe Ambients: Abstract machine and distributed implementation.

[BibT_eX]

[DOI]

Paola Giannini

Andrea Valente

Sci. Comput. Program., 2006

Termination of processes.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2006

On the Expressiveness of the Ambient Logic.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2006

Ensuring termination by typability.

[BibT_eX]

[DOI]

Yuxin Deng

Inf. Comput., 2006

Towards a Calculus For Wireless Systems.

[BibT_eX]

[DOI]

Nicola Mezzetti

Vasco Thudichum Vasconcelos

Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006

SCC: A Service Centered Calculus.

[BibT_eX]

[DOI]

Gianluigi Zavattaro

Proceedings of the Web Services and Formal Methods, Third International Workshop, 2006

The Bisimulation Proof Method: Enhancements and Open Problems.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2006

2005

On the representation of McCarthy's amb in the Pi-calculus.

[BibT_eX]

[DOI]

Arnaud Carayol

Theor. Comput. Sci., 2005

Bisimulation and Co-induction: Some Problems.

[BibT_eX]

[DOI]

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Types in concurrency.

[BibT_eX]

[DOI]

Rocco De Nicola

Acta Informatica, 2005

Beyond Bisimulation: The "up-to" Techniques.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Components and Objects, 4th International Symposium, 2005

A Correct Abstract Machine for Safe Ambients.

[BibT_eX]

[DOI]

Proceedings of the Coordination Models and Languages, 7th International Conference, 2005

2004

On asynchrony in name-passing calculi.

[BibT_eX]

[DOI]

Massimo Merro

Math. Struct. Comput. Sci., 2004

Bisimulation: From The Origins to Today.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003

Mobile safe ambients.

[BibT_eX]

[DOI]

Francesca Levi

ACM Trans. Program. Lang. Syst., 2003

On the Representation of McCarthy's <i>amb</i> in the π-calculus.

[BibT_eX]

[DOI]

Arnaud Carayol

Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

Taming Mobile Processes Using Types.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003

Minimality Results for the Spatial Logics.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Ninth International Conference on Concurrency Theory 1998 - Editorial.

[BibT_eX]

[DOI]

Robert de Simone

Theor. Comput. Sci., 2002

Imperative objects as mobile processes.

[BibT_eX]

[DOI]

Josva Kleist

Sci. Comput. Program., 2002

A Fully Abstract Model for the [pi]-calculus.

[BibT_eX]

[DOI]

Marcelo P. Fiore

Eugenio Moggi

Inf. Comput., 2002

Separability, Expressiveness, and Decidability in the Ambient Logic.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Types, or: Where's the Difference Between CCS and pi?

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2002, 2002

2001

Asynchronous process calculi: the first- and higher-order paradigms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

A Partition Refinement Algorithm for the -Calculus.

[BibT_eX]

[DOI]

Marco Pistore

Inf. Comput., 2001

Extensionality and Intensionality of the Ambient Logics.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Andrea Valente

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

On Barbed Equivalences in pi-Calculus.

[BibT_eX]

[DOI]

David Walker

Proceedings of the CONCUR 2001, 2001

The Pi-Calculus - a theory of mobile processes.

[BibT_eX]

David Walker

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.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2000

Behavioral equivalence in the polymorphic pi-calculus.

[BibT_eX]

[DOI]

Benjamin C. Pierce

J. ACM, 2000

Controlling Interference in Ambients.

[BibT_eX]

[DOI]

Francesca Levi

Proceedings of the POPL 2000, 2000

Lazy functions and mobile processes.

[BibT_eX]

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

The Name Discipline of Uniform Receptiveness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

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

[BibT_eX]

Theory Pract. Object Syst., 1999

From lambda to pi; or, Rediscovering continuations.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1999

Reasoning About Concurrent Systems Using Types.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structure, 1999

A pi-calculus Process Semantics of Concurrent Idealised ALGOL.

[BibT_eX]

[DOI]

Christine Röckl

Proceedings of the Foundations of Software Science and Computation Structure, 1999

1998

Some Congruence Properties for Pi-Calculus Bisimilarities.

[BibT_eX]

[DOI]

Michele Boreale

Theor. Comput. Sci., 1998

On Bisimulations for the Asynchronous pi-Calculus.

[BibT_eX]

[DOI]

Roberto M. Amadio

Ilaria Castellani

Theor. Comput. Sci., 1998

On the Foundations of Final Coalgebra Semantics: Non-Well-Founded Sets, Partial Orders, Metric Spaces.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1998

An Interpretation of Typed Objects into Typed pi-Calculus.

[BibT_eX]

[DOI]

Inf. Comput., 1998

A Fully Abstract Semantics for Causality in the \pi-Calculus.

[BibT_eX]

[DOI]

Michele Boreale

Acta Informatica, 1998

Imperative objects and mobile processes.

[BibT_eX]

Josva Kleist

Proceedings of the Programming Concepts and Methods, 1998

Bisimulation in Name-Passing Calculi without Matching.

[BibT_eX]

[DOI]

Michele Boreale

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997

The Name Discipline of Uniform Receptiveness (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

pi-Calculus, Internal Mobility, and Agent-Passing Calculi.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Locality and Interleaving Semantics in Calculi for Mobile Processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Typing and Subtyping for Mobile Processes.

[BibT_eX]

[DOI]

Benjamin C. Pierce

Math. Struct. Comput. Sci., 1996

Bisimulation for Higher-Order Process Calculi.

[BibT_eX]

[DOI]

Inf. Comput., 1996

A Theory of Bisimulation for the pi-Calculus.

[BibT_eX]

[DOI]

Acta Informatica, 1996

A Fully-Abstract Model for the pi-Calculus (Extended Abstract).

[BibT_eX]

[DOI]

Marcelo P. Fiore

Eugenio Moggi

Proceedings of the Proceedings, 1996

A Partition Refinement Algorithm for the <i>pi</i>-Calculus (Extended Abstract).

[BibT_eX]

[DOI]

Marco Pistore

Proceedings of the Computer Aided Verification, 8th International Conference, 1996

1995

Algebraic Theories for Name-Passing Calculi

[BibT_eX]

[DOI]

Joachim Parrow

Inf. Comput., August, 1995

Pi-I: A Symmetric Calculus Based on Internal Mobility.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

On the Proof Method for Bisimulation (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Internal Mobility and Agent-Passing Calculi.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

The Lazy Lambda Calculus in a Concurrency Scenario

[BibT_eX]

[DOI]

Inf. Comput., May, 1994

Locality and True-concurrency in Calculi for Mobile Processes.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Software, 1994

1993

Expressing mobility in process algebras : first-order and higher-order paradigms.

[BibT_eX]

[DOI]

PhD thesis, 1993

From pi-Calculus to Higher-Order pi-Calculus - and Back.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

An Investigation into Functions as Processes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992

Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata.

[BibT_eX]

[DOI]

Acta Informatica, 1992

The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Barbed Bisimulation.

[BibT_eX]

[DOI]

Robin Milner

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

The Problem of "Weak Bisimulation up to".

[BibT_eX]

[DOI]

Robin Milner

Proceedings of the CONCUR '92, 1992

1991

Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata.

[BibT_eX]

[DOI]

Giovanni Resta

Theor. Comput. Sci., 1991

1990

Simulation of Systolic Tree Automata on Trellis Automata.

[BibT_eX]

[DOI]

Jozef Gruska

Int. J. Found. Comput. Sci., 1990

Comparisons Among Classes of Y-Tree Systolic Automata.

[BibT_eX]

[DOI]