{"ec_funded":1,"oa":1,"file_date_updated":"2020-07-14T12:44:48Z","date_updated":"2021-01-12T06:50:22Z","pubrep_id":"179","conference":{"start_date":"2014-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"San Diego, USA","end_date":"2014-01-21"},"publisher":"Springer","date_created":"2018-12-11T11:51:45Z","doi":"10.1007/978-3-642-54013-4_10","alternative_title":["LNCS"],"volume":8318,"page":"161 - 181","type":"conference","acknowledgement":"Supported by the Vienna Science and Technology Fund (WWTF) through grant PROSEED.","department":[{"_id":"ToHe"}],"quality_controlled":"1","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"publication_status":"published","intvolume":"      8318","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1392","publist_id":"5817","ddc":["000","005"],"day":"01","has_accepted_license":"1","scopus_import":1,"author":[{"last_name":"Dragoi","first_name":"Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","full_name":"Dragoi, Cezara"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Veith","first_name":"Helmut","full_name":"Veith, Helmut"},{"last_name":"Widder","first_name":"Josef","full_name":"Widder, Josef"},{"last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"}],"oa_version":"Submitted Version","date_published":"2014-01-01T00:00:00Z","title":"A logic-based framework for verifying consensus algorithms","citation":{"ieee":"C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, “A logic-based framework for verifying consensus algorithms,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA, 2014, vol. 8318, pp. 161–181.","apa":"Dragoi, C., Henzinger, T. A., Veith, H., Widder, J., &#38; Zufferey, D. (2014). A logic-based framework for verifying consensus algorithms (Vol. 8318, pp. 161–181). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">https://doi.org/10.1007/978-3-642-54013-4_10</a>","short":"C. Dragoi, T.A. Henzinger, H. Veith, J. Widder, D. Zufferey, in:, Springer, 2014, pp. 161–181.","chicago":"Dragoi, Cezara, Thomas A Henzinger, Helmut Veith, Josef Widder, and Damien Zufferey. “A Logic-Based Framework for Verifying Consensus Algorithms,” 8318:161–81. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">https://doi.org/10.1007/978-3-642-54013-4_10</a>.","ista":"Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. 2014. A logic-based framework for verifying consensus algorithms. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 8318, 161–181.","mla":"Dragoi, Cezara, et al. <i>A Logic-Based Framework for Verifying Consensus Algorithms</i>. Vol. 8318, Springer, 2014, pp. 161–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">10.1007/978-3-642-54013-4_10</a>.","ama":"Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. A logic-based framework for verifying consensus algorithms. In: Vol 8318. Springer; 2014:161-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">10.1007/978-3-642-54013-4_10</a>"},"abstract":[{"lang":"eng","text":"Fault-tolerant distributed algorithms play an important role in ensuring the reliability of many software applications. In this paper we consider distributed algorithms whose computations are organized in rounds. To verify the correctness of such algorithms, we reason about (i) properties (such as invariants) of the state, (ii) the transitions controlled by the algorithm, and (iii) the communication graph. We introduce a logic that addresses these points, and contains set comprehensions with cardinality constraints, function symbols to describe the local states of each process, and a limited form of quantifier alternation to express the verification conditions. We show its use in automating the verification of consensus algorithms. In particular, we give a semi-decision procedure for the unsatisfiability problem of the logic and identify a decidable fragment. We successfully applied our framework to verify the correctness of a variety of consensus algorithms tolerant to both benign faults (message loss, process crashes) and value faults (message corruption)."}],"month":"01","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:44:48Z","creator":"system","file_id":"4859","file_size":444138,"checksum":"bffa33d39be77df0da39defe97eabf84","content_type":"application/pdf","file_name":"IST-2014-179-v1+1_vmcai14.pdf","date_created":"2018-12-12T10:11:06Z"}],"year":"2014"}