{"id":"https://openalex.org/W4230022168","doi":"https://doi.org/10.1109/fmcad.2016.7886669","title":"Proof certificates for SMT-based model checkers for infinite-state systems","display_name":"Proof certificates for SMT-based model checkers for infinite-state systems","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W4230022168","doi":"https://doi.org/10.1109/fmcad.2016.7886669"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2016.7886669","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2016.7886669","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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/A5062975660","display_name":"Alain Mebsout","orcid":null},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alain Mebsout","raw_affiliation_strings":["The University of Iowa, Iowa City, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046830049","display_name":"Cesare Tinelli","orcid":"https://orcid.org/0000-0002-6726-775X"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cesare Tinelli","raw_affiliation_strings":["The University of Iowa, Iowa City, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8023,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87698995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"117","last_page":"124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7594594955444336},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7163197994232178},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6893876791000366},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6654759645462036},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.6147793531417847},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.6006027460098267},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5704684853553772},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5552772283554077},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5147504806518555},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.48203790187835693},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47458529472351074},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.4600498676300049},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.44832319021224976},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.43662792444229126},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.41714558005332947},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.415812224149704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4058837890625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1477239429950714},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1431683897972107}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7594594955444336},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7163197994232178},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6893876791000366},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6654759645462036},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.6147793531417847},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.6006027460098267},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5704684853553772},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5552772283554077},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5147504806518555},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.48203790187835693},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47458529472351074},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.4600498676300049},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.44832319021224976},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.43662792444229126},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.41714558005332947},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.415812224149704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4058837890625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1477239429950714},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1431683897972107},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","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},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fmcad.2016.7886669","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2016.7886669","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 Formal Methods in Computer-Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W46694604","https://openalex.org/W81349459","https://openalex.org/W585185735","https://openalex.org/W995045374","https://openalex.org/W1148768799","https://openalex.org/W1495266209","https://openalex.org/W1550905057","https://openalex.org/W1554063762","https://openalex.org/W1556462035","https://openalex.org/W1606938409","https://openalex.org/W1967880086","https://openalex.org/W1974190112","https://openalex.org/W2054859958","https://openalex.org/W2087593009","https://openalex.org/W2108443473","https://openalex.org/W2125415493","https://openalex.org/W2140583545","https://openalex.org/W2279061002","https://openalex.org/W2503425026","https://openalex.org/W3138459719","https://openalex.org/W4236140969","https://openalex.org/W4249622686","https://openalex.org/W6617021435","https://openalex.org/W6629648295","https://openalex.org/W6632737755","https://openalex.org/W6828535928"],"related_works":["https://openalex.org/W3098927713","https://openalex.org/W3026697850","https://openalex.org/W3171882411","https://openalex.org/W2491370528","https://openalex.org/W4287123302","https://openalex.org/W1854197585","https://openalex.org/W3041332907","https://openalex.org/W2288352","https://openalex.org/W92909155","https://openalex.org/W2598696527"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,38,83],"dual":[3],"technique":[4],"for":[5,22,142],"generating":[6],"and":[7,34,108,138,146],"verifying":[8],"proof":[9,40,100,114,140],"certificates":[10,141],"in":[11,82,110,127],"SMT-based":[12,51],"model":[13,25,52,73,105,129],"checkers,":[14],"focusing":[15],"on":[16],"proofs":[17],"of":[18,45,69,94,124],"invariant":[19],"properties.":[20],"Certificates":[21],"two":[23,95],"major":[24],"checking":[26],"algorithms":[27],"are":[28],"extracted":[29],"as":[30],"k-inductive":[31],"invariants,":[32],"minimized":[33],"then":[35],"reduced":[36],"to":[37,76,135],"formal":[39],"term":[41],"with":[42],"the":[43,67,72,77,88,92,104,122,128,131],"help":[44],"an":[46,59],"independent":[47,96],"proof-producing":[48],"SMT":[49],"solver.":[50],"checkers":[53],"typically":[54],"translate":[55],"input":[56,75],"problems":[57],"into":[58],"internal":[60,78],"first-order":[61],"logic":[62],"representation.":[63],"In":[64],"our":[65],"approach,":[66],"correctness":[68],"translation":[70],"from":[71],"checker's":[74],"representation":[79],"is":[80,101],"verified":[81],"lightweight":[84],"manner":[85],"by":[86,103],"proving":[87],"observational":[89],"equivalence":[90],"between":[91],"results":[93],"translations.":[97],"This":[98],"second":[99],"done":[102],"checker":[106],"itself":[107],"generates":[109],"turn":[111],"its":[112],"own":[113],"certificate.":[115],"Our":[116],"experimental":[117],"evaluation":[118],"show":[119],"that,":[120],"at":[121],"price":[123],"minimal":[125],"instrumentation":[126],"checker,":[130],"approach":[132],"allows":[133],"one":[134],"efficiently":[136],"generate":[137],"verify":[139],"non-trivial":[143],"transition":[144],"systems":[145],"invariance":[147],"queries.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}