Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Eduardo Bonelli
2010 – today
- 2013
[j11]Adriana B. Compagnoni, Vishakha Sharma, Yifei Bao, Matthew Libera, Svetlana Sukhishvili, Philippe Bidinger, Livio Bioglio, Eduardo Bonelli: BioScape: A Modeling and Simulation Language for Bacteria-Materials Interactions. Electr. Notes Theor. Comput. Sci. 293: 35-49 (2013)- 2012
[j10]Eduardo Bonelli, Federico Feller: Justification Logic as a foundation for certifying mobile computation. Ann. Pure Appl. Logic 163(7): 935-950 (2012)
[c15]Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos: Normalisation for Dynamic Pattern Calculi. RTA 2012: 117-132- 2011
[c14]Luciano Bello, Eduardo Bonelli: On-the-Fly Inlining of Dynamic Dependency Monitors for Secure Information Flow. Formal Aspects in Security and Trust 2011: 55-69- 2010
[c13]Francisco Bavera, Eduardo Bonelli: Justification Logic and History Based Computation. ICTAC 2010: 337-351
[e1]
2000 – 2009
- 2009
[c12]Eduardo Bonelli, Federico Feller: The Logic of Proofs as a Foundation for Certifying Mobile Computation. LFCS 2009: 76-91
[c11]- 2008
[c10]Francisco Bavera, Eduardo Bonelli: Type-based information flow analysis for bytecode languages with variable object field policies. SAC 2008: 347-351- 2007
[j9]Pablo Garralda, Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini: Boxed ambients with communication interfaces. Mathematical Structures in Computer Science 17(4): 587-645 (2007)
[c9]
[c8]Eduardo Bonelli, Adriana B. Compagnoni: Multipoint Session Types for a Distributed Calculus. TGC 2007: 240-256- 2006
[j8]Eduardo Bonelli: The Linear Logical Abstract Machine. Electr. Notes Theor. Comput. Sci. 158: 99-121 (2006)- 2005
[j7]Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter: Typechecking Safe Process Synchronization. Electr. Notes Theor. Comput. Sci. 138(1): 3-22 (2005)
[j6]Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter: Correspondence assertions for process synchronization in concurrent communications. J. Funct. Program. 15(2): 219-247 (2005)
[j5]Eduardo Bonelli, Delia Kesner, Alejandro Ríos: de Bruijn Indices for Metaterms. J. Log. Comput. 15(6): 855-899 (2005)
[j4]Eduardo Bonelli, Delia Kesner, Alejandro Ríos: Relating Higher-order and First-order Rewriting. J. Log. Comput. 15(6): 901-947 (2005)
[j3]Eduardo Bonelli: Normalisation for higher-order calculi with explicit substitutions. Theor. Comput. Sci. 333(1-2): 91-125 (2005)
[c7]Eduardo Bonelli, Adriana B. Compagnoni, Ricardo Medel: Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks. CASSIS 2005: 37-56
[c6]Ricardo Medel, Adriana B. Compagnoni, Eduardo Bonelli: A Typed Assembly Language for Non-interference. ICTCS 2005: 360-374- 2004
[j2]Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter: Correspondence Assertions for Process Synchronization in Concurrent Communications. Electr. Notes Theor. Comput. Sci. 97: 175-195 (2004)
[c5]Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda: Boxed Ambients with Communication Interfaces. MFCS 2004: 119-148- 2003
[c4]Eduardo Bonelli: A Normalisation Result for Higher-Order Calculi with Explicit Substitutions. FoSSaCS 2003: 153-168- 2001
[j1]Eduardo Bonelli: Perpetuality in a named lambda calculus with explicit substitutions. Mathematical Structures in Computer Science 11(1): 47-90 (2001)
[c3]Eduardo Bonelli, Delia Kesner, Alejandro Ríos: From Higher-Order to First-Order Rewriting. RTA 2001: 47-62- 2000
[c2]Eduardo Bonelli, Delia Kesner, Alejandro Ríos: A de Bruijn Notation for Higher-Order Rewriting. RTA 2000: 62-79
1990 – 1999
- 1999
[c1]Eduardo Bonelli: Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. CSL 1999: 204-219
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:10 CEST by the dblp team



