{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:21Z","timestamp":1742913681843,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319661063"},{"type":"electronic","value":"9783319661070"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66107-0_26","type":"book-chapter","created":{"date-parts":[[2017,8,20]],"date-time":"2017-08-20T14:13:59Z","timestamp":1503238439000},"page":"410-426","source":"Crossref","is-referenced-by-count":6,"title":["Schulze Voting as Evidence Carrying Computation"],"prefix":"10.1007","author":[{"given":"Dirk","family":"Pattinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mukesh","family":"Tiwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.entcs.2004.01.035","volume":"113","author":"K Arkoudas","year":"2005","unstructured":"Arkoudas, K., Rinard, M.C.: Deductive runtime certification. Electr. Notes Theoret. Comput. Sci. 113, 45\u201363 (2005)","journal-title":"Electr. Notes Theoret. Comput. Sci."},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1086\/256963","volume":"58","author":"KJ Arrow","year":"1950","unstructured":"Arrow, K.J.: A difficulty in the concept of social welfare. J. Polit. Econ. 58(4), 328\u2013346 (1950)","journal-title":"J. Polit. Econ."},{"issue":"2","key":"26_CR3","first-page":"115","volume":"19","author":"B Beckert","year":"2014","unstructured":"Beckert, B., Gor\u00e9, R., Sch\u00fcrmann, C., Bormer, T., Wang, J.: Verifying voting schemes. J. Inf. Secur. Appl. 19(2), 115\u2013129 (2014)","journal-title":"J. Inf. Secur. Appl."},{"key":"26_CR4","unstructured":"Bertot, Y.: Coinduction in Coq. CoRR, abs\/cs\/0603119 (2006)"},{"key":"26_CR5","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development: Coq\u2019Art the Calculus of Inductive Constructions","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P., Huet, G., Paulin-Mohring, C.: Interactive Theorem Proving and Program Development: Coq\u2019Art the Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer, Berlin (2004). doi:10.1007\/978-3-662-07964-5"},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1093\/imamat\/7.3.273","volume":"7","author":"BA Carr\u00e9","year":"1971","unstructured":"Carr\u00e9, B.A.: An algebra for network routing problems. IMA J. Appl. Math. 7(3), 273 (1971)","journal-title":"IMA J. Appl. Math."},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MSECP.2004.1264852","volume":"2","author":"D Chaum","year":"2004","unstructured":"Chaum, D.: Secret-ballot receipts: true voter-verifiable elections. IEEE Secur. Privacy 2(1), 38\u201347 (2004)","journal-title":"IEEE Secur. Privacy"},{"key":"26_CR8","unstructured":"Cochran, D., Kiniry, J.: Votail: a formally specified and verified ballot counting system for Irish PR-STV elections. In: Pre-proceedings of 1st International Conference on Formal Verification of Object-Oriented Software (FoVeOOS) (2010)"},{"issue":"3\u20134","key":"26_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10472-015-9479-1","volume":"77","author":"LA Hemaspaandra","year":"2016","unstructured":"Hemaspaandra, L.A., Lavaee, R., Menton, C.: Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. Ann. Math. Artif. Intell. 77(3\u20134), 191\u2013223 (2016)","journal-title":"Ann. Math. Artif. Intell."},{"key":"26_CR10","unstructured":"Kozen, D., Silva, A.: Practical coinduction. Math. Struct. Comput. Sci. 1\u201321 (2016)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Kumar, R., Myreen, M.O., Norrish, M., Owens, S.: CakeML: a verified implementation of ML. In: Jagannathan, S., Sewell, P. (eds.) Proceedings of POPL 2014, pp. 179\u2013192. ACM (2014)","DOI":"10.1145\/2578855.2535841"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-69407-6_39","volume-title":"Logic and Theory of Algorithms","author":"P Letouzey","year":"2008","unstructured":"Letouzey, P.: Extraction in Coq: an overview. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 359\u2013369. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-69407-6_39"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Necula, G.C.: Proof-carrying code. In: Lee, P., Henglein, F., Jones, N.D. (eds.) Proceedings of POPL 1997, pp. 106\u2013119. ACM Press (1997)","DOI":"10.1145\/263699.263712"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-319-26350-2_41","volume-title":"AI 2015: Advances in Artificial Intelligence","author":"D Pattinson","year":"2015","unstructured":"Pattinson, D., Sch\u00fcrmann, C.: Vote counting as mathematical proof. In: Pfahringer, B., Renz, J. (eds.) AI 2015. LNCS, vol. 9457, pp. 464\u2013475. Springer, Cham (2015). doi:10.1007\/978-3-319-26350-2_41"},{"key":"26_CR15","unstructured":"Rivest, R.L., Shen, E.: An optimal single-winner preferential voting system based on game theory. In: Conitzer, V., Rothe, J. (eds.) Proceedins of COMSOC 2010. Duesseldorf University Press (2010)"},{"issue":"2","key":"26_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00355-010-0475-4","volume":"36","author":"M Schulze","year":"2011","unstructured":"Schulze, M.: A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method. Soc. Choice Welf. 36(2), 267\u2013303 (2011)","journal-title":"Soc. Choice Welf."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrmann, C.: Electronic elections: trust through engineering. In: Proceedings of RE-VOTE 2009, pp. 38\u201346. IEEE Computer Society (2009)","DOI":"10.1109\/RE-VOTE.2009.4"},{"key":"26_CR18","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139166386","volume-title":"Mathematical Theory of Domains","author":"V Stoltenberg-Hansen","year":"1994","unstructured":"Stoltenberg-Hansen, V., Lindstr\u00f6m, I., Griffor, E.: Mathematical Theory of Domains. Cambridge Tracts in Theoretical Computer Science, vol. 22. Cambridge University Press, Cambridge (1994)"},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"key":"26_CR20","unstructured":"The Wikimedia Foundation. Wikimedia Foundation Board Election Results (2011). https:\/\/meta.wikimedia.org\/wiki\/Wikimedia_Foundation_elections\/Board_elections\/2011\/Results\/en. Accessed 30 May 2017"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66107-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T06:08:34Z","timestamp":1664431714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66107-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319661063","9783319661070"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66107-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}