default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniil Frumin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Dan Frumin
, Amin Timany, Lars Birkedal:
Modular Denotational Semantics for Effects with Guarded Interaction Trees. Proc. ACM Program. Lang. 8(POPL): 332-361 (2024)- [c10]Niels van der Weide, Dan Frumin:
The Interval Domain in Homotopy Type Theory. Logics and Type Systems in Theory and Practice 2024: 241-256 - [c9]Juan C. Jaramillo, Dan Frumin, Jorge A. Pérez:
Around Classical and Intuitionistic Linear Processes. CONCUR 2024: 30:1-30:19 - [i10]Juan C. Jaramillo, Dan Frumin, Jorge A. Pérez:
Around Classical and Intuitionistic Linear Processes. CoRR abs/2407.06391 (2024) - 2023
- [i9]Alen Arslanagic, Jorge A. Pérez, Dan Frumin:
A Minimal Formulation of Session Types. CoRR abs/2301.05301 (2023) - [i8]Dan Frumin, Amin Timany, Lars Birkedal:
Modular Denotational Semantics for Effects with Guarded Interaction Trees. CoRR abs/2307.08514 (2023) - 2022
- [j4]Dan Frumin, Emanuele D'Osualdo, Bas van den Heuvel, Jorge A. Pérez:
A bunch of sessions: a propositions-as-sessions interpretation of bunched implications in channel-based concurrency. Proc. ACM Program. Lang. 6(OOPSLA2): 841-869 (2022) - [c8]Simon Friis Vindum, Dan Frumin, Lars Birkedal:
Mechanized verification of a fine-grained concurrent queue from meta's folly library. CPP 2022: 100-115 - [c7]Dan Frumin:
Semantic cut elimination for the logic of bunched implications, formalized in Coq. CPP 2022: 291-306 - [i7]Dan Frumin, Emanuele D'Osualdo, Bas van den Heuvel, Jorge A. Pérez:
A Bunch of Sessions: A Propositions-as-Sessions Interpretation of Bunched Implications in Channel-Based Concurrency. CoRR abs/2209.05421 (2022) - 2021
- [j3]Dan Frumin, Robbert Krebbers, Lars Birkedal:
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity. Log. Methods Comput. Sci. 17(3) (2021) - [j2]Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niccolò Veltri, Niels van der Weide:
Bicategories in univalent foundations. Math. Struct. Comput. Sci. 31(10): 1232-1269 (2021) - [c6]Dan Frumin, Robbert Krebbers, Lars Birkedal:
Compositional Non-Interference for Fine-Grained Concurrent Programs. SP 2021: 1416-1433 - [d2]Simon Friis Vindum, Dan Frumin, Lars Birkedal:
Mechanized Verification of a Fine-Grained Concurrent Queue from Meta's Folly Library - Coq Artefact. Zenodo, 2021
- [d1]Simon Friis Vindum, Dan Frumin, Lars Birkedal:
Coq development for "Mechanized Verification of a Fine-Grained Concurrent Queue from Meta's Folly Library". Zenodo, 2021 - [i6]Dan Frumin:
Semantic Cut Elimination for the Logic of Bunched Implications, Formalized in Coq. CoRR abs/2112.05515 (2021) - 2020
- [i5]Dan Frumin, Robbert Krebbers, Lars Birkedal:
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity. CoRR abs/2006.13635 (2020)
2010 – 2019
- 2019
- [j1]Daniil Frumin, Benno van den Berg:
A homotopy-theoretic model of function extensionality in the effective topos. Math. Struct. Comput. Sci. 29(4): 588-614 (2019) - [c5]Dan Frumin, Léon Gondelman, Robbert Krebbers:
Semi-automated Reasoning About Non-determinism in C Expressions. ESOP 2019: 60-87 - [c4]Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niels van der Weide:
Bicategories in Univalent Foundations. FSCD 2019: 5:1-5:17 - [i4]Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niels van der Weide:
Bicategories in Univalent Foundations. CoRR abs/1903.01152 (2019) - [i3]Marko C. J. D. van Eekelen, Daniil Frumin, Herman Geuvers, Léon Gondelman, Robbert Krebbers, Marc Schoolderman, Sjaak Smetsers, Freek Verbeek, Benoît Viguier, Freek Wiedijk:
A benchmark for C program verification. CoRR abs/1904.01009 (2019) - [i2]Dan Frumin, Robbert Krebbers, Lars Birkedal:
Compositional Non-Interference for Fine-Grained Concurrent Programs. CoRR abs/1910.00905 (2019) - 2018
- [c3]Dan Frumin, Herman Geuvers, Léon Gondelman, Niels van der Weide:
Finite sets in homotopy type theory. CPP 2018: 201-214 - [c2]Dan Frumin, Robbert Krebbers, Lars Birkedal:
ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency. LICS 2018: 442-451 - 2017
- [i1]Daniil Frumin, Benno van den Berg:
A homotopy-theoretic model of function extensionality in the effective topos. CoRR abs/1701.08369 (2017) - 2014
- [c1]Daniil Frumin, Irina A. Lomazova:
Branching Processes of Conservative Nested Petri Nets. VPT@CAV 2014: 19-35
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
