default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph Tassarotti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Simon Oddershede Gregersen
, Alejandro Aguirre, Philipp G. Haselwarter, Joseph Tassarotti, Lars Birkedal:
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic. Proc. ACM Program. Lang. 8(POPL): 753-784 (2024)- [i16]Simon Oddershede Gregersen, Alejandro Aguirre, Philipp G. Haselwarter, Joseph Tassarotti, Lars Birkedal:
Almost-Sure Termination by Guarded Refinement. CoRR abs/2404.08494 (2024) - [i15]Alejandro Aguirre, Philipp G. Haselwarter, Markus de Medeiros, Kwing Hei Li, Simon Oddershede Gregersen, Joseph Tassarotti, Lars Birkedal:
Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs. CoRR abs/2404.14223 (2024) - [i14]Philipp G. Haselwarter, Kwing Hei Li, Markus de Medeiros, Simon Oddershede Gregersen, Alejandro Aguirre, Joseph Tassarotti, Lars Birkedal:
Tachis: Higher-Order Separation Logic with Credits for Expected Costs. CoRR abs/2405.20083 (2024) - [i13]Philipp G. Haselwarter, Kwing Hei Li, Alejandro Aguirre, Simon Oddershede Gregersen, Joseph Tassarotti, Lars Birkedal:
Approximate Relational Reasoning for Higher-Order Probabilistic Programs. CoRR abs/2407.14107 (2024) - 2023
- [j5]Joseph Tassarotti, Jean-Baptiste Tristan:
Verified Density Compilation for a Probabilistic Programming Language. Proc. ACM Program. Lang. 7(PLDI): 615-637 (2023) - [c19]Anish Athalye, M. Frans Kaashoek, Nickolai Zeldovich, Joseph Tassarotti:
The K2 Architecture for Trustworthy Hardware Security Modules. KISV@SOSP 2023: 26-32 - [c18]Yun-Sheng Chang, Ralf Jung, Upamanyu Sharma, Joseph Tassarotti, M. Frans Kaashoek, Nickolai Zeldovich:
Verifying vMVCC, a high-performance transaction library using multi-version concurrency control. OSDI 2023: 871-886 - [c17]Upamanyu Sharma, Ralf Jung, Joseph Tassarotti, M. Frans Kaashoek, Nickolai Zeldovich:
Grove: a Separation-Logic Library for Verifying Distributed Systems. SOSP 2023: 113-129 - [i12]Simon Oddershede Gregersen, Alejandro Aguirre, Philipp G. Haselwarter, Joseph Tassarotti, Lars Birkedal:
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic. CoRR abs/2301.10061 (2023) - [i11]Upamanyu Sharma, Ralf Jung, Joseph Tassarotti, M. Frans Kaashoek, Nickolai Zeldovich:
Grove: a Separation-Logic Library for Verifying Distributed Systems (Extended Version). CoRR abs/2309.03046 (2023) - [i10]Ori Lahav, Azalea Raad, Joseph Tassarotti, Viktor Vafeiadis, Anton Podkopaev:
Formal Methods for Correct Persistent Programming (Dagstuhl Seminar 23412). Dagstuhl Reports 13(10): 50-64 (2023) - 2022
- [j4]Simon Spies, Lennard Gäher, Joseph Tassarotti, Ralf Jung, Robbert Krebbers, Lars Birkedal, Derek Dreyer:
Later credits: resourceful reasoning for the later modality. Proc. ACM Program. Lang. 6(ICFP): 283-311 (2022) - [j3]Jialu Bao, Marco Gaboardi, Justin Hsu, Joseph Tassarotti:
A separation logic for negative dependence. Proc. ACM Program. Lang. 6(POPL): 1-29 (2022) - [c16]Tej Chajed, Joseph Tassarotti, Mark Theng, M. Frans Kaashoek, Nickolai Zeldovich:
Verifying the DaisyNFS concurrent and crash-safe file system with sequential reasoning. OSDI 2022: 447-463 - 2021
- [c15]Joseph Tassarotti, Koundinya Vajjha, Anindya Banerjee, Jean-Baptiste Tristan:
A formal proof of PAC learnability for decision stumps. CPP 2021: 5-17 - [c14]Kevin Williams, Joe Foster, Athicha Srivirote, Ahmed Hassan, Joseph Tassarotti, Lewis Tseng, Roberto Palmieri:
On Building Modular and Elastic Data Structures with Bulk Operations. ICDCN 2021: 237-238 - [c13]Tej Chajed, Joseph Tassarotti, Mark Theng, Ralf Jung, M. Frans Kaashoek, Nickolai Zeldovich:
GoJournal: a verified, concurrent, crash-safe journaling system. OSDI 2021: 423-439 - [c12]Simon Spies, Lennard Gäher, Daniel Gratzer, Joseph Tassarotti, Robbert Krebbers, Derek Dreyer, Lars Birkedal:
Transfinite Iris: resolving an existential dilemma of step-indexed separation logic. PLDI 2021: 80-95 - [c11]Haochen Pan, Jesse Tuglu, Neo Zhou, Tianshu Wang, Yicheng Shen, Xiong Zheng, Joseph Tassarotti, Lewis Tseng, Roberto Palmieri:
Rabia: Simplifying State-Machine Replication Through Randomization. SOSP 2021: 472-487 - [i9]Haochen Pan, Jesse Tuglu, Neo Zhou, Tianshu Wang, Yicheng Shen, Xiong Zheng, Joseph Tassarotti, Lewis Tseng, Roberto Palmieri:
Rabia: Simplifying State-Machine Replication Through Randomization. CoRR abs/2109.12616 (2021) - [i8]Jialu Bao, Marco Gaboardi, Justin Hsu, Joseph Tassarotti:
A Separation Logic for Negative Dependence. CoRR abs/2111.14917 (2021) - 2020
- [i7]Jean-Baptiste Tristan, Joseph Tassarotti, Koundinya Vajjha, Michael L. Wick, Anindya Banerjee:
Verification of ML Systems via Reparameterization. CoRR abs/2007.06776 (2020)
2010 – 2019
- 2019
- [j2]Joseph Tassarotti, Robert Harper:
A separation logic for concurrent randomized programs. Proc. ACM Program. Lang. 3(POPL): 64:1-64:30 (2019) - [c10]Joseph Tassarotti, Jean-Baptiste Tristan, Michael L. Wick:
Sketching for Latent Dirichlet-Categorical Models. AISTATS 2019: 256-265 - [c9]Michael L. Wick, Swetasudha Panda, Joseph Tassarotti, Jean-Baptiste Tristan:
Scaling Hierarchical Coreference with Homomorphic Compression. AKBC 2019 - [c8]Tej Chajed, Joseph Tassarotti, M. Frans Kaashoek, Nickolai Zeldovich:
Argosy: verifying layered storage systems with recovery refinement. PLDI 2019: 1054-1068 - [c7]Tej Chajed, Joseph Tassarotti, M. Frans Kaashoek, Nickolai Zeldovich:
Verifying concurrent, crash-safe systems with Perennial. SOSP 2019: 243-258 - [i6]Joseph Tassarotti, Jean-Baptiste Tristan, Koundinya Vajjha:
A Formal Proof of PAC Learnability for Decision Stumps. CoRR abs/1911.00385 (2019) - 2018
- [j1]Robbert Krebbers, Jacques-Henri Jourdan, Ralf Jung, Joseph Tassarotti, Jan-Oliver Kaiser, Amin Timany, Arthur Charguéraud, Derek Dreyer:
MoSeL: a general, extensible modal framework for interactive proofs in separation logic. Proc. ACM Program. Lang. 2(ICFP): 77:1-77:30 (2018) - [c6]Joseph Tassarotti, Robert Harper:
Verified Tail Bounds for Randomized Programs. ITP 2018: 560-578 - [i5]Joseph Tassarotti, Robert Harper:
A Separation Logic for Concurrent Randomized Programs. CoRR abs/1802.02951 (2018) - [i4]Joseph Tassarotti, Jean-Baptiste Tristan, Michael L. Wick:
Sketching for Latent Dirichlet-Categorical Models. CoRR abs/1810.01400 (2018) - 2017
- [c5]Joseph Tassarotti, Ralf Jung, Robert Harper:
A Higher-Order Logic for Concurrent Termination-Preserving Refinement. ESOP 2017: 909-936 - [i3]Joseph Tassarotti, Ralf Jung, Robert Harper:
A Higher-Order Logic for Concurrent Termination-Preserving Refinement. CoRR abs/1701.05888 (2017) - [i2]Joseph Tassarotti:
Probabilistic Recurrence Relations for Work and Span of Parallel Algorithms. CoRR abs/1704.02061 (2017) - 2015
- [c4]Jean-Baptiste Tristan, Joseph Tassarotti, Guy L. Steele Jr.:
Efficient Training of LDA on a GPU by Mean-for-Mode Estimation. ICML 2015: 59-68 - [c3]Joseph Tassarotti, Derek Dreyer, Viktor Vafeiadis:
Verifying read-copy-update in a logic for weak memory. PLDI 2015: 110-120 - 2014
- [c2]Jean-Baptiste Tristan, Daniel Huang, Joseph Tassarotti, Adam Craig Pocock, Stephen J. Green, Guy L. Steele Jr.:
Augur: Data-Parallel Probabilistic Modeling. NIPS 2014: 2600-2608 - 2013
- [i1]Jean-Baptiste Tristan, Daniel Huang, Joseph Tassarotti, Adam Craig Pocock, Stephen J. Green, Guy L. Steele Jr.:
Augur: a Modeling Language for Data-Parallel Probabilistic Inference. CoRR abs/1312.3613 (2013) - 2012
- [c1]Greg Morrisett, Gang Tan, Joseph Tassarotti, Jean-Baptiste Tristan, Edward Gan:
RockSalt: better, faster, stronger SFI for the x86. PLDI 2012: 395-404
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-07 22:09 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:
