Dan Frumin

23 papers A* 2A 1B 5Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Context-Dependent Effects and Concurrency in Guarded Interaction Trees.
CoRR
Sergei Stepanenko, Emma Nardino, Virgil Marionneau, Dan Frumin, Amin Timany, Lars Birkedal
2025 — conf
Context-Dependent Effects in Guarded Interaction Trees.
ESOP (2)
Sergei Stepanenko, Emma Nardino, Dan Frumin, Amin Timany, Lars Birkedal
2024 B conf
Around Classical and Intuitionistic Linear Processes.
CONCUR
Juan C. Jaramillo, Dan Frumin, Jorge A. Pérez
2024 J jnl
Around Classical and Intuitionistic Linear Processes.
CoRR
Juan C. Jaramillo, Dan Frumin, Jorge A. Pérez
2024 J jnl
Modular Denotational Semantics for Effects with Guarded Interaction Trees.
Proc. ACM Program. Lang.
Dan Frumin, Amin Timany, Lars Birkedal
2024 — conf
The Interval Domain in Homotopy Type Theory.
Logics and Type Systems in Theory and Practice
Niels van der Weide, Dan Frumin
2023 J jnl
A Minimal Formulation of Session Types.
CoRR
Alen Arslanagic, Jorge A. Pérez, Dan Frumin
2023 J jnl
Modular Denotational Semantics for Effects with Guarded Interaction Trees.
CoRR
Dan Frumin, Amin Timany, Lars Birkedal
2022 J jnl
A Bunch of Sessions: A Propositions-as-Sessions Interpretation of Bunched Implications in Channel-Based Concurrency.
CoRR
Dan Frumin, Emanuele D'Osualdo, Bas van den Heuvel, Jorge A. Pérez
2022 J jnl
A bunch of sessions: a propositions-as-sessions interpretation of bunched implications in channel-based concurrency.
Proc. ACM Program. Lang.
Dan Frumin, Emanuele D'Osualdo, Bas van den Heuvel, Jorge A. Pérez
2022 B conf
Mechanized verification of a fine-grained concurrent queue from meta's folly library.
CPP
Simon Friis Vindum, Dan Frumin, Lars Birkedal
2022 B conf
Semantic cut elimination for the logic of bunched implications, formalized in Coq.
CPP
Dan Frumin
2021 J jnl
Bicategories in univalent foundations.
Math. Struct. Comput. Sci.
Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niccolò Veltri, Niels van der Weide
2021 A* conf
Compositional Non-Interference for Fine-Grained Concurrent Programs.
SP
Dan Frumin, Robbert Krebbers, Lars Birkedal
2021 J jnl
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity.
Log. Methods Comput. Sci.
Dan Frumin, Robbert Krebbers, Lars Birkedal
2021 J jnl
Semantic Cut Elimination for the Logic of Bunched Implications, Formalized in Coq.
CoRR
Dan Frumin
2020 J jnl
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity.
CoRR
Dan Frumin, Robbert Krebbers, Lars Birkedal
2019 B conf
Bicategories in Univalent Foundations.
FSCD
Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niels van der Weide
2019 J jnl
Bicategories in Univalent Foundations.
CoRR
Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niels van der Weide
2019 J jnl
Compositional Non-Interference for Fine-Grained Concurrent Programs.
CoRR
Dan Frumin, Robbert Krebbers, Lars Birkedal
2019 A conf
Semi-automated Reasoning About Non-determinism in C Expressions.
ESOP
Dan Frumin, Léon Gondelman, Robbert Krebbers
2018 B conf
Finite sets in homotopy type theory.
CPP
Dan Frumin, Herman Geuvers, Léon Gondelman, Niels van der Weide
2018 A* conf
ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency.
LICS
Dan Frumin, Robbert Krebbers, Lars Birkedal