EduardoBonelli

ebonelli@stevens.edu

News

[3/May/23] 2023 Distinguished Teaching Faculty, Student Government Association.
[5/Feb/23] Consider submitting a paper to LSFA 2023, co-located with FSCD 2023.
[1/Jul/21 - 30/Jun/22] Associate Department Chair for Graduate Studies, CS Dept.

Publications [dblp]

2024

Pablo Barenbaum, E.B. and Mariana Milicich: Intersection Types as Evaluation Types, 11th Workshop on Intersection Types and Related Systems (ITRS), 9th July 2024, Tallinn, Estonia (Affiliated with FSCD 2024).

E.B., Delia Kesner, Andrés Viso: A Strong Bisimulation for a Classical Term Calculus, Logical Methods in Computer Science (LMCS), 20(2):1--52, 2024.

2023

Pablo Barenbaum, E.B.: Reductions in Higher-Order Rewriting and Their Equivalence, CSL 2023, University of Warsaw, Warsaw, Poland, February 13-16, 2023, LIPIcs, Volume 252.

2022

Mauricio Ayala-Rincón, E.B.: Proceedings 16th Logical and Semantic Frameworks with Applications, LSFA 2021, Buenos Aires, Argentina (Online), 23rd - 24th July, 2021. EPTCS 357, 2022.

2020

Pablo Barenbaum, E.B.: Rewrites as Terms through Justification Logic. PPDP 2020, ACM Press, 11:1--11:13, 2020.
Delia Kesner, E.B., Andrés Viso: Strong Bisimulation for Control Operators. LIPIcs, Vol. 152, 4:1--4:23, CSL 2020. Invited paper (Delia Kesner)

2019

Mauricio Ayala-Rincón, Eduardo A Bonelli, Juan Edi, Andrés Ezequiel Viso: Typed Path Polymorphism. Theoretical Computer Science. 781: 111-130 (2019).

2018

Pablo Barenbaum, Eduardo Bonelli, Kareem Mohamed: Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need. PPDP 2018. [long version]
Francisco Bavera, E.B.: Justification logic and audited computation. J. Log. Comput. 28(5): 909-934 (2018) (Published online 2015)

2017

Gabriela Steren, E.B.: The first-order hypothetical logic of proofs. J. Log. Comput. 27(4): 1023-1066 (2017) (Published online 2016)
Thibaut Balabonski, Pablo Barenbaum, E.B., Delia Kesner: Foundations of strong call by need. PACMPL 1(ICFP): 20:1-20:29 (2017)
E.B., Delia Kesner, Carlos Lombardi, Alejandro Ríos: On abstract normalisation beyond neededness. Theor. Comput. Sci. 672: 36-63 (2017)
Pablo Barenbaum, E.B.: Optimality and the Linear Substitution Calculus. FSCD 2017: 9:1-9:16

2016

Andrés Viso, E.B., Mauricio Ayala-Rincón: Type Soundness for Path Polymorphism. Electr. Notes Theor. Comput. Sci. 323: 235-251 (2016)

2015

Juan Edi, Andrés Viso, E.B.: Efficient Type Checking for Path Polymorphism. TYPES 2015: 6:1-6:23

2014

Gabriela Steren, E.B.: Intuitionistic Hypothetical Logic of Proofs. Electr. Notes Theor. Comput. Sci. 300: 89-103 (2014)
E.B., Gabriela Steren: Hypothetical Logic of Proofs. Logica Universalis 8(1): 103-140 (2014)
Beniamino Accattoli, E.B., Delia Kesner, Carlos Lombardi: A nonstandard standardization theorem. POPL 2014: 659-670
Mauricio Ayala-Rincón, E.B., Ian Mackie: Proceedings 9th International Workshop on Developments in Computational Models, DCM 2013, Buenos Aires, Argentina, 26 August 2013. EPTCS 144, 2014

2013

Adriana B. Compagnoni, Vishakha Sharma, Yifei Bao, Matthew Libera, Svetlana Sukhishvili, Philippe Bidinger, Livio Bioglio, E.B.: BioScape: A Modeling and Simulation Language for Bacteria-Materials Interactions. Electr. Notes Theor. Comput. Sci. 293: 35-49 (2013)

2012

E.B., Federico Feller: Justification Logic as a foundation for certifying mobile computation. Ann. Pure Appl. Logic 163(7): 935-950 (2012)
E.B., Delia Kesner, Carlos Lombardi, Alejandro Ríos: Normalisation for Dynamic Pattern Calculi. RTA 2012: 117-132

2011

Luciano Bello, E.B.: On-the-Fly Inlining of Dynamic Dependency Monitors for Secure Information Flow. Formal Aspects in Security and Trust 2011: 55-69

2010

Francisco Bavera, E.B.: Justification Logic and History Based Computation. ICTAC 2010: 337-351
E.B.: Proceedings 5th International Workshop on Higher-Order Rewriting, HOR 2010, Edinburgh, UK, July 14, 2010. EPTCS 49, 2010

2009

E.B., Federico Feller: The Logic of Proofs as a Foundation for Certifying Mobile Computation. LFCS 2009: 76-91
E.B., Pablo Barenbaum: Superdevelopments for Weak Reduction. WRS 2009: 20-31

2008

Francisco Bavera, E.B.: Type-based information flow analysis for bytecode languages with variable object field policies. SAC 2008: 347-351

2007

Pablo Garralda, E.B., Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini: Boxed ambients with communication interfaces. Mathematical Structures in Computer Science 17(4): 587-645 (2007)
Sergei N. Artëmov, E.B.: The Intensional Lambda Calculus. LFCS 2007: 12-25
E.B., Adriana B. Compagnoni: Multipoint Session Types for a Distributed Calculus. TGC 2007: 240-256

