Joseph Tassarotti

Orcid: 0000-0001-5692-3347

According to our database1, Joseph Tassarotti authored at least 38 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic.
Proc. ACM Program. Lang., January, 2024

Tachis: Higher-Order Separation Logic with Credits for Expected Costs.
Proc. ACM Program. Lang., 2024

Almost-Sure Termination by Guarded Refinement.
Proc. ACM Program. Lang., 2024

Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs.
Proc. ACM Program. Lang., 2024

A Demonic Outcome Logic for Randomized Nondeterminism.
CoRR, 2024

Approximate Relational Reasoning for Higher-Order Probabilistic Programs.
CoRR, 2024

Modular Verification of Secure and Leakage-Free Systems: From Application Specification to Circuit-Level Implementation.
Proceedings of the ACM SIGOPS 30th Symposium on Operating Systems Principles, 2024

2023
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic - Coq Artifact.
Dataset, October, 2023

Verified Density Compilation for a Probabilistic Programming Language.
Proc. ACM Program. Lang., 2023

Formal Methods for Correct Persistent Programming (Dagstuhl Seminar 23412).
Dagstuhl Reports, 2023

Grove: a Separation-Logic Library for Verifying Distributed Systems (Extended Version).
CoRR, 2023

Grove: a Separation-Logic Library for Verifying Distributed Systems.
Proceedings of the 29th Symposium on Operating Systems Principles, 2023

Verifying vMVCC, a high-performance transaction library using multi-version concurrency control.
Proceedings of the 17th USENIX Symposium on Operating Systems Design and Implementation, 2023

The K2 Architecture for Trustworthy Hardware Security Modules.
Proceedings of the 1st Workshop on Kernel Isolation, Safety and Verification, 2023

2022
Later credits: resourceful reasoning for the later modality.
Proc. ACM Program. Lang., 2022

A separation logic for negative dependence.
Proc. ACM Program. Lang., 2022

Verifying the DaisyNFS concurrent and crash-safe file system with sequential reasoning.
Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation, 2022

2021
Rabia: Simplifying State-Machine Replication Through Randomization.
Proceedings of the SOSP '21: ACM SIGOPS 28th Symposium on Operating Systems Principles, 2021

Transfinite Iris: resolving an existential dilemma of step-indexed separation logic.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

GoJournal: a verified, concurrent, crash-safe journaling system.
Proceedings of the 15th USENIX Symposium on Operating Systems Design and Implementation, 2021

On Building Modular and Elastic Data Structures with Bulk Operations.
Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

A formal proof of PAC learnability for decision stumps.
Proceedings of the CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021

2020
Verification of ML Systems via Reparameterization.
CoRR, 2020

2019
A separation logic for concurrent randomized programs.
Proc. ACM Program. Lang., 2019

A Formal Proof of PAC Learnability for Decision Stumps.
CoRR, 2019

Verifying concurrent, crash-safe systems with Perennial.
Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019

Argosy: verifying layered storage systems with recovery refinement.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Scaling Hierarchical Coreference with Homomorphic Compression.
Proceedings of the 1st Conference on Automated Knowledge Base Construction, 2019

Sketching for Latent Dirichlet-Categorical Models.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
MoSeL: a general, extensible modal framework for interactive proofs in separation logic.
Proc. ACM Program. Lang., 2018

Verified Tail Bounds for Randomized Programs.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

2017
Probabilistic Recurrence Relations for Work and Span of Parallel Algorithms.
CoRR, 2017

A Higher-Order Logic for Concurrent Termination-Preserving Refinement.
Proceedings of the Programming Languages and Systems, 2017

2015
Verifying read-copy-update in a logic for weak memory.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

Efficient Training of LDA on a GPU by Mean-for-Mode Estimation.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Augur: Data-Parallel Probabilistic Modeling.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Augur: a Modeling Language for Data-Parallel Probabilistic Inference.
CoRR, 2013

2012
RockSalt: better, faster, stronger SFI for the x86.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012


  Loading...