| Multipoint session types for a distributed calculus E Bonelli, A Compagnoni International Symposium on Trustworthy Global Computing, 240-256, 2007 | 82 | 2007 |
| Correspondence assertions for process synchronization in concurrent communications E Bonelli, A Compagnoni, E Gunter Journal of Functional Programming 15 (2), 219-247, 2005 | 81 | 2005 |
| A nonstandard standardization theorem B Accattoli, E Bonelli, D Kesner, C Lombardi ACM SIGPLAN Notices 49 (1), 659-670, 2014 | 71 | 2014 |
| A typed assembly language for non-interference R Medel, A Compagnoni, E Bonelli Italian Conference on Theoretical Computer Science, 360-374, 2005 | 37 | 2005 |
| Foundations of strong call by need T Balabonski, P Barenbaum, E Bonelli, D Kesner Proceedings of the ACM on Programming Languages 1 (ICFP), 1-29, 2017 | 31 | 2017 |
| The intensional lambda calculus S Artemov, E Bonelli Logical Foundations of Computer Science: International Symposium, LFCS 2007 …, 2007 | 26 | 2007 |
| A de Bruijn notation for higher-order rewriting E Bonelli, D Kesner, A Ríos Rewriting Techniques and Applications: 11th International Conference, RTA …, 2000 | 25 | 2000 |
| Typechecking safe process synchronization E Bonelli, A Compagnoni, E Gunter Electronic Notes in Theoretical Computer Science 138 (1), 3-22, 2005 | 24 | 2005 |
| Perpetuality in a named lambda calculus with explicit substitutions E Bonelli Mathematical Structures in Computer Science 11 (1), 47-90, 2001 | 21 | 2001 |
| From higher-order to first-order rewriting E Bonelli, D Kesner, A Ríos Rewriting Techniques and Applications: 12th International Conference, RTA …, 2001 | 17 | 2001 |
| Bioscape: A modeling and simulation language for bacteria-materials interactions A Compagnoni, V Sharma, Y Bao, M Libera, S Sukhishvili, P Bidinger, ... Electronic Notes in Theoretical Computer Science 293, 35-49, 2013 | 15 | 2013 |
| Information flow analysis for a typed assembly language with polymorphic stacks E Bonelli, A Compagnoni, R Medel International Workshop on Construction and Analysis of Safe, Secure, and …, 2005 | 15 | 2005 |
| The logic of proofs as a foundation for certifying mobile computation E Bonelli, F Feller International Symposium on Logical Foundations of Computer Science, 76-91, 2009 | 14 | 2009 |
| Boxed ambients with communication interfaces E Bonelli, A Compagnoni, M Dezani-Ciancaglini, P Garralda International Symposium on Mathematical Foundations of Computer Science, 119-148, 2004 | 14 | 2004 |
| Justification logic and audited computation F Bavera, E Bonelli Journal of Logic and Computation 28 (5), 909-934, 2018 | 13 | 2018 |
| Non-interference for a typed assembly language R Medel, A Compagnoni, E Bonelli Foundations of Computer Security, 67, 2005 | 12 | 2005 |
| SIFTAL: A typed assembly language for secure information flow analysis E Bonelli, A Compagnoni, R Medel Informal Proceedings of FCS 5, 2004 | 12 | 2004 |
| Substitutions explicites et réécriture de termes EA Bonelli Paris 11, 2001 | 12 | 2001 |
| Justification logic and history based computation F Bavera, E Bonelli International Colloquium on Theoretical Aspects of Computing, 337-351, 2010 | 11 | 2010 |
| Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need P Barenbaum, E Bonelli, K Mohamed Proceedings of the 20th International Symposium on Principles and Practice …, 2018 | 10 | 2018 |
Adriana CompagnoniProfessor of Computer Science, Stevens Institute of TechnologyVerified email at stevens.edu
