Eduardo Bonelli
Title
Cited by
Cited by
Year
Multipoint session types for a distributed calculus
E Bonelli, A Compagnoni
International Symposium on Trustworthy Global Computing, 240-256, 2007
882007
Correspondence assertions for process synchronization in concurrent communications
E Bonelli, A Compagnoni, E Gunter
Journal of Functional Programming 15 (2), 219, 2005
832005
A nonstandard standardization theorem
B Accattoli, E Bonelli, D Kesner, C Lombardi
ACM SIGPLAN Notices 49 (1), 659-670, 2014
522014
A typed assembly language for non-interference
R Medel, A Compagnoni, E Bonelli
Italian Conference on Theoretical Computer Science, 360-374, 2005
332005
The intensional lambda calculus
S Artemov, E Bonelli
International Symposium on Logical Foundations of Computer Science, 12-25, 2007
272007
Typechecking safe process synchronization
E Bonelli, A Compagnoni, E Gunter
Electronic Notes in Theoretical Computer Science 138 (1), 3-22, 2005
262005
Perpetuality in a named lambda calculus with explicit substitutions
E Bonelli
Mathematical Structures in Computer Science 11 (1), 47, 2001
212001
A de Bruijn notation for higher-order rewriting
E Bonelli, D Kesner, A Ríos
International Conference on Rewriting Techniques and Applications, 62-79, 2000
212000
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
182017
From higher-order to first-order rewriting
E Bonelli, D Kesner, A Ríos
International Conference on Rewriting Techniques and Applications, 47-62, 2001
182001
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
152013
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
152009
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
152004
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
142005
Substitutions explicites et réécriture de termes
EA Bonelli
Paris 11, 2001
132001
Justification logic and history based computation
F Bavera, E Bonelli
International Colloquium on Theoretical Aspects of Computing, 337-351, 2010
112010
Justification logic and audited computation
F Bavera, E Bonelli
Journal of Logic and Computation 28 (5), 909-934, 2018
102018
Type-based information flow analysis for bytecode languages with variable object field policies
F Bavera, E Bonelli
Proceedings of the 2008 ACM symposium on Applied computing, 347-351, 2008
102008
Perpetuality in a lambda calculus with explicit substitutions and composition
A Arbiser, E Bonelli, A Rıos
Workshop Argentino de Informática Teórica (WAIT), JAIIO, 2000
102000
Boxed ambients with communication interfaces
P Garralda, E Bonelli, A Compagnoni, M Dezani-Ciancaglini
Mathematical Structures in Computer Science 17 (4), 587-645, 2007
92007
The system can't perform the operation now. Try again later.
Articles 1–20