{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:53Z","timestamp":1763467973275,"version":"3.41.0"},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,1,27]],"date-time":"2010-01-27T00:00:00Z","timestamp":1264550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2010,1,27]]},"abstract":"<jats:p>The Paxos consensus protocol can be specified concisely, but is notoriously difficult to implement in practice. We recount our experience building Paxos in Overlog, a distributed declarative programming language. We found that the Paxos algorithm is easily translated to declarative logic, in large part because the primitives used in consensus protocol specifications map directly to simple Overlog constructs such as aggregation and selection. We discuss the programming idioms that appear frequently in our implementation, and the applicability of declarative programming to related application domains.<\/jats:p>","DOI":"10.1145\/1713254.1713261","type":"journal-article","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T13:33:51Z","timestamp":1265117631000},"page":"25-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["I do declare"],"prefix":"10.1145","volume":"43","author":[{"given":"Peter","family":"Alvaro","sequence":"first","affiliation":[{"name":"UC Berkeley"}]},{"given":"Tyson","family":"Condie","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]},{"given":"Neil","family":"Conway","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]},{"given":"Joseph M.","family":"Hellerstein","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]},{"given":"Russell","family":"Sears","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]}],"member":"320","published-online":{"date-parts":[[2010,1,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281103"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/647891.739594"},{"key":"e_1_2_1_3_1","first-page":"144","volume-title":"Proceedings of the Seventh International Conference on Very Large Data Bases","author":"Gray J.","year":"1981"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/567446.567463"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"issue":"4","key":"e_1_2_1_7_1","first-page":"51","article-title":"Paxos made simple","volume":"32","author":"Lamport L.","year":"2001","journal-title":"SIGACT News"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095818"},{"key":"e_1_2_1_9_1","unstructured":"D. Mazi\u00e9res. Paxos made practical. http:\/\/www.scs.stanford.edu\/~dm\/home\/papers\/paxos.pdf January 2007.  D. Mazi\u00e9res. Paxos made practical. http:\/\/www.scs.stanford.edu\/~dm\/home\/papers\/paxos.pdf January 2007."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/7239.7266"},{"key":"e_1_2_1_11_1","unstructured":"S. Mullender editor. Distributed Systems. Addison-Wesley second edition 1993.  S. Mullender editor. Distributed Systems. Addison-Wesley second edition 1993."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645954.675657"},{"key":"e_1_2_1_13_1","first-page":"29","volume-title":"OSDI","author":"Sears R.","year":"2006"},{"key":"e_1_2_1_14_1","unstructured":"B. Szekely and E. Torres. A Paxon evaluation of P2. http:\/\/klinewoods.com\/papers\/p2paxos.pdf.  B. Szekely and E. Torres. A Paxon evaluation of P2. http:\/\/klinewoods.com\/papers\/p2paxos.pdf."}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1713254.1713261","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1713254.1713261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:35Z","timestamp":1750250495000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1713254.1713261"}},"subtitle":["consensus in a logic language"],"short-title":[],"issued":{"date-parts":[[2010,1,27]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,1,27]]}},"alternative-id":["10.1145\/1713254.1713261"],"URL":"https:\/\/doi.org\/10.1145\/1713254.1713261","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2010,1,27]]},"assertion":[{"value":"2010-01-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}