Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Manos Kapritsos"'
Autor:
Jacob R. Lorch, Yixuan Chen, Manos Kapritsos, Haojun Ma, Bryan Parno, Shaz Qadeer, Upamanyu Sharma, James R. Wilcox, Xueyuan Zhao
Publikováno v:
ACM Transactions on Programming Languages and Systems. 44:1-39
Safely writing high-performance concurrent programs is notoriously difficult. To aid developers, we introduce Armada, a language and tool designed to formally verify such programs with relatively little effort. Via a C-like language and a small-step,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ca04b838fd0d982a17e2ca366aebfa4
https://doi.org/10.1145/3502491
https://doi.org/10.1145/3502491
Publikováno v:
PODC
In this paper, we examine the Paxos protocol and demonstrate how the discrete numbering of ballots can be leveraged to weaken the conditions for learning. Specifically, we define the notion of consecutive ballots and use this to define Consecutive Qu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12570f1c32e46e026feb3ce99d4e7d5c
https://doi.org/10.1145/3382734.3405700
https://doi.org/10.1145/3382734.3405700
Autor:
Upamanyu Sharma, Yixuan Chen, Xueyuan Zhao, Jacob R. Lorch, James R. Wilcox, Shaz Qadeer, Manos Kapritsos, Bryan Parno
Publikováno v:
PLDI
Safely writing high-performance concurrent programs is notoriously difficult. To aid developers, we introduce Armada, a language and tool designed to formally verify such programs with relatively little effort. Via a C-like language and a small-step,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40de9a43b5ee1e2f887767b5b27bfd03
https://doi.org/10.1145/3385412.3385971
https://doi.org/10.1145/3385412.3385971
Autor:
Michael L. Roberts, Manos Kapritsos, Bryan Parno, Chris Hawblitzel, Srinath Setty, Jon Howell, Jacob R. Lorch, Brian Zill
Publikováno v:
Communications of the ACM. 60:83-92
Distributed systems are notorious for harboring subtle bugs. Verification can, in principle, eliminate these bugs, but it has historically been difficult to apply at full-program scale, much less distributed system scale. We describe a methodology fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c01ad58af6e95ac2cc6b8bbaca8b92d0
https://doi.org/10.1145/3068608
https://doi.org/10.1145/3068608
Autor:
Remzi Can Aksoy, Manos Kapritsos
Publikováno v:
SOSP
This paper presents Aegean, a new approach that allows fault-tolerant replication to be implemented beyond the confines of the client-server model. In today's computing, where services are rarely standalone, traditional replication protocols such as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8208f798b71e8cf4f2c3381d1b9d0a95
https://doi.org/10.1145/3341301.3359663
https://doi.org/10.1145/3341301.3359663
Autor:
Jean-Baptiste Jeannin, Haojun Ma, Karem A. Sakallah, Baris Kasikci, Aman Goel, Manos Kapritsos
Publikováno v:
SOSP
Designing and implementing distributed systems correctly is a very challenging task. Recently, formal verification has been successfully used to prove the correctness of distributed systems. At the heart of formal verification lies a computer-checked
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aef7dfe674e08e1134eb9442c1c9f898
https://doi.org/10.1145/3341301.3359651
https://doi.org/10.1145/3341301.3359651
Autor:
Karem A. Sakallah, Aman Goel, Haojun Ma, Manos Kapritsos, Jean-Baptiste Jeannin, Baris Kasikci
Publikováno v:
HotOS
Distributed systems are notoriously difficult to design and implement correctly. Formal verification provides correctness proofs, and has recently been successfully applied to various distributed systems. At the heart of a typical formal verification
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f05790abafc1fc8bb2b427da0d87716e
https://doi.org/10.1145/3317550.3321451
https://doi.org/10.1145/3317550.3321451
Publikováno v:
SOSP
This paper describes the design, implementation, and evaluation of Callas, a distributed database system that offers to unmodified, transactional ACID applications the opportunity to achieve a level of performance that can currently only be reached b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d5d9d5d5414be710fbbf72938677f12
https://doi.org/10.1145/2815400.2815430
https://doi.org/10.1145/2815400.2815430
Autor:
Bryan Parno, Jon Howell, Srinath Setty, Chris Hawblitzel, Manos Kapritsos, Jacob R. Lorch, Michael L. Roberts, Brian Zill
Publikováno v:
SOSP
Distributed systems are notorious for harboring subtle bugs. Verification can, in principle, eliminate these bugs a priori, but verification has historically been difficult to apply at full-program scale, much less distributed-system scale.We describ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::472bc95a0f84d22bf06a3b550582370c
https://doi.org/10.1145/2815400.2815428
https://doi.org/10.1145/2815400.2815428
Autor:
Lorenzo Alvisi, Allen Clement, Sangmin Lee, Mike Dahlin, Taylor L. Riche, Manos Kapritsos, Yang Wang
Publikováno v:
SOSP
The UpRight library seeks to make Byzantine fault tolerance (BFT) a simple and viable alternative to crash fault tolerance for a range of cluster services. We demonstrate UpRight by producing BFT versions of the Zookeeper lock service and the Hadoop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2db45f36f58bf9fc2908466b371965ec
https://doi.org/10.1145/1629575.1629602
https://doi.org/10.1145/1629575.1629602