default search action
Amin Timany
Person information
- affiliation: Aarhus University, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Aïna Linn Georges
, Armaël Guéneau
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code. J. ACM 71(1): 3:1-3:59 (2024) - [j18]Amin Timany
Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement. Proc. ACM Program. Lang. 8(POPL): 241-272 (2024) - [j17]Dan Frumin
Modular Denotational Semantics for Effects with Guarded Interaction Trees. Proc. ACM Program. Lang. 8(POPL): 332-361 (2024) - [j16]Amin Timany
The Logical Essence of Well-Bracketed Control Flow. Proc. ACM Program. Lang. 8(POPL): 575-603 (2024) - [e1]Amin Timany, Dmitriy Traytel, Brigitte Pientka, Sandrine Blazy:
Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2024, London, UK, January 15-16, 2024. ACM 2024 [contents] - 2023
- [j15]Abel Nieto, Arnaud Daby-Seesaram, Léon Gondelman, Amin Timany, Lars Birkedal:
Modular Verification of State-Based CRDTs in Separation Logic (Artifact). Dagstuhl Artifacts Ser. 9(2): 15:1-15:5 (2023) - [j14]Léon Gondelman
Verifying Reliable Network Components in a Distributed Separation Logic with Dependent Separation Protocols. Proc. ACM Program. Lang. 7(ICFP): 847-877 (2023) - [j13]Zongyuan Liu
VMSL: A Separation Logic for Mechanised Robust Safety of Virtual Machines Communicating above FF-A. Proc. ACM Program. Lang. 7(PLDI): 1438-1462 (2023) - [c10]Abel Nieto, Arnaud Daby-Seesaram
Modular Verification of State-Based CRDTs in Separation Logic. ECOOP 2023: 22:1-22:27 - [i7]Dan Frumin, Amin Timany, Lars Birkedal:
Modular Denotational Semantics for Effects with Guarded Interaction Trees. CoRR abs/2307.08514 (2023) - 2022
- [j12]Koen Jacobs
Purity of an ST monad: full abstraction by semantically typed back-translation. Proc. ACM Program. Lang. 6(OOPSLA1): 1-27 (2022) - [j11]Abel Nieto
Modular verification of op-based CRDTs in separation logic. Proc. ACM Program. Lang. 6(OOPSLA2): 1788-1816 (2022) - [c9]Thomas Van Strydonck, Aïna Linn Georges, Armaël Guéneau, Alix Trieu, Amin Timany
Proving full-system security properties under multiple attacker models on capability machines. CSF 2022: 80-95 - [d3]Abel Nieto
Modular Verification of Op-Based CRDTs in Separation Logic (Proof Artifact). Zenodo, 2022 - [d2]Abel Nieto
Modular Verification of Op-Based CRDTs in Separation Logic (Proof Artifact). Zenodo, 2022 - 2021
- [j10]Aïna Linn Georges
Efficient and provable local capability revocation using uninitialized capabilities. Proc. ACM Program. Lang. 5(POPL): 1-30 (2021) - [j9]Léon Gondelman, Simon Oddershede Gregersen
Distributed causal memory: modular specification and verification in higher-order distributed separation logic. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [j8]Simon Oddershede Gregersen
Mechanized logical relations for termination-insensitive noninterference. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [j7]Koen Jacobs
Fully abstract from static to gradual. Proc. ACM Program. Lang. 5(POPL): 1-30 (2021) - [c8]Amin Timany
Reasoning about monotonicity in separation logic. CPP 2021: 91-104 - [d1]Thomas Van Strydonck
Proving full-system security properties under multiple attacker models on capability machines: Coq mechanization. Zenodo, 2021 - [i6]Amin Timany
Trillium: Unifying Refinement and Higher-Order Distributed Separation Logic. CoRR abs/2109.07863 (2021) - 2020
- [j6]Andreas Abel, Jesper Cockx
Leibniz equality is isomorphic to Martin-Löf identity, parametrically. J. Funct. Program. 30: e17 (2020) - [j5]Paolo G. Giarrusso, Léo Stefanesco, Amin Timany
Scala step-by-step: soundness for DOT with step-indexed logical relations in Iris. Proc. ACM Program. Lang. 4(ICFP): 114:1-114:29 (2020) - [j4]Ralf Jung
The future is ours: prophecy variables in separation logic. Proc. ACM Program. Lang. 4(POPL): 45:1-45:32 (2020) - [c7]Tobias Reinhard
A separation logic to verify termination of busy-waiting for abrupt program exit. FTfJP@ECOOP 2020: 26-32 - [c6]Morten Krogh-Jespersen, Amin Timany
Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems. ESOP 2020: 336-365 - [i5]Tobias Reinhard
A Separation Logic to Verify Termination of Busy-Waiting for Abrupt Program Exit: Technical Report. CoRR abs/2007.10215 (2020) - [i4]Tobias Reinhard
A Separation Logic to Verify Termination of Busy-Waiting for Abrupt Program Exit. CoRR abs/2010.07800 (2020)
2010 – 2019
- 2019
- [j3]Amin Timany
Mechanized relational verification of concurrent programs with continuations. Proc. ACM Program. Lang. 3(ICFP): 105:1-105:28 (2019) - [c5]Willem Penninckx, Amin Timany
Specifying I/O using abstract nested hoare triples in separation logic. FTfJP@ECOOP 2019: 5:1-5:7 - [i3]Willem Penninckx, Amin Timany
Abstract I/O Specification. CoRR abs/1901.10541 (2019) - 2018
- [j2]Robbert Krebbers, Jacques-Henri Jourdan
MoSeL: a general, extensible modal framework for interactive proofs in separation logic. Proc. ACM Program. Lang. 2(ICFP): 77:1-77:30 (2018) - [j1]Amin Timany
A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST. Proc. ACM Program. Lang. 2(POPL): 64:1-64:28 (2018) - [c4]Amin Timany
Cumulative Inductive Types In Coq. FSCD 2018: 29:1-29:16 - 2017
- [c3]Robbert Krebbers, Amin Timany
Interactive proofs in higher-order concurrent separation logic. POPL 2017: 205-217 - [i2]Amin Timany, Matthieu Sozeau:
Consistency of the Predicative Calculus of Cumulative Inductive Constructions (pCuIC). CoRR abs/1710.03912 (2017) - 2016
- [c2]Amin Timany
Category Theory in Coq 8.5. FSCD 2016: 30:1-30:18 - 2015
- [c1]Amin Timany
First Steps Towards Cumulative Inductive Types in CIC. ICTAC 2015: 608-617 - [i1]Amin Timany, Bart Jacobs:
Category Theory in Coq 8.5. CoRR abs/1505.06430 (2015)
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-24 21:32 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: