Joseph Tassarotti

622 total citations
24 papers, 308 citations indexed

About

Joseph Tassarotti is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Joseph Tassarotti has authored 24 papers receiving a total of 308 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Artificial Intelligence, 10 papers in Computer Networks and Communications and 9 papers in Computational Theory and Mathematics. Recurrent topics in Joseph Tassarotti's work include Distributed systems and fault tolerance (10 papers), Logic, programming, and type systems (8 papers) and Formal Methods in Verification (8 papers). Joseph Tassarotti is often cited by papers focused on Distributed systems and fault tolerance (10 papers), Logic, programming, and type systems (8 papers) and Formal Methods in Verification (8 papers). Joseph Tassarotti collaborates with scholars based in United States, Denmark and Germany. Joseph Tassarotti's co-authors include Jean-Baptiste Tristan, Derek Dreyer, Gang Tan, Edward Gan, Greg Morrisett, Robbert Krebbers, Tej Chajed, Viktor Vafeiadis, M. Frans Kaashoek and Nickolai Zeldovich and has published in prestigious journals such as ACM SIGPLAN Notices, Proceedings of the ACM on Programming Languages and Radboud Repository (Radboud University).

In The Last Decade

Joseph Tassarotti

21 papers receiving 303 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Joseph Tassarotti United States 10 253 149 86 80 58 24 308
Tahina Ramananandro United States 12 335 1.3× 167 1.1× 114 1.3× 107 1.3× 75 1.3× 22 389
Lennart Beringer United States 12 384 1.5× 124 0.8× 197 2.3× 105 1.3× 62 1.1× 28 422
Xiongnan Wu United States 7 284 1.1× 165 1.1× 80 0.9× 116 1.4× 80 1.4× 9 329
Ramana Kumar United Kingdom 10 272 1.1× 66 0.4× 152 1.8× 81 1.0× 37 0.6× 18 302
David Costanzo United States 8 214 0.8× 118 0.8× 59 0.7× 92 1.1× 68 1.2× 8 252
Tej Chajed United States 9 191 0.8× 237 1.6× 43 0.5× 97 1.2× 43 0.7× 19 329
Gordon Stewart United States 7 191 0.8× 73 0.5× 93 1.1× 60 0.8× 34 0.6× 24 226
Sandrine Blazy France 7 253 1.0× 69 0.5× 131 1.5× 89 1.1× 56 1.0× 23 306
Amin Timany Denmark 10 310 1.2× 160 1.1× 160 1.9× 60 0.8× 31 0.5× 27 350
Jérémie Koenig United States 9 222 0.9× 138 0.9× 69 0.8× 75 0.9× 39 0.7× 14 259

Countries citing papers authored by Joseph Tassarotti

Since Specialization
Citations

This map shows the geographic impact of Joseph Tassarotti'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 Joseph Tassarotti with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joseph Tassarotti more than expected).

Fields of papers citing papers by Joseph Tassarotti

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Joseph Tassarotti. 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 Joseph Tassarotti. The network helps show where Joseph Tassarotti may publish in the future.

Co-authorship network of co-authors of Joseph Tassarotti

This figure shows the co-authorship network connecting the top 25 collaborators of Joseph Tassarotti. A scholar is included among the top collaborators of Joseph Tassarotti 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 Joseph Tassarotti. Joseph Tassarotti 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.
Lepoint, Tancrède, et al.. (2025). Verified Foundations for Differential Privacy. Proceedings of the ACM on Programming Languages. 9(PLDI). 1094–1118.
2.
Kozen, Dexter, et al.. (2025). A Demonic Outcome Logic for Randomized Nondeterminism. Proceedings of the ACM on Programming Languages. 9(POPL). 539–568. 2 indexed citations
3.
Tassarotti, Joseph, et al.. (2025). Approximate Relational Reasoning for Higher-Order Probabilistic Programs. Proceedings of the ACM on Programming Languages. 9(POPL). 1196–1226. 2 indexed citations
4.
Athalye, Anish, Henry Corrigan-Gibbs, Frans Kaashoek, Joseph Tassarotti, & Nickolai Zeldovich. (2024). Modular Verification of Secure and Leakage-Free Systems: From Application Specification to Circuit-Level Implementation. 655–672.
5.
Tassarotti, Joseph, et al.. (2024). Almost-Sure Termination by Guarded Refinement. Proceedings of the ACM on Programming Languages. 8(ICFP). 203–233. 1 indexed citations
6.
Tassarotti, Joseph, et al.. (2024). Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs. Proceedings of the ACM on Programming Languages. 8(ICFP). 284–316. 4 indexed citations
7.
Tassarotti, Joseph, et al.. (2024). Asynchronous Probabilistic Couplings in Higher-Order Separation Logic. Proceedings of the ACM on Programming Languages. 8(POPL). 753–784. 8 indexed citations
8.
Tassarotti, Joseph & Jean-Baptiste Tristan. (2023). Verified Density Compilation for a Probabilistic Programming Language. Proceedings of the ACM on Programming Languages. 7(PLDI). 615–637. 1 indexed citations
9.
Tassarotti, Joseph, et al.. (2022). Later credits: resourceful reasoning for the later modality. Proceedings of the ACM on Programming Languages. 6(ICFP). 283–311. 15 indexed citations
10.
Gaboardi, Marco, et al.. (2022). A separation logic for negative dependence. Proceedings of the ACM on Programming Languages. 6(POPL). 1–29. 10 indexed citations
11.
Chajed, Tej, et al.. (2021). GoJournal: a verified, concurrent, crash-safe journaling system. 423–439. 2 indexed citations
12.
Shen, Yi‐Cheng, et al.. (2021). Rabia. Clark Digital Commons (Clark University). 472–487. 8 indexed citations
13.
Chajed, Tej, Joseph Tassarotti, M. Frans Kaashoek, & Nickolai Zeldovich. (2019). Verifying concurrent, crash-safe systems with Perennial. 243–258. 35 indexed citations
14.
Krebbers, Robbert, Jacques-Henri Jourdan, Ralf Jung, et al.. (2018). MoSeL: a general, extensible modal framework for interactive proofs in separation logic. Proceedings of the ACM on Programming Languages. 2(ICFP). 1–30. 53 indexed citations
15.
Tristan, Jean-Baptiste, Joseph Tassarotti, & Guy L. Steele. (2015). Efficient Training of LDA on a GPU by Mean-for-Mode Estimation. International Conference on Machine Learning. 59–68. 10 indexed citations
16.
Tassarotti, Joseph, Derek Dreyer, & Viktor Vafeiadis. (2015). Verifying read-copy-update in a logic for weak memory. ACM SIGPLAN Notices. 50(6). 110–120. 6 indexed citations
17.
Tassarotti, Joseph, Derek Dreyer, & Viktor Vafeiadis. (2015). Verifying read-copy-update in a logic for weak memory. 110–120. 25 indexed citations
18.
Tristan, Jean-Baptiste, et al.. (2014). Augur: Data-Parallel Probabilistic Modeling. 27. 2600–2608. 11 indexed citations
19.
Morrisett, Greg, Gang Tan, Joseph Tassarotti, Jean-Baptiste Tristan, & Edward Gan. (2012). RockSalt. ACM SIGPLAN Notices. 47(6). 395–404. 11 indexed citations
20.
Morrisett, Greg, Gang Tan, Joseph Tassarotti, Jean-Baptiste Tristan, & Edward Gan. (2012). RockSalt. 395–404. 83 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