Eduardo Bonelli‎ > ‎

Publications

Journal

  • Justification Logic as a foundation for certifying mobile computation, with Federico Feller. Ann. Pure Appl. Logic 163(7): 935-950 (2012)
  • Boxed Ambients with Communication Interfaces, with Pablo Garralda, Adriana Compagnoni, and Mariangiola Dezani-Ciancaglini. Journal of Mathematical Structures in Computer Science, 17:1-59, 2007.
  • Relating Higher-Order and First-Order Rewriting, with Delia Kesner and Alejandro Ríos. Journal of Logic and Computation, 15(6):901-947, 2005.
  • de Bruijn Indices for MetaTerms, with Delia Kesner and Alejandro Ríos, Journal of Logic and Computation, 15(6):855-899, 2005.
  • Correspondence Assertions for Process Synchronization in Concurrent Communications, with Adriana Compagnoni and Elsa Gunter, Journal of Functional Programming, Special issue on Language-Based Security, 15(2):219-247, Cambridge University Press, 2005.
  • Normalisation for Higher-Order Calculi with Explicit Substitutions, Theoretical Computer Science, 333(1-2):91-125, Elsevier, 2005.
  • Perpetuality in a named lambda calculus with explicit substitutions, Journal of Mathematical Structures in Computer Science, 11(1):47-90, Cambridge University Press, 2001.

Conference/Workshop

  • Intuitionistic Hypothetical Logic of Proofs. With Gabriela Steren, 6th Workshop on Intuitionistic Modal Logic and Applications (IMLA 2013).
  • Normalisation for Dynamic Pattern Calculi, with Delia KesnerCarlos LombardiAlejandro Ríos RTA 2012: 117-132.
  • On-the-Fly Inlining of Dynamic Dependency Monitors for Secure Information Flow, with Luciano Bello. Formal Aspects in Security and Trust 2011: 55-69, LNCS 7140, pp. 55-69, 2011.
  • Proceedings 5th International Workshop on Higher-Order RewritingHOR 2010.
  • Justification Logic and History Based Computation, with Francisco Bavera, 7th International Colloquium on Theoretical Aspects of Computing (ICTAC'10), 1-3 September, Natal, Brazil. LNCS 6255, pp. 337-351.
  • Superdevelopments for Weak Reduction, with Pablo Barenbaum, 9th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'09), 28 June 2009, Brasilia, Brasil. EPTCS 15, 2010, pp. 20-31.
  • Robust Declassification for Bytecode, with Francisco Bavera, V Congreso Iberoamericano de Seguridad Informática (CIBSI'09), Montevideo, Uruguay, 16-18 November 2009.
  • Compilación de programas seguros, with Enrique Molinari, Simposio Argentino de Ingeniería de Software (ASSE'09), 38 JAIIO, Mar del Plata, Argentina, 27-28 August 2009.
  • The Logic of Proofs as a Foundation for Certifying Mobile Computation, with Federico Feller, Proc. of the Symposium on Logical Foundations of Computer Science (LFCS'09), Deerfield Beach, Florida, USA, 3-6 January 2009. LNCS 5407:76-91, 2009.
  • Type-Based Information Flow Analysis for Bytecode Languages with Variable Object Field Policies, with Francisco Bavera, Proceedings of the 23rd ACM Symposium on Applied Computing, Fortaleza, Brasil, 16-20 March 2008, pp 347-351, ACM Press.
  • Multipoint Session Types for a Distributed Calculus, with Adriana Compagnoni, Simposium on Trustworthy Global Computing (TGC'07), INRIA Sophia Antipolis, France. 5-6 November 2007. LNCS 4912:240-256, 2008.
  • The Intensional Lambda Calculus, with Sergei Artemov, Symposium on Logical Foundations of Computer Science (LFCS'07), June 4 - 7, 2007, New York, U.S.A. LNCS 4514:12-25, Springer Verlag.
  • The Linear Logical Abstract Machine, Twenty-second Conference on the Mathematical Foundations of Programming Semantics (MFPS'06), University of Genova, Italy, May 24 - May 27, 2006. ENTCS, 158:99-121.
  • Non-Interference for a Typed Assembly Language, with Adriana Compagnoni and Ricardo Medel, Ninth Italian Conference on Theoretical Computer Science (ICTCS'05), Certosa di Pontignano (Siena), Italy, 12-14 October 2005. LNCS 3701, Springer Verlag.
  • Non-Interference for a Typed Assembly Language, with Adriana Compagnoni and Ricardo Medel, Foundations of Computer Security International Workshop, satellite event of LICS05, Chicago, IL, EEUU, 30 June - 1 July 2005.
  • Information-Flow Analysis for a Typed Assembly Language with Polymorphic Stacks, Workshop on Construction and Analysis of Safe, Secure and Interoperable Smart devices (CASSIS'05), Nice, France, 8 March - 11 March 2005. LNCS 3956, Springer Verlag, 2006.
  • Typechecking Safe Process Synchronization, with Adriana Compagnoni y Elsa Gunter, Foundations of Global Ubiquitous Computing (FGUC'04), London, UK, 3-4 September 2004. ENTCS, Elsevier, Volume 138, Issue 1, Pages 3-22.
  • Boxed Ambients with Commmunication Interfaces (BACI), with Adriana Compagnoni, Pablo Garralda and Mariangiola Dezani-Ciancaglini, in the Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS'04), Prague, Czech Republic, August 22-27, 2004. LNCS 3153, pages 119-148, Springer Verlag.
  • Correspondence Assertions for Process Synchronization in Concurrent Communications, with Adriana Compagnoni and Elsa Gunter, in 2nd International Workshop on Foundations of Coordination Languages and Software Architecture (FOCLASA'03), Marseille, France, septiembre 2003. Electronic Notes in Theoretical Computer Science no. 97, pages 175-195, Elsevier Science.
  • A Normalization Result for Higher-Order Calculi with Explicit Substitutions, International Conference on Foundations of Software Science and Computation Structures (FOSSACS'03), satellite event of the European Joint Conferences on Theory and Practice of Software (ETAPS), Warsaw, Poland, April 2003. LNCS 2620, Springer Verlag.
  • Perpetuality for a calculus with explicit substitutions and composition, with A. Arbiser and A. Ríos, Workshop Argentino de Informática Teórica (WAIT'02), 2002, Santa Fe, Argentina.
  • From higher-order to first-order rewriting, with D. Kesner and A. Ríos, 12th International Conference on Rewriting Techniques and Applications (RTA'01), Utrecht, The Netherlands, 2001. LNCS 2051, Springer Verlag.
  • A de Bruijn notation for higher-order rewriting, with D. Kesner and A. Ríos, 11th International Conference on Rewriting Techniques and Applications (RTA'00), Norwich, UK, 2000. LNCS 1833, Springer Verlag.
  • Using fields and explicit substitutions to implement objects and functions in a de Bruijn setting, Annual Conference of the European Association for Computer Science Logic (CSL'99), Madrid, Spain, 1999. LNCS 1683, Springer Verlag.
  • The polymorphic lambda calculus with explicit substitutions, Proceedings of the Second International Workshop on Explicit Subsitutions: Theory and Applications to Programs and Proofs (WESTAPP'99), Trento, Italy, 1999.

PhD Thesis

Explicit Substitutions and Term Rewriting, Université de Paris Sud, Orsay, France. Defended on 8 November 2001.