Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue POPLArticle No.: 33, Pages 970–1000https://doi.org/10.1145/3632875First-order logic, and quantifiers in particular, are widely used in deductive verification of programs and systems. Quantifiers are essential for describing systems with unbounded domains, but prove difficult for automated solvers. Significant effort ...
- research-articleJuly 2022
Eventual consensus in Synod: verification using a failure-aware actor model
Innovations in Systems and Software Engineering (SPISSE), Volume 19, Issue 4Dec 2023, Pages 395–410https://doi.org/10.1007/s11334-022-00463-5AbstractSuccessfully attaining consensus in the absence of a centralized coordinator is a fundamental problem in distributed multi-agent systems. We analyze progress in the Synod consensus protocol—which does not assume a unique leader—under the ...
- posterApril 2022
Styx++: Reliable Data Access and Availability Using a Hybrid Paxos and Chain Replication Protocol
CHI EA '22: Extended Abstracts of the 2022 CHI Conference on Human Factors in Computing SystemsApril 2022, Article No.: 323, Pages 1–7https://doi.org/10.1145/3491101.3519635HCI research often involves accessing and storing information in databases. However, in case of a database node failure, researchers could experience significant work delays, monetary costs, and data loss. How can researchers who have little or no ...
- research-articleApril 2022
Relaxed Paxos: quorum intersection revisited (again)
PaPoC '22: Proceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed DataApril 2022, Pages 16–23https://doi.org/10.1145/3517209.3524040Distributed consensus, the ability to reach agreement in the face of failures, is a fundamental primitive for constructing reliable distributed systems. The Paxos algorithm is synonymous with consensus and widely utilized in production. Paxos uses two ...
- research-articleAugust 2021
Multi-shot distributed transaction commit
Distributed Computing (DICO), Volume 34, Issue 4Aug 2021, Pages 301–318https://doi.org/10.1007/s00446-021-00389-4AbstractAtomic Commit Problem (ACP) is a single-shot agreement problem similar to consensus, meant to model the properties of transaction commit protocols in fault-prone distributed systems. We argue that ACP is too restrictive to capture the complexities ...
-
- short-paperJanuary 2021
Fast Flexible Paxos: Relaxing Quorum Intersection for Fast Paxos
ICDCN '21: Proceedings of the 22nd International Conference on Distributed Computing and NetworkingJanuary 2021, Pages 186–190https://doi.org/10.1145/3427796.3427815Paxos, the de facto standard approach to solving distributed consensus, operates in two phases, each of which requires an intersecting quorum of nodes. Multi-Paxos reduces this to one phase by electing a leader but this leader is also a performance ...
- research-articleMarch 2020
Everyone Loves File: Oracle File Storage Service
ACM Transactions on Storage (TOS), Volume 16, Issue 1Article No.: 3, Pages 1–29https://doi.org/10.1145/3377877Oracle File Storage Service (FSS) is an elastic filesystem provided as a managed NFS service. A pipelined Paxos implementation underpins a scalable block store that provides linearizable multipage limited-size transactions. Above the block store, a ...
- research-articleOctober 2019
Moderately Complex Paxos Made Simple: High-Level Executable Specification of Distributed Algorithms
PPDP '19: Proceedings of the 21st International Symposium on Principles and Practice of Declarative ProgrammingOctober 2019, Article No.: 15, Pages 1–15https://doi.org/10.1145/3354166.3354180This paper describes the application of a high-level language and method in developing simpler specifications of more complex variants of the Paxos algorithm for distributed consensus. The specifications are for Multi-Paxos with preemption, replicated ...
- ArticleMarch 2019
Paxos Made Wireless: Consensus in the Air
EWSN '19: Proceedings of the 2019 International Conference on Embedded Wireless Systems and NetworksFebruary 2019, Pages 1–12Many applications in low-power wireless networks require complex coordination between their members. Swarms of robots or sensors and actuators in industrial closed-loop control need to coordinate within short periods of time to execute tasks. Failing to ...
- research-articleOctober 2018
Bolt-On Global Consistency for the Cloud
SoCC '18: Proceedings of the ACM Symposium on Cloud ComputingOctober 2018, Pages 55–67https://doi.org/10.1145/3267809.3267835Web services that enable users in multiple regions to collaborate can increase availability and decrease latency by replicating data across data centers. If such a service spreads its data across multiple cloud providers---for the associated performance,...
Modularity for decidability of deductive verification with applications to distributed systems
- Marcelo Taube,
- Giuliano Losa,
- Kenneth L. McMillan,
- Oded Padon,
- Mooly Sagiv,
- Sharon Shoham,
- James R. Wilcox,
- Doug Woos
PLDI 2018: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2018, Pages 662–677https://doi.org/10.1145/3192366.3192414Proof automation can substantially increase productivity in formal verification of complex systems. However, unpredictablility of automated provers in handling quantified formulas presents a major hurdle to usability of these tools. We propose to solve ...
Also Published in:
ACM SIGPLAN Notices: Volume 53 Issue 4, April 2018- research-articleOctober 2017
Paxos made EPR: decidable reasoning about distributed protocols
Proceedings of the ACM on Programming Languages (PACMPL), Volume 1, Issue OOPSLAArticle No.: 108, Pages 1–31https://doi.org/10.1145/3140568Distributed protocols such as Paxos play an important role in many computer systems. Therefore, a bug in a distributed protocol may have tremendous effects. Accordingly, a lot of effort has been invested in verifying such protocols. However, checking ...
- articleJune 2017
Adaptive trade-off between consistency and performance in data replication
Software—Practice & Experience (SPRE), Volume 47, Issue 6June 2017, Pages 891–906https://doi.org/10.1002/spe.2462Replication is widely adopted in modern Internet applications and distributed systems to improve the reliability and performance. Though maintaining the strong consistency among replicas can guarantee the correctness of application behaviors, however, ...
- research-articleApril 2016
Stretching multi-ring Paxos
SAC '16: Proceedings of the 31st Annual ACM Symposium on Applied ComputingApril 2016, Pages 492–499https://doi.org/10.1145/2851613.2851638Internet-scale services rely on data partitioning and replication to provide scalable performance and high availability. Moreover, to reduce user-perceived response times and tolerate disasters (i.e., the failure of a whole datacenter), services are ...
- ArticleOctober 2014
HardPaxos: Replication Hardened against Hardware Errors
SRDS '14: Proceedings of the 2014 IEEE 33rd International Symposium on Reliable Distributed SystemsOctober 2014, Pages 232–241https://doi.org/10.1109/SRDS.2014.13State Machine Replication (SMR) is a common technique to make services fault-tolerant. Practical SMR systems tolerate process crashes, but no hardware errors such as bit flips. Still, hardware errors can cause major service outages, and their rate is ...
- research-articleJune 2014
Bringing Paxos Consensus in Multi-agent Systems
WIMS '14: Proceedings of the 4th International Conference on Web Intelligence, Mining and Semantics (WIMS14)June 2014, Article No.: 51, Pages 1–6https://doi.org/10.1145/2611040.2611099Reaching consensus has long been regarded as one of the most important problems in distributed systems. Being able to do so under failures is addressed by the Paxos family of algorithms which is able to guarantee safety, while probabilistically ...
- articleJune 2014
Seamless Paxos coordinators
Cluster Computing (KLU-CLUS), Volume 17, Issue 2June 2014, Pages 463–473https://doi.org/10.1007/s10586-013-0264-9The Paxos algorithm requires a single correct coordinator process to operate. After a failure, the replacement of the coordinator may lead to a temporary unavailability of the application implemented atop Paxos. So far, this unavailability has been ...
- research-articleDecember 2013
State based Paxos
Middleware Industry '13: Proceedings of the Industrial Track of the 13th ACM/IFIP/USENIX International Middleware ConferenceDecember 2013, Article No.: 4, Pages 1–6https://doi.org/10.1145/2541596.2541600Paxos is an algorithm that provides an elegant and optimal solution to the consensus problem in distributed systems. Despite its conceptual simplicity, industrial strength and high performance implementations of Paxos are very hard. This paper presents ...
- ArticleNovember 2013
Using Paxos to Build a Lightweight, Highly Available Key-Value Data Store
WISA '13: Proceedings of the 2013 10th Web Information System and Application ConferenceNovember 2013, Pages 300–307https://doi.org/10.1109/WISA.2013.63Key-value data store has been widely used in e-commerce systems. The availability issue, which means no data loss and continuous service to users, is quite essential in such systems. This paper presents a lightweight, highly available architecture of key-...
- research-articleOctober 2013
Optimizing Paxos with request exchangeability for highly available web services
Internetware '13: Proceedings of the 5th Asia-Pacific Symposium on InternetwareOctober 2013, Article No.: 28, Pages 1–4https://doi.org/10.1145/2532443.2532477There are a variety of factors such as massive commodity computers, storage, network devices and complex management tasks running behind web services which make web services not available. Replication is an effective solution in that case. There are a ...