Davide Sangiorgi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Davide Sangiorgi has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
Damien Pous
Univ Lyon, CNRS, EnsL, UCBL, LIP, 69342, Lyon Cedex 07, France
1 shared publicationGuilhème Jaber
Université de Nantes
1 shared publication
Latest Publications
- 11 November 2026
- Published by Springer Nature
- p. 460-470
Semantics of Imperative Functions: Games and Name-Passing Processes
- 11 November 2026
- Published by Springer Nature
- p. 460-470
Semantics of Imperative Functions: Games and Name-Passing Processes
- 19 October 2025
- Published by Springer Nature
- p. 68-85
Unique-Solution of Equations in Higher-Order Process Calculi with Passivation
- 19 October 2025
- Published by Springer Nature
- p. 68-85
Unique-Solution of Equations in Higher-Order Process Calculi with Passivation
- 9 October 2024
- Published by Springer Nature
- p. 62-74
An Abstract Account of Up-to Techniques for Inductive Behavioural Relations
- 9 October 2024
- Published by Springer Nature
- p. 62-74
An Abstract Account of Up-to Techniques for Inductive Behavioural Relations
- Open Access
- 8 November 2019
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 31 (6) , 733-749
Bisimulation and Coinduction Enhancements: A Historical Perspective
Bisimulation is an instance of coinduction. Both bisimulation and coinduction are today widely used, in many areas of Computer Science, as well as outside Computer Science. Over, roughly, the last 25 years, enhancements of the principles and methods related to bisimulation and coinduction (i.e., techniques to make proofs shorter and simpler) have become a research topic on its own. In the paper the origins and the developments of the topic are reviewed.
- 8 November 2019
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 31 (6) , 733-749
Open AccessBisimulation and Coinduction Enhancements: A Historical Perspective
Bisimulation is an instance of coinduction. Both bisimulation and coinduction are today widely used, in many areas of Computer Science, as well as outside Computer Science. Over, roughly, the last 25 years, enhancements of the principles and methods related to bisimulation and coinduction (i.e., techniques to make proofs shorter and simpler) have become a research topic on its own. In the paper the origins and the developments of the topic are reviewed.
- 4 November 2019
- Published by Springer Nature
- p. 33-49
Asynchronous $\pi $ -calculus at Work: The Call-by-Need Strategy- 4 November 2019
- Published by Springer Nature
- p. 33-49
Asynchronous $\pi $ -calculus at Work: The Call-by-Need Strategy