{"id":"https://openalex.org/W2895878038","doi":"https://doi.org/10.1145/3372885.3373816","title":"Verified programming of Turing machines in Coq","display_name":"Verified programming of Turing machines in Coq","publication_year":2020,"publication_date":"2020-01-20","ids":{"openalex":"https://openalex.org/W2895878038","doi":"https://doi.org/10.1145/3372885.3373816","mag":"2895878038"},"language":"en","primary_location":{"id":"doi:10.1145/3372885.3373816","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3372885.3373816","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080496189","display_name":"Yannick Forster","orcid":"https://orcid.org/0000-0002-8676-9819"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Yannick Forster","raw_affiliation_strings":["Saarland University, Germany"],"affiliations":[{"raw_affiliation_string":"Saarland University, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072678855","display_name":"Fabian Kunze","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fabian Kunze","raw_affiliation_strings":["Saarland University, Germany"],"affiliations":[{"raw_affiliation_string":"Saarland University, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036288816","display_name":"Maximilian Wuttke","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maximilian Wuttke","raw_affiliation_strings":["Saarland University, Germany"],"affiliations":[{"raw_affiliation_string":"Saarland University, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080496189"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":1.5479,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.86322847,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"141","issue":null,"first_page":"114","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8033192157745361},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7866989970207214},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6732405424118042},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.6514496803283691},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6386759281158447},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.5976895093917847},{"id":"https://openalex.org/keywords/turing-machine-examples","display_name":"Turing machine examples","score":0.5806567668914795},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.5673289895057678},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.5534055829048157},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48450013995170593},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.47286009788513184}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8033192157745361},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7866989970207214},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6732405424118042},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.6514496803283691},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6386759281158447},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.5976895093917847},{"id":"https://openalex.org/C21176728","wikidata":"https://www.wikidata.org/wiki/Q7854963","display_name":"Turing machine examples","level":5,"score":0.5806567668914795},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.5673289895057678},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.5534055829048157},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48450013995170593},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.47286009788513184},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3372885.3373816","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3372885.3373816","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W50191166","https://openalex.org/W129348609","https://openalex.org/W1653213632","https://openalex.org/W1994584977","https://openalex.org/W2118758698","https://openalex.org/W2166662837","https://openalex.org/W2288657451","https://openalex.org/W2769209754","https://openalex.org/W2811265870","https://openalex.org/W2895878038","https://openalex.org/W2907653511","https://openalex.org/W2978388349","https://openalex.org/W2996703487","https://openalex.org/W4299168120","https://openalex.org/W6636989977"],"related_works":["https://openalex.org/W293759077","https://openalex.org/W3014863312","https://openalex.org/W1662868588","https://openalex.org/W2547364878","https://openalex.org/W1526857708","https://openalex.org/W195780958","https://openalex.org/W2119421720","https://openalex.org/W2348596562","https://openalex.org/W2556768775","https://openalex.org/W4313546668"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,34],"framework":[3,87],"for":[4],"the":[5],"verified":[6],"programming":[7],"of":[8,28,81],"multi-tape":[9],"Turing":[10,41,90],"machines":[11,42],"in":[12,22,73],"Coq.":[13],"Improving":[14],"on":[15,65],"prior":[16],"work":[17],"by":[18],"Asperti":[19],"and":[20,43,51,85],"Ricciotti":[21],"Matita,":[23],"we":[24],"implement":[25,37],"multiple":[26],"layers":[27],"abstraction.":[29],"The":[30,55],"highest":[31],"layer":[32],"allows":[33],"user":[35,56],"to":[36],"nontrivial":[38],"algorithms":[39],"as":[40,47,49],"verify":[44],"their":[45],"correctness,":[46],"well":[48],"time":[50],"space":[52],"complexity":[53],"compositionally.":[54],"can":[57],"do":[58],"so":[59],"without":[60],"ever":[61],"mentioning":[62],"states,":[63],"symbols":[64],"tapes":[66],"or":[67],"transition":[68],"functions:":[69],"They":[70],"write":[71],"programs":[72],"an":[74],"imperative":[75],"language":[76],"with":[77],"registers":[78],"containing":[79],"values":[80],"encodable":[82],"data":[83],"types,":[84],"our":[86],"constructs":[88],"corresponding":[89],"machines.":[91]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}