{"id":"https://openalex.org/W2908642255","doi":"https://doi.org/10.23919/fmcad.2018.8602993","title":"Complete and Efficient DRAT Proof Checking","display_name":"Complete and Efficient DRAT Proof Checking","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2908642255","doi":"https://doi.org/10.23919/fmcad.2018.8602993","mag":"2908642255"},"language":"en","primary_location":{"id":"doi:10.23919/fmcad.2018.8602993","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2018.8602993","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Formal Methods in Computer Aided Design (FMCAD)","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/A5065502548","display_name":"Adri\u00e1n Rebola-Pardo","orcid":"https://orcid.org/0000-0001-9234-4377"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Adrian Rebola-Pardo","raw_affiliation_strings":["TU Wien"],"affiliations":[{"raw_affiliation_string":"TU Wien","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082561369","display_name":"Lu\u0131\u0301s Cruz-Filipe","orcid":"https://orcid.org/0000-0002-7866-7484"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Luis Cruz-Filipe","raw_affiliation_strings":["University of Southern Denmark"],"affiliations":[{"raw_affiliation_string":"University of Southern Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065502548"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.2019,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57143426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9957000017166138,"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/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.8465446829795837},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7971760630607605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7215932011604309},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.44283366203308105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3763885200023651},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3477073311805725},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3457429111003876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18625038862228394}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.8465446829795837},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7971760630607605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7215932011604309},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.44283366203308105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3763885200023651},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3477073311805725},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3457429111003876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18625038862228394},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.23919/fmcad.2018.8602993","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2018.8602993","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"},{"id":"pmh:oai:sdu.dk:publications/5bc4d8ac-1f4e-4c95-a232-ab1dcb3ee3b5","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/5bc4d8ac-1f4e-4c95-a232-ab1dcb3ee3b5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Rebola-Pardo, A & Cruz-Filipe, L 2019, Complete and Efficient DRAT Proof Checking. in N Bj\u00f8rner & A Gurfinkel (eds), Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design, FMCAD 2018. IEEE, pp. 197-205, Formal Methods in Computer-Aided Design, Austin, Texas, United States, 30/10/2018. https://doi.org/10.23919/FMCAD.2018.8602993","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W60439658","https://openalex.org/W134339645","https://openalex.org/W1518705996","https://openalex.org/W1988882144","https://openalex.org/W2142785340","https://openalex.org/W2145199041","https://openalex.org/W2215982992","https://openalex.org/W2564212270","https://openalex.org/W2604459184","https://openalex.org/W2724300927","https://openalex.org/W2734612968","https://openalex.org/W2741154258","https://openalex.org/W2746765002","https://openalex.org/W2888067689","https://openalex.org/W4245385551","https://openalex.org/W4294345017","https://openalex.org/W6605464382","https://openalex.org/W6688812992","https://openalex.org/W6728495344","https://openalex.org/W6736103066","https://openalex.org/W6740817302","https://openalex.org/W6742100965"],"related_works":["https://openalex.org/W1511249877","https://openalex.org/W1578828174","https://openalex.org/W2950376466","https://openalex.org/W2000943029","https://openalex.org/W2950202488","https://openalex.org/W2604424424","https://openalex.org/W2293004035","https://openalex.org/W18781025","https://openalex.org/W2952519015","https://openalex.org/W188034648"],"abstract_inverted_index":{"DRAT":[0,46,71,91,109,124],"proofs":[1,9,52],"have":[2],"become":[3],"the":[4,20,23,48,55,59,75,80,108,117],"standard":[5,81],"for":[6,36],"verifying":[7],"unsatisfiability":[8],"emitted":[10],"by":[11,77],"modern":[12],"SAT":[13],"solvers.":[14],"However,":[15],"recent":[16],"work":[17],"showed":[18],"that":[19,104,116],"specification":[21,56,76,110,120],"of":[22,45,50,107,123],"format":[24],"differs":[25],"from":[26],"its":[27],"implementation":[28,60,122],"in":[29,88,127],"existing":[30],"tools":[31],"due":[32,99],"to":[33,54,58,69,74,100],"optimizations":[34],"necessary":[35],"efficiency.":[37],"Although":[38],"such":[39,86],"differences":[40,118],"do":[41],"not":[42],"compromise":[43],"soundness":[44],"checkers,":[47],"sets":[49],"correct":[51],"according":[53],"and":[57,121],"are":[61],"incomparable.":[62],"We":[63,84],"discuss":[64],"how":[65],"it":[66],"is":[67,111],"possible":[68],"design":[70],"checkers":[72],"faithful":[73],"carefully":[78],"modifying":[79],"optimization":[82],"techniques.":[83],"implemented":[85],"modifications":[87],"a":[89],"configurable":[90],"checker.":[92],"Our":[93],"experimental":[94],"results":[95],"show":[96,115],"negligible":[97],"overhead":[98],"these":[101],"modifications,":[102],"suggesting":[103],"efficient":[105],"verification":[106],"possible.":[112],"Furthermore,":[113],"we":[114],"between":[119],"often":[125],"arise":[126],"practice.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}