{"id":"https://openalex.org/W4200404817","doi":"https://doi.org/10.1145/3497775.3503683","title":"Safe, fast, concurrent proof checking for the lambda-pi calculus modulo rewriting","display_name":"Safe, fast, concurrent proof checking for the lambda-pi calculus modulo rewriting","publication_year":2022,"publication_date":"2022-01-11","ids":{"openalex":"https://openalex.org/W4200404817","doi":"https://doi.org/10.1145/3497775.3503683"},"language":"en","primary_location":{"id":"doi:10.1145/3497775.3503683","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3497775.3503683","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3497775.3503683","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3497775.3503683","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007174926","display_name":"Michael F\u00e4rber","orcid":"https://orcid.org/0000-0003-1634-9525"},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Michael F\u00e4rber","raw_affiliation_strings":["University of Innsbruck, Austria"],"raw_orcid":"https://orcid.org/0000-0003-1634-9525","affiliations":[{"raw_affiliation_string":"University of Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007174926"],"corresponding_institution_ids":["https://openalex.org/I190249584"],"apc_list":null,"apc_paid":null,"fwci":0.6937,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73928563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"238"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11424","display_name":"Security and Verification in Computing","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9947999715805054,"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/mathematical-proof","display_name":"Mathematical proof","score":0.7811073064804077},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.67421555519104},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.6387838125228882},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6044524908065796},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.5760671496391296},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.5543627738952637},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5432549118995667},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5313540101051331},{"id":"https://openalex.org/keywords/structural-proof-theory","display_name":"Structural proof theory","score":0.5203482508659363},{"id":"https://openalex.org/keywords/automated-proof-checking","display_name":"Automated proof checking","score":0.4437715709209442},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.4281073212623596},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.38144367933273315},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.37433093786239624},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3391548693180084},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3313255310058594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30258482694625854},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.2136494219303131}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7811073064804077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.67421555519104},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.6387838125228882},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6044524908065796},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.5760671496391296},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.5543627738952637},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5432549118995667},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5313540101051331},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.5203482508659363},{"id":"https://openalex.org/C13766981","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Automated proof checking","level":3,"score":0.4437715709209442},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.4281073212623596},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.38144367933273315},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.37433093786239624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3391548693180084},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3313255310058594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30258482694625854},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.2136494219303131},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3497775.3503683","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3497775.3503683","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3497775.3503683","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03143359v2","is_oa":true,"landing_page_url":"https://hal.inria.fr/hal-03143359","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"11th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP \u201922)","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:HAL:hal-03143359v3","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03143359","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://popl22.sigplan.org/home/CPP-2022","raw_type":"Conference papers"}],"best_oa_location":{"id":"doi:10.1145/3497775.3503683","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3497775.3503683","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3497775.3503683","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6648186743","display_name":null,"funder_award_id":"J 4386","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4200404817.pdf","grobid_xml":"https://content.openalex.org/works/W4200404817.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W86357118","https://openalex.org/W195012021","https://openalex.org/W1493752083","https://openalex.org/W1505380256","https://openalex.org/W1545026645","https://openalex.org/W1571434026","https://openalex.org/W1600435877","https://openalex.org/W1701372208","https://openalex.org/W1825294361","https://openalex.org/W1857315623","https://openalex.org/W1863201158","https://openalex.org/W1974190112","https://openalex.org/W1974984092","https://openalex.org/W2038098277","https://openalex.org/W2054859958","https://openalex.org/W2075352622","https://openalex.org/W2113188536","https://openalex.org/W2113241596","https://openalex.org/W2140583545","https://openalex.org/W2151295754","https://openalex.org/W2153177892","https://openalex.org/W2183252337","https://openalex.org/W2246135666","https://openalex.org/W2413857186","https://openalex.org/W2565018286","https://openalex.org/W2809925811","https://openalex.org/W2962903681","https://openalex.org/W2963412521","https://openalex.org/W2969690567","https://openalex.org/W2975454041","https://openalex.org/W3014794612","https://openalex.org/W3037810651","https://openalex.org/W3105533413","https://openalex.org/W4393797906","https://openalex.org/W6604894765"],"related_works":["https://openalex.org/W3163122332","https://openalex.org/W2795365301","https://openalex.org/W1852954869","https://openalex.org/W3100311625","https://openalex.org/W1524804222","https://openalex.org/W2463700520","https://openalex.org/W2299966805","https://openalex.org/W840808322","https://openalex.org/W1961313574","https://openalex.org/W2735509904"],"abstract_inverted_index":{"Several":[0],"proof":[1,21,39,71,100,114,131],"assistants,":[2],"such":[3],"as":[4],"Isabelle":[5],"or":[6,30],"Coq,":[7],"can":[8],"concurrently":[9,61],"check":[10],"multiple":[11],"proofs.":[12],"In":[13],"contrast,":[14],"the":[15,36,47,76,98,123,126],"vast":[16],"majority":[17],"of":[18,38,49,91,108,125,130],"today's":[19],"small":[20],"checkers":[22],"either":[23],"does":[24],"not":[25],"support":[26],"concurrency":[27],"at":[28],"all":[29,107],"only":[31],"limited":[32],"forms":[33],"thereof,":[34],"restricting":[35],"efficiency":[37],"checking":[40,132],"on":[41,106],"multi-core":[42],"processors.":[43],"This":[44,64],"work":[45],"shows":[46],"design":[48,65],"a":[50,69,89],"small,":[51],"memory-":[52],"and":[53,62,116],"thread-safe":[54],"kernel":[55],"that":[56],"efficiently":[57],"checks":[58],"proofs":[59],"both":[60],"sequentially.":[63],"is":[66,82,95],"implemented":[67],"in":[68],"new":[70],"checker":[72,101],"called":[73],"Kontroli":[74,94,121],"for":[75,102],"lambda-Pi":[77],"calculus":[78],"modulo":[79],"rewriting,":[80],"which":[81],"an":[83],"established":[84],"framework":[85],"to":[86,138],"uniformly":[87],"express":[88],"multitude":[90],"logical":[92],"systems.":[93],"faster":[96],"than":[97],"reference":[99],"this":[103],"calculus,":[104],"Dedukti,":[105],"five":[109],"evaluated":[110],"datasets":[111],"obtained":[112],"from":[113],"assistants":[115],"interactive":[117],"theorem":[118],"provers.":[119],"Furthermore,":[120],"reduces":[122],"time":[124],"most":[127],"time-consuming":[128],"part":[129],"using":[133],"eight":[134],"threads":[135],"by":[136],"up":[137],"6.6x.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2021-12-31T00:00:00"}