@inproceedings{maric_consensus_15,
  author  = {Ognjen Mari\'{c} and Christoph Sprenger and David Basin},
  booktitle = {Proc. of DSN},
  title   = {Consensus Refined},
  year    = 2015,
  note = "to appear"
}

@article{charron-bost_heard-model:_2009,
	Author = {Charron-Bost, Bernadette and Schiper, André},
	Journal = {Distributed Computing},
	Number = {1},
	Pages = {49--71},
	Shorttitle = {The Heard-Of model},
	Title = {The Heard-Of model: computing in distributed systems with benign faults},
	Url = {http://link.springer.com/article/10.1007/s00446-009-0084-6},
	Urldate = {2014-06-17},
	Volume = {22},
	Year = {2009}
}

@article{DBLP:journals/afp/DebratM12,
	Author = {Henri Debrat and Stephan Merz},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Url = {http://isa-afp.org/entries/Heard_Of.shtml},
	Journal = {Archive of Formal Proofs},
	Keywords = {distributed computing, fault tolerance, byzantine failures, formal verification; heard-of model},
	Title = {Verifying Fault-Tolerant Distributed Algorithms in the Heard-Of Model},
	Year = {2012}
}

@incollection{chaouch-saad_reduction_2009,
	Abstract = {We consider the verification of algorithms expressed in the Heard-Of Model, a round-based computational model for fault-tolerant distributed computing. Rounds in this model are communication-closed, and we show that every execution recording individual events corresponds to a coarser-grained execution based on global rounds such that the local views of all processes are identical in the two executions. This result helps us to substantially mitigate state-space explosion and verify Consensus algorithms using standard model checking techniques.},
	Author = {Chaouch-Saad, Mouna and Charron-Bost, Bernadette and Merz, Stephan},
	Booktitle = {Reachability Problems},
	Copyright = {\<copyright>2009 Springer Berlin Heidelberg},
	Isbn = {978-3-642-04419-9, 978-3-642-04420-5},
	Keywords = {Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Mathematics of Computing, Theory of Computation},
	Language = {en},
	Noopeditor = {Bournez, Olivier and Potapov, Igor},
	Noopmonth = jan,
	Pages = {93--106},
	Title = {A Reduction Theorem for the Verification of Round-Based Distributed Algorithms},
	Url = {http://link.springer.com/chapter/10.1007/978-3-642-04420-5_10},
	Urldate = {2014-11-11},
	Year = {2009}
}

@inproceedings{lampson_abcds_2001,
	Author = {Lampson, Butler},
	Booktitle = {{PODC}},
	Pages = {13},
	Title = {The {ABCD}'s of {P}axos},
	Url = {http://condor.depaul.edu/dmumaugh/readings/handouts/SE435/Lampson-PAXOS-ABCDs-PDCS-2001.pdf},
	Urldate = {2014-05-08},
	Volume = {1},
	Year = {2001}
}

