{"id":"https://openalex.org/W2555163572","doi":"https://doi.org/10.1109/hldvt.2016.7748250","title":"Control-flow guided clause generation for property directed reachability","display_name":"Control-flow guided clause generation for property directed reachability","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2555163572","doi":"https://doi.org/10.1109/hldvt.2016.7748250","mag":"2555163572"},"language":"en","primary_location":{"id":"doi:10.1109/hldvt.2016.7748250","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2016.7748250","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International High Level Design Validation and Test Workshop (HLDVT)","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/A5061256224","display_name":"Xian Li","orcid":"https://orcid.org/0000-0002-1509-9328"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Xian Li","raw_affiliation_strings":["Embedded Systems Group Department of Computer Science University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Embedded Systems Group Department of Computer Science University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081184867","display_name":"Klaus Schneider","orcid":"https://orcid.org/0000-0002-1305-7132"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klaus Schneider","raw_affiliation_strings":["Technische Universitat Kaiserslautern, Kaiserslautern, Rheinland-Pfalz, DE"],"affiliations":[{"raw_affiliation_string":"Technische Universitat Kaiserslautern, Kaiserslautern, Rheinland-Pfalz, DE","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061256224"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":0.3485,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68861648,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"91","issue":null,"first_page":"17","last_page":"24"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9145360589027405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6729713678359985},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6164984703063965},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5947783589363098},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.5667411088943481},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5621861219406128},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5537925958633423},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5399093627929688},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.47231337428092957},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.44417721033096313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42639458179473877},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36758261919021606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2742830514907837},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.24131685495376587},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16717684268951416}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9145360589027405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6729713678359985},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6164984703063965},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5947783589363098},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.5667411088943481},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5621861219406128},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5537925958633423},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5399093627929688},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.47231337428092957},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.44417721033096313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42639458179473877},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36758261919021606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2742830514907837},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.24131685495376587},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16717684268951416},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hldvt.2016.7748250","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2016.7748250","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International High Level Design Validation and Test Workshop (HLDVT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W81626549","https://openalex.org/W162318746","https://openalex.org/W188319126","https://openalex.org/W1528837436","https://openalex.org/W1539325982","https://openalex.org/W1549166962","https://openalex.org/W1566132409","https://openalex.org/W1576648414","https://openalex.org/W1815155750","https://openalex.org/W1875492031","https://openalex.org/W2025995266","https://openalex.org/W2039161303","https://openalex.org/W2118791871","https://openalex.org/W2125023624","https://openalex.org/W2127335869","https://openalex.org/W2136099086","https://openalex.org/W2146839527","https://openalex.org/W2293119804","https://openalex.org/W2396495791","https://openalex.org/W2911375523","https://openalex.org/W3138459719","https://openalex.org/W3149078839","https://openalex.org/W4206455946","https://openalex.org/W6631725144","https://openalex.org/W6632141176"],"related_works":["https://openalex.org/W2032269072","https://openalex.org/W1989788631","https://openalex.org/W1999231617","https://openalex.org/W2961758588","https://openalex.org/W2047831585","https://openalex.org/W4224983736","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W2150468037"],"abstract_inverted_index":{"Property":[0],"directed":[1],"reachability":[2,86],"(PDR)":[3],"has":[4],"been":[5],"introduced":[6],"as":[7,100,104,201],"a":[8,30,128,153,202],"very":[9],"efficient":[10],"verification":[11],"method":[12,27,78,133,218,227],"for":[13,134],"synchronous":[14,135,150],"hardware":[15],"circuits":[16],"which":[17],"is":[18,156,228],"based":[19],"on":[20],"induction":[21,56,62],"rather":[22],"than":[23],"fixpoint":[24],"computation.":[25],"The":[26],"incrementally":[28],"refines":[29],"sequence":[31],"of":[32,69,75,81,87,130,141,149,181,197,215,237],"clause":[33,116,204],"sets":[34],"that":[35,39,64,98,106,137],"over-approximate":[36],"the":[37,67,70,76,85,114,118,131,142,145,168,175,182,195,198,206,212,216,225,235],"states":[38,88,103,171,192],"are":[40,107,172,219],"reachable":[41,71,119,208],"in":[42,174,224],"finitely":[43],"many":[44,101],"steps.":[45],"Even":[46],"being":[47],"valid,":[48],"safety":[49],"properties":[50],"may":[51],"not":[52,229],"be":[53],"provable":[54],"by":[55,112,193],"due":[57],"to":[58,61,96,117,161,205],"so-called":[59],"counterexamples":[60],"(CTIs)":[63],"result":[65],"from":[66,90,110],"over-approximation":[68],"states.":[72],"Crucial":[73],"steps":[74,214],"PDR":[77,132,217,226],"therefore":[79],"consist":[80],"(1)":[82],"deciding":[83],"about":[84],"derived":[89],"counterexamples,":[91],"and":[92,147,165,231],"(2)":[93],"generalizing":[94],"them":[95],"clauses":[97],"cover":[99],"unreachable":[102,173],"possible":[105],"then":[108],"excluded":[109],"consideration":[111],"adding":[113,194],"generated":[115],"state":[120,179,209],"approximation":[121],"sequence.":[122],"In":[123],"this":[124],"paper,":[125],"we":[126,158,186],"describe":[127],"refinement":[129],"programs":[136],"makes":[138],"effective":[139],"use":[140],"distinction":[143],"between":[144],"control-":[146],"dataflow":[148],"programs.":[151],"If":[152,184],"CTI":[154],"candidate":[155],"found,":[157],"reduce":[159],"it":[160],"its":[162],"control-flow":[163,170,199],"part":[164,200],"check":[166],"whether":[167],"obtained":[169],"corresponding":[176],"extended":[177],"finite":[178],"machine":[180],"program.":[183],"so,":[185],"can":[187,232],"immediately":[188],"exclude":[189],"all":[190],"these":[191],"negation":[196],"new":[203],"current":[207],"approximations;":[210],"otherwise,":[211],"usual":[213],"applied.":[220],"This":[221],"additional":[222],"step":[223],"expensive,":[230],"significantly":[233],"increase":[234],"performance":[236],"PDR.":[238]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}