Eduardo Bonelli - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Eduardo Bonelli' as author, editor, or advisor:

Boxed ambients with communication interfacesPablo Garralda, Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini. mscs, 17(4):587-645, 2007. [doi]
Reductions in Higher-Order Rewriting and Their EquivalencePablo Barenbaum, Eduardo Bonelli. csl 2023: [doi]
Efficient Type Checking for Path PolymorphismJuan Edi, Andrés Viso, Eduardo Bonelli. TYPES 2018: [doi]
Type Soundness for Path PolymorphismAndrés Viso, Eduardo Bonelli, Mauricio Ayala-Rincón. ENTCS, 323:235-251, 2016. [doi]
Correspondence assertions for process synchronization in concurrent communicationsEduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter. JFP, 15(2):219-247, 2005. [doi]
Multipoint Session Types for a Distributed CalculusEduardo Bonelli, Adriana B. Compagnoni. tgc 2008: 240-256 [doi]
The first-order hypothetical logic of proofsGabriela Steren, Eduardo Bonelli. logcom, 27(4):1023-1066, 2017. [doi]
On-the-Fly Inlining of Dynamic Dependency Monitors for Secure Information FlowLuciano Bello, Eduardo Bonelli. ifip1-7 2012: 55-69 [doi]
On abstract normalisation beyond needednessEduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos. TCS, 672:36-63, 2017. [doi]
Optimality and the Linear Substitution CalculusPablo Barenbaum, Eduardo Bonelli. RTA 2017: [doi]
de Bruijn Indices for MetatermsEduardo Bonelli, Delia Kesner, Alejandro Ríos. logcom, 15(6):855-899, 2005. [doi]
From Higher-Order to First-Order RewritingEduardo Bonelli, Delia Kesner, Alejandro Ríos. RTA 2001: 47-62 [doi]
Normalisation for higher-order calculi with explicit substitutionsEduardo Bonelli. TCS, 333(1-2):91-125, 2005. [doi]
Justification logic and audited computationFrancisco Bavera, Eduardo Bonelli. logcom, 28(5):909-934, 2018. [doi]
Correspondence Assertions for Process Synchronization in Concurrent CommunicationsEduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter. ENTCS, 97:175-195, 2004. [doi]
A nonstandard standardization theoremBeniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi. POPL 2014: 659-670 [doi]
Justification Logic as a foundation for certifying mobile computationEduardo Bonelli, Federico Feller. APAL, 163(7):935-950, 2012. [doi]
Perpetuality in a named lambda calculus with explicit substitutionsEduardo Bonelli. mscs, 11(1):47-90, 2001.
Justification Logic and History Based ComputationFrancisco Bavera, Eduardo Bonelli. ictac 2010: 337-351 [doi]
BioScape: A Modeling and Simulation Language for Bacteria-Materials InteractionsAdriana B. Compagnoni, Vishakha Sharma, Yifei Bao, Matthew Libera, Svetlana Sukhishvili, Philippe Bidinger, Livio Bioglio, Eduardo Bonelli. ENTCS, 293:35-49, 2013. [doi]
The Intensional Lambda CalculusSergei N. Artëmov, Eduardo Bonelli. lfcs 2007: 12-25 [doi]
Relating Higher-order and First-order RewritingEduardo Bonelli, Delia Kesner, Alejandro Ríos. logcom, 15(6):901-947, 2005. [doi]
A Normalisation Result for Higher-Order Calculi with Explicit SubstitutionsEduardo Bonelli. fossacs 2003: 153-168 [doi]
Foundations of strong call by needThibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner. PACMPL, 1(ICFP), 2017. [doi]
A Typed Assembly Language for Non-interferenceRicardo Medel, Adriana B. Compagnoni, Eduardo Bonelli. ictcs 2005: 360-374 [doi]
Rewrites as Terms through Justification LogicPablo Barenbaum, Eduardo Bonelli. ppdp 2020: [doi]
Strong Bisimulation for Control Operators (Invited Talk)Delia Kesner, Eduardo Bonelli, Andrés Viso. csl 2020: [doi]
Type-based information flow analysis for bytecode languages with variable object field policiesFrancisco Bavera, Eduardo Bonelli. SAC 2008: 347-351 [doi]
A Strong Bisimulation for a Classical Term CalculusEduardo Bonelli, Delia Kesner, Andrés Viso. lmcs, 20(2), 2024. [doi]
Normalisation for Dynamic Pattern CalculiEduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos. RTA 2012: 117-132 [doi]
Information Flow Analysis for a Typed Assembly Language with Polymorphic StacksEduardo Bonelli, Adriana B. Compagnoni, Ricardo Medel. cassis 2006: 37-56 [doi]
A de Bruijn Notation for Higher-Order RewritingEduardo Bonelli, Delia Kesner, Alejandro Ríos. RTA 2000: 62-79
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn SettingEduardo Bonelli. csl 1999: 204-219
Boxed Ambients with Communication InterfacesEduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda. mfcs 2004: 119-148 [doi]
Typed path polymorphismMauricio Ayala-Rincón, Eduardo Bonelli, Juan Edi, Andrés Viso. TCS, 781:111-130, 2019. [doi]
Hypothetical Logic of ProofsEduardo Bonelli, Gabriela Steren. lu, 8(1):103-140, 2014. [doi]
Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended AbstractPablo Barenbaum, Eduardo Bonelli, Kareem Mohamed. ppdp 2018: [doi]
Typechecking Safe Process SynchronizationEduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter. ENTCS, 138(1):3-22, 2005. [doi]
Intuitionistic Hypothetical Logic of ProofsGabriela Steren, Eduardo Bonelli. ENTCS, 300:89-103, 2014. [doi]
The Linear Logical Abstract MachineEduardo Bonelli. ENTCS, 158:99-121, 2006. [doi]
The Logic of Proofs as a Foundation for Certifying Mobile ComputationEduardo Bonelli, Federico Feller. lfcs 2009: 76-91 [doi]
Development of a Wireless Application for Remote Control of Space Test FacilitiesS. Scaranzin, E. Bonelli, F. Saito, F. Scortecci. iswcs 2005: 639-643 [doi]

runs on WebDSL