Artículos con órdenes de acceso público - Davide SangiorgiMás información
Disponibles en algún lugar: 21
On coinductive equivalences for higher-order probabilistic functional programs
U Dal Lago, D Sangiorgi, M Alberti
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014
Órdenes: Government of Italy
Environmental bisimulations for probabilistic higher-order languages
D Sangiorgi, V Vignudelli
ACM SIGPLAN Notices 51 (1), 595-607, 2016
Órdenes: Government of Italy
Eager functions as processes
A Durier, D Hirschkoff, D Sangiorgi
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
Órdenes: European Commission
Bisimulation and coinduction enhancements: A historical perspective
D Pous, D Sangiorgi
Formal Aspects of Computing 31, 733-749, 2019
Órdenes: European Commission, Government of Italy
Trees from functions as processes
D Sangiorgi, X Xu
International Conference on Concurrency Theory, 78-92, 2014
Órdenes: National Natural Science Foundation of China
Equations, contractions, and unique solutions
D Sangiorgi
ACM SIGPLAN Notices 50 (1), 421-432, 2015
Órdenes: Government of Italy
On the representation of references in the pi-calculus
D Hirschkoff, E Prebet, D Sangiorgi
Órdenes: European Commission, Agence Nationale de la Recherche, Government of Italy
Playing with bisimulation in Erlang
I Lanese, D Sangiorgi, G Zavattaro
Models, Languages, and Tools for Concurrent and Distributed Programming …, 2019
Órdenes: Agence Nationale de la Recherche
Equations, contractions, and unique solutions
D Sangiorgi
ACM Transactions on Computational Logic (TOCL) 18 (1), 1-30, 2017
Órdenes: Government of Italy
On the discriminating power of testing equivalences for reactive probabilistic systems: Results and open problems
M Bernardo, D Sangiorgi, V Vignudelli
International Conference on Quantitative Evaluation of Systems, 281-296, 2014
Órdenes: Government of Italy
The servers of serverless computing: a formal revisitation of functions as a service
S Giallorenzo, I Lanese, F Montesi, D Sangiorgi, SP Zingaro
Recent Developments in the Design and Implementation of Programming Languages, 2020
Órdenes: Villum Foundation, Government of Italy
Divergence and unique solution of equations
A Durier, D Hirschkoff, D Sangiorgi
Logical Methods in Computer Science 15, 2019
Órdenes: European Commission, Agence Nationale de la Recherche
On the discriminating power of passivation and higher-order interaction
M Bernardo, D Sangiorgi, V Vignudelli
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
Órdenes: Government of Italy
On sequentiality and well-bracketing in the π-calculus
D Hirschkoff, E Prebet, D Sangiorgi
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021
Órdenes: Government of Italy
From enhanced coinduction towards enhanced induction
D Sangiorgi
Proceedings of the ACM on Programming Languages 6 (POPL), 1-29, 2022
Órdenes: Government of Italy
Towards ‘up to context’reasoning about higher-order processes
A Durier, D Hirschkoff, D Sangiorgi
Theoretical Computer Science 807, 154-168, 2020
Órdenes: European Commission, Agence Nationale de la Recherche
Environmental bisimulations for probabilistic higher-order languages
D Sangiorgi, V Vignudelli
ACM Transactions on Programming Languages and Systems (TOPLAS) 41 (4), 1-64, 2019
Órdenes: European Commission, Agence Nationale de la Recherche
Unique solutions of contractions, CCS, and their HOL formalisation
C Tian, D Sangiorgi
arXiv preprint arXiv:1808.08652, 2018
Órdenes: European Commission, Government of Italy
Extensional and Non-extensional Functions as Processes
K Sakayori, D Sangiorgi
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2023
Órdenes: European Commission, Government of Italy
Asynchronous-calculus at Work: The Call-by-Need Strategy
D Sangiorgi
The Art of Modelling Computational Systems: A Journey from Logic and …, 2019
Órdenes: European Commission
La información de publicación y financiación se determina de forma automática mediante un programa informático