{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:13:55Z","timestamp":1725995635428},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030024499"},{"type":"electronic","value":"9783030024505"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02450-5_35","type":"book-chapter","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T12:54:57Z","timestamp":1539176097000},"page":"459-463","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Engineering Software for Modular Formalisation and Verification of STV Algorithms"],"prefix":"10.1007","author":[{"given":"Milad K.","family":"Ghale","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,11]]},"reference":[{"key":"35_CR1","unstructured":"CakeML: A Verified Implementation of ML. https:\/\/cakeml.org\/"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Conway, A., Blom, M., Naish, L., Teague, V.: An analysis of New South Wales electronic vote counting. In: Proceeding of ACSW 2017, pp. 24:1\u201324:5 (2017)","DOI":"10.1145\/3014812.3014837"},{"key":"35_CR3","unstructured":"The Coq Theorem Prover. https:\/\/coq.inria.fr\/"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-32747-6_4","volume-title":"E-Voting and Identity","author":"H DeYoung","year":"2012","unstructured":"DeYoung, H., Sch\u00fcrmann, C.: Linear logical voting protocols. In: Kiayias, A., Lipmaa, H. (eds.) Vote-ID 2011. LNCS, vol. 7187, pp. 53\u201370. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32747-6_4"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-68687-5_10","volume-title":"Electronic Voting","author":"MK Ghale","year":"2017","unstructured":"Ghale, M.K., Gor\u00e9, R., Pattinson, D.: A formally verified single transferable voting scheme with fractional values. In: Krimmer, R., Volkamer, M., Braun Binder, N., Kersting, N., Pereira, O., Sch\u00fcrmann, C. (eds.) E-Vote-ID 2017. LNCS, vol. 10615, pp. 163\u2013182. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68687-5_10"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-030-00419-4_4","volume-title":"Electronic Voting","author":"Milad K. Ghale","year":"2018","unstructured":"Ghale, M.K., Gore, R., Pattinson, D., Tiwari, M.: Modular formalisation and verification of STV algorithms. In: Forthcoming E-Vote-ID 2018. LNCS. Springer, Heidelberg (2018)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Ghale, M.K., Pattinson, D., Kummar, R., Norrish, M.: Verified certificate checking for counting votes. In: Forthcoming VSTTE 2018. LNCS. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-030-03592-1_5"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"JY Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR9","unstructured":"HOL Interactive Theorem Prover. https:\/\/hol-theorem-prover.org\/"},{"key":"35_CR10","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":"Dirk Pattinson","year":"2015","unstructured":"Pattinson, D., Sch\u00fcrmann, C.: Vote counting as mathematical proof. In: Australasian Conference on Artificial Intelligence, pp. 464\u2013475 (2015)"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-319-66107-0_26","volume-title":"Interactive Theorem Proving","author":"Dirk Pattinson","year":"2017","unstructured":"Pattinson, D., Tiwari, M.: Schulze voting as evidence carrying computation. In.: Proceedings of ITP, pp. 410\u2013426 (2017)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Verity, F., Pattinson, D.: Formally verified invariants of vote counting schemes. In: ACSW, pp. 31:1\u201331:10 (2017)","DOI":"10.1145\/3014812.3014845"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Cortier, V., Galindo, D., K\u00fcsters, R., M\u00fcller, J., Truderung, T.: Verifiability notions for E-Voting protocols. IACR Cryptology ePrint Archive 2016: 287 (2016)","DOI":"10.1109\/SP.2016.52"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02450-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T06:08:42Z","timestamp":1572070122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02450-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030024499","9783030024505"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02450-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.formal-analysis.com\/icfem\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}