Publications
2025
ZENITH: Towards A Formally Verified Highly-Available Control Plane
Proceedings of the ACM SIGCOMM 2025 Conference, 409-433, 2025
Empirical Analysis of Transaction Conflicts in Ethereum and Solana for Parallel Execution
arXiv preprint arXiv:2505.05358, 2025
Access Specification-Aware Software Transactional Memory Techniques for Efficient Execution of Smart Contract Transactions
arXiv preprint arXiv:2503.03203, 2025
LLM-guided Predicate Discovery and Data Augmentation for Learning Likely Program Invariants
Proceedings of the 40th ACM/SIGAPP Symposium on Applied Computing, 1721-1729, 2025
Block Transactional Memory: A Complexity Study
International Symposium on Stabilizing, Safety, and Security of Distributed …, 2025
Persistent HyTM via Fast Path Fine-Grained Locking
arXiv preprint arXiv:2501.14783, 2025
Discovering Likely Invariants for Distributed Systems Through Runtime Monitoring and Learning
International Conference on Verification, Model Checking, and Abstract …, 2025
Guiding Likely Invariant Synthesis on Distributed Systems with Large Language Models
CONFERENCE ON FORMAL METHODS IN COMPUTER-AIDED DESIGN–FMCAD 2025, 226, 2025
Efficient Parallel Execution of Blockchain Transactions Leveraging Conflict Specifications
7th Conference on Advances in Financial Technologies (AFT 2025), 29: 1-29: 26, 2025
Programming Scalable Elastic Services with AEON
ACM Transactions on Computer Systems, 2025
2024
Feasibility of Privacy-Preserving Entity Resolution on Confidential Healthcare Datasets Using Homomorphic Encryption
arXiv preprint arXiv:2405.18430, 2024
Privacy-preserving language model inference with instance obfuscation
arXiv preprint arXiv:2402.08227, 2024
FedGraph: A Research Library and Benchmark for Federated Graph Learning
arXiv preprint arXiv:2410.06340, 2024
Discovering Likely Program Invariants for Persistent Memory
Proceedings of the 39th IEEE/ACM International Conference on Automated …, 2024
2023
The Fence Complexity of Persistent Sets
International Symposium on Stabilizing, Safety, and Security of Distributed …, 2023
Labeling without Seeing? Blind Annotation for Privacy-Preserving Entity Resolution
arXiv preprint arXiv:2308.03734, 2023
SoK: The Ghost Trilemma
arXiv preprint arXiv:2308.02202, 2023
Lessons Learned: Building a Privacy-Preserving Entity Resolution Adaptation of PPJoin using End-to-End Homomorphic Encryption
2023 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW …, 2023
FedML-HE: An efficient homomorphic-encryption-based privacy-preserving federated learning system
arXiv preprint arXiv:2303.10837, 2023
Data-Driven Template-Free Invariant Generation
arXiv preprint arXiv:2312.17527, 2023
2024
FedGCN: convergence-communication tradeoffs in federated training of graph convolutional networks
Advances in neural information processing systems 36, 2024
2023
Street Rep: A Privacy-Preserving Reputation Aggregation System
International Conference on Security and Privacy in Communication Systems …, 2023
ð'ƒ3ð'‰: Privacy-Preserving Path Validation System for Multi-Authority Sliced Networks.
IACR Cryptol. ePrint Arch. 2023, 53, 2023
2022
Secure publish-process-subscribe system for dispersed computing
2022 41st International Symposium on Reliable Distributed Systems (SRDS), 58-68, 2022
Evaluating the Feasibility of a Provably Secure Privacy-Preserving Entity Resolution Adaptation of PPJoin using Homomorphic Encryption
arXiv preprint arXiv:2208.07999, 2022
PREP-UC: A Practical Replicated Persistent Universal Construction
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022
2024
Secure federated learning for neuroimaging
Patterns 5 (8), 2024
2022
The limits of helping in non-volatile memory data structures
International Symposium on Stabilizing, Safety, and Security of Distributed …, 2022
Secure and reliable network updates
ACM Transactions on Privacy and Security 26 (1), 1-41, 2022
2021
Revisiting nakamoto consensus in asynchronous networks: A comprehensive analysis of bitcoin safety and chainquality
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021
Amppere: A universal abstract machine for privacy-preserving entity resolution evaluation
Proceedings of the 30th ACM International Conference on Information …, 2021
Optimal Concurrency for List-Based Sets
Parallel Computing Technologies-16th International Conference, 2021
HashSplit: Exploiting Bitcoin Asynchrony to Violate Common Prefix and Chain Quality
Cryptology ePrint Archive, 2021
2020
RoSCo: robust updates for software-defined networks
IEEE Journal on Selected Areas in Communications 38 (7), 1352-1365, 2020
Plasma: programmable elasticity for stateful cloud computing applications
Proceedings of the Fifteenth European Conference on Computer Systems, 1-15, 2020
Consistent and secure network updates made practical
Proceedings of the 21st International Middleware Conference, 149-162, 2020
Separation and Equivalence results for the Crash-stop and Crash-recovery Shared Memory Models
arXiv preprint arXiv:2012.03692, 2020
Scalable and serializable networked multi-actor programming
Proceedings of the ACM on Programming Languages 4 (OOPSLA), 1-30, 2020
2019
On the cost of concurrency in hybrid transactional memory
arXiv preprint arXiv:1907.02669, 2019
2018
Generalized paxos made byzantine (and less complex)
Algorithms 11 (9), 141, 2018
Inherent limitations of hybrid transactional memory
Distributed Computing 31, 167-185, 2018
2017
Grasping the gap between blocking and non-blocking transactional memories
Journal of Parallel and Distributed Computing 101, 1-16, 2017
Lower bounds for Transactional memory
Bulletin of EATCS 1 (121), 2017
Concurrency and privacy with payment-channel networks
Proceedings of the 2017 ACM SIGSAC conference on computer and communications …, 2017
Programmable elasticity for actor-based cloud applications
Proceedings of the 9th Workshop on Programming Languages and Operating …, 2017
A concurrency-optimal binary search tree
Springer Verlag, 2017
31st International Symposium on Distributed Computing (DISC 2017)
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017
Concurrency and Privacy with Payment-Channel Networks
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
A concurrency-optimal binary search tree
Euro-Par 2017: Parallel Processing: 23rd International Conference on …, 2017
LIPIcs, Volume 91, DISC'17, Complete Volume}}
31st International Symposium on Distributed Computing (DISC 2017) 91, 9, 2017
2016
The misbelief in delay scheduling
Proceedings of the 4th Workshop on Distributed Cloud Computing, 1-6, 2016
Programming scalable cloud services with AEON
Proceedings of the 17th International Middleware Conference, 1-14, 2016
In the search for optimal concurrency
Structural Information and Communication Complexity: 23rd International …, 2016
2015
Progressive transactional memory in time and space
International Conference on Parallel Computing Technologies, 410-425, 2015
Why transactional memory should not be obstruction-free
arXiv preprint arXiv:1502.02725, 2015
A concurrency-optimal list-based set
arXiv preprint arXiv:1502.01633, 2015
On the cost of concurrency in transactional memory
arXiv preprint arXiv:1511.01779, 2015
Inherent limitations of hybrid transactional memory
International Symposium on Distributed Computing, 185-199, 2015
On partial wait-freedom in transactional memory
Proceedings of the 16th International Conference on Distributed Computing …, 2015
Safety and deferred update in transactional memory
Transactional Memory. Foundations, Algorithms, Tools, and Applications: COST …, 2015
2012
Brief announcement: From sequential to concurrent: correctness and relative efficiency
Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012
WTTM 2011: the third workshop on the theory of transactional memory
ACM SIGACT News 43 (1), 87-92, 2012
Optimism for boosting concurrency
arXiv preprint arXiv:1203.4751, 2012
Sharing a Sequential Program: Correctness and Concurrency Analysis
arXiv preprint arXiv:1203.4751, 2012
WTTM 2012, the fourth workshop on the theory of transactional memory
ACM SIGACT News 43 (4), 116-122, 2012
Op mism for boos ng concurrency
arXiv preprint arXiv:1203.4751, 2012
From sequential to concurrent: correctness and relative efficiency (brief announcement)
Principles of Distributed Computing (PODC), 241-242, 2012
What is safe in transactional memory
4th Workshop on the Theory of Transactional Memory, Madeira, Portugal, 2012
Sharing a sequential data structure: correctness definition and concurrency analysis
4th Workshop on the Theory of Transactional Memory, Madeira, Portugal, 2012
From sequential to concurrent: Correctness and relative efficiency
CoRR, abs/1203.4751, 2012
2011
On the cost of concurrency in transactional memory
International Conference On Principles Of Distributed Systems, 112-127, 2011
2010
Transactional memory, linking theory and practice
ACM SIGACT News 41 (4), 109-115, 2010
2005
Brief announcement: a concurrency-optimal list-based set
International Symposium on Distributed Computing, 659, 2005