2006

E.B.: The Linear Logical Abstract Machine. Electr. Notes Theor. Comput. Sci. 158: 99-121 (2006)

2005

E.B., Adriana B. Compagnoni, Elsa L. Gunter: Typechecking Safe Process Synchronization. Electr. Notes Theor. Comput. Sci. 138(1): 3-22 (2005)
E.B., Adriana B. Compagnoni, Elsa L. Gunter: Correspondence assertions for process synchronization in concurrent communications. J. Funct. Program. 15(2): 219-247 (2005)
E.B., Delia Kesner, Alejandro Ríos: de Bruijn Indices for Metaterms. J. Log. Comput. 15(6): 855-899 (2005)
E.B., Delia Kesner, Alejandro Ríos: Relating Higher-order and First-order Rewriting. J. Log. Comput. 15(6): 901-947 (2005)
E.B.: Normalisation for higher-order calculi with explicit substitutions. Theor. Comput. Sci. 333(1-2): 91-125 (2005)
E.B., Adriana B. Compagnoni, Ricardo Medel: Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks. CASSIS 2005: 37-56
Ricardo Medel, Adriana B. Compagnoni, E.B.: A Typed Assembly Language for Non-interference. ICTCS 2005: 360-374

2004

E.B., Adriana B. Compagnoni, Elsa L. Gunter: Correspondence Assertions for Process Synchronization in Concurrent Communications. Electr. Notes Theor. Comput. Sci. 97: 175-195 (2004)
E.B., Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda: Boxed Ambients with Communication Interfaces. MFCS 2004: 119-148

2003

E.B.: A Normalisation Result for Higher-Order Calculi with Explicit Substitutions. FoSSaCS 2003: 153-168

2001

E.B.: Perpetuality in a named lambda calculus with explicit substitutions. Mathematical Structures in Computer Science 11(1): 47-90 (2001)
E.B., Delia Kesner, Alejandro Ríos: From Higher-Order to First-Order Rewriting. RTA 2001: 47-62
E.B.: Explicit Substitutions and Term Rewriting. PhD Thesis. Defended 8 Nov 2001 at Université de Paris Sud.

2000

E.B., Delia Kesner, Alejandro Ríos: A de Bruijn Notation for Higher-Order Rewriting. RTA 2000: 62-79

1999

Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting.

Past Students

Pablo Barenbaum (DC, FCEyN, UBA). Dynamic Semantics of Calculi with Explicit Substitutions at a Distance. Defended PhD thesis on 20/Nov/20.
Andrés Viso (DC, FCEyN, UBA). Un estudio semántico sobre extensiones avanzadas del λ-cálculo: patrones y operadores de control. Defended PhD thesis 22/Jul/20.
Gabriela Steren (DC, FCEyN, UBA). Two Topics in Rewriting: Combinators for Pattern Calculi and the Curry-Howard Isomorphism for the Logic of Proofs. Defended PhD thesis on 15/Dec/2014.
Carlos Lombardi (DC, FCEyN, UBA). Reduction Spaces in Non-Sequential and Infinitary Rewriting Systems. Defended PhD thesis 7/Nov/2014. Co-advised with Alejandro Ríos and Delia Kesner.
Francisco Bavera (DC, FCEyN, UBA). Types for Security Based on Information-Flow Analysis UBA and Audited Computation. Defended PhD thesis 9/Aug/2012.
Carlos Sarraute (ITBA). Automated Attack Planning. Defended PhD thesis 2/Jul/2012. Co-advised with Gerard Ritchiarte.

Recent Teaching

Linear Logic and Computation (CS810). Fall 2022.
Principles of Programming Languages (CS496). See here for notes and source code.
Concurrent Programming (CS511)

Past Events (PC/Chair/SC)

LSFA 2022
LSFA (Steering Committee). [Jul/21 - ]
LSFA 2021 (Chair)
FSCD 2021
ICTAC 2020.
LSFA 2020 (Slides from my talk are here).
ICTAC 2019
LSFA 2018
ICTAC 2018
UNIF 2018
FSCD 2018
FSCD 2016: 1st International Conference on Formal Structures for Computation and Deduction

IWC 2014: 3rd International Workshop on Confluence

DCM 2013: 9th International Workshop on Developments in Computational Models

Workshops - CONCUR 2013

CIbSE 2012: Doctoral Symposium of the XIV Ibero-American Conference on Software Engineering

HOR 2010 (Chair): 5th International Workshop on Higher-Order Rewriting

ASSE 2010: XI Argentine Symposium on Software Engineering

WSegI 2009, WSegI 2010, WSegI 2011: Workshop on Security in Informatics, Argentina

ICE 2017: 2nd International Workshop on Interaction and Concurrency Experience

RTA 2009, 2013: International Conference on Rewriting Techniques and Applications

LSFA 2007, LSFA 2008, LSFA 2009, LSFA 2010, LSFA 2011, LSFA 2013: International Workshop on Logical and Semantic Frameworks, with Applications

WS-FM 2008: 5th International Workshop on Web Services and Formal Methods

WRS 2005: International Workshop in Rewrite Strategies

CLEI 2003, CLEI 2013, CLEI 2014, CLEI 2015: Latin American Conference in Informatics

Awards

Recipient of the 2022 SAA Outstanding Teacher Award, Stevens Alumni Association Board of Directors.
Recipient of the 2019 Alexander Crombie Humphreys Distinguished Teaching Associate Professor Award.