Amin Timany

653 total citations
27 papers, 350 citations indexed

About

Amin Timany is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Amin Timany has authored 27 papers receiving a total of 350 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Artificial Intelligence, 14 papers in Computational Theory and Mathematics and 10 papers in Computer Networks and Communications. Recurrent topics in Amin Timany's work include Logic, programming, and type systems (19 papers), Formal Methods in Verification (14 papers) and Security and Verification in Computing (12 papers). Amin Timany is often cited by papers focused on Logic, programming, and type systems (19 papers), Formal Methods in Verification (14 papers) and Security and Verification in Computing (12 papers). Amin Timany collaborates with scholars based in Denmark, Belgium and Netherlands. Amin Timany's co-authors include Lars Birkedal, Robbert Krebbers, Derek Dreyer, Ralf Jung, Dominique Devriese, Arthur Charguéraud, Joseph Tassarotti, Jacques-Henri Jourdan, Bart Jacobs and Paolo G. Giarrusso and has published in prestigious journals such as Journal of the ACM, ACM SIGPLAN Notices and Journal of Functional Programming.

In The Last Decade

Amin Timany

24 papers receiving 343 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Amin Timany Denmark 10 310 160 160 60 31 27 350
Joseph Tassarotti United States 10 253 0.8× 149 0.9× 86 0.5× 80 1.3× 58 1.9× 24 308
David Swasey Germany 5 197 0.6× 116 0.7× 81 0.5× 55 0.9× 22 0.7× 6 221
Aleš Bizjak Denmark 7 219 0.7× 107 0.7× 115 0.7× 50 0.8× 15 0.5× 9 242
Ramana Kumar United Kingdom 10 272 0.9× 66 0.4× 152 0.9× 81 1.4× 37 1.2× 18 302
Kayvan Memarian United Kingdom 7 186 0.6× 127 0.8× 55 0.3× 163 2.7× 27 0.9× 14 266
Lennart Beringer United States 12 384 1.2× 124 0.8× 197 1.2× 105 1.8× 62 2.0× 28 422
Jérémie Koenig United States 9 222 0.7× 138 0.9× 69 0.4× 75 1.3× 39 1.3× 14 259
Gordon Stewart United States 7 191 0.6× 73 0.5× 93 0.6× 60 1.0× 34 1.1× 24 226
Xiongnan Wu United States 7 284 0.9× 165 1.0× 80 0.5× 116 1.9× 80 2.6× 9 329
Vilhelm Sjöberg United States 9 282 0.9× 104 0.7× 103 0.6× 73 1.2× 76 2.5× 22 313

Countries citing papers authored by Amin Timany

Since Specialization
Citations

This map shows the geographic impact of Amin Timany's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Amin Timany with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Amin Timany more than expected).

Fields of papers citing papers by Amin Timany

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Amin Timany. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Amin Timany. The network helps show where Amin Timany may publish in the future.

Co-authorship network of co-authors of Amin Timany

This figure shows the co-authorship network connecting the top 25 collaborators of Amin Timany. A scholar is included among the top collaborators of Amin Timany based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Amin Timany. Amin Timany is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Timany, Amin, et al.. (2025). Reasoning about Weak Isolation Levels in Separation Logic. Proceedings of the ACM on Programming Languages. 9(ICFP). 306–340.
2.
Timany, Amin, et al.. (2024). Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement. Proceedings of the ACM on Programming Languages. 8(POPL). 241–272. 5 indexed citations
3.
Timany, Amin, Robbert Krebbers, Derek Dreyer, & Lars Birkedal. (2024). A Logical Approach to Type Soundness. Journal of the ACM. 71(6). 1–75. 13 indexed citations
4.
Timany, Amin, et al.. (2024). The Logical Essence of Well-Bracketed Control Flow. Proceedings of the ACM on Programming Languages. 8(POPL). 575–603. 1 indexed citations
5.
Timany, Amin, et al.. (2024). Modular Denotational Semantics for Effects with Guarded Interaction Trees. Proceedings of the ACM on Programming Languages. 8(POPL). 332–361. 7 indexed citations
6.
Pereira, Mário, et al.. (2023). Verifying Reliable Network Components in a Distributed Separation Logic with Dependent Separation Protocols. Proceedings of the ACM on Programming Languages. 7(ICFP). 847–877. 6 indexed citations
7.
Timany, Amin, et al.. (2023). Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code. Journal of the ACM. 71(1). 1–59. 5 indexed citations
8.
Pichon-Pharabod, Jean, et al.. (2023). VMSL: A Separation Logic for Mechanised Robust Safety of Virtual Machines Communicating above FF-A. Proceedings of the ACM on Programming Languages. 7(PLDI). 1438–1462. 2 indexed citations
9.
Timany, Amin, et al.. (2023). Modular Verification of State-Based CRDTs in Separation Logic. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
10.
Devriese, Dominique, et al.. (2022). Purity of an ST monad: full abstraction by semantically typed back-translation. Proceedings of the ACM on Programming Languages. 6(OOPSLA1). 1–27. 9 indexed citations
11.
Timany, Amin, et al.. (2022). Modular verification of op-based CRDTs in separation logic. Proceedings of the ACM on Programming Languages. 6(OOPSLA2). 1788–1816. 5 indexed citations
12.
Timany, Amin & Lars Birkedal. (2021). Reasoning about monotonicity in separation logic. Scopus (Elsevier). 91–104. 8 indexed citations
13.
Timany, Amin, et al.. (2021). Mechanized logical relations for termination-insensitive noninterference. Proceedings of the ACM on Programming Languages. 5(POPL). 1–29. 7 indexed citations
14.
Timany, Amin, et al.. (2021). Fully abstract from static to gradual. Proceedings of the ACM on Programming Languages. 5(POPL). 1–30. 8 indexed citations
15.
Timany, Amin, et al.. (2021). Distributed causal memory: modular specification and verification in higher-order distributed separation logic. Proceedings of the ACM on Programming Languages. 5(POPL). 1–29. 9 indexed citations
16.
Timany, Amin, et al.. (2021). Efficient and provable local capability revocation using uninitialized capabilities. Proceedings of the ACM on Programming Languages. 5(POPL). 1–30. 20 indexed citations
17.
Giarrusso, Paolo G., et al.. (2020). Scala step-by-step: soundness for DOT with step-indexed logical relations in Iris. Proceedings of the ACM on Programming Languages. 4(ICFP). 1–29. 8 indexed citations
18.
Timany, Amin & Lars Birkedal. (2019). Mechanized relational verification of concurrent programs with continuations. Proceedings of the ACM on Programming Languages. 3(ICFP). 1–28. 11 indexed citations
19.
Timany, Amin, et al.. (2018). A Logical Relation for Monadic Encapsulation of State: Proving contextual equivalences in the presence of runST. 9 indexed citations
20.
Timany, Amin, et al.. (2017). A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST. Proceedings of the ACM on Programming Languages. 2(POPL). 1–28. 32 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026