{"id":"https://openalex.org/W4236067551","doi":"https://doi.org/10.1109/memcod.2003.1210088","title":"Finding good counter-examples to aid design verification","display_name":"Finding good counter-examples to aid design verification","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W4236067551","doi":"https://doi.org/10.1109/memcod.2003.1210088"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2003.1210088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2003.1210088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.","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/A5008766097","display_name":"G\u00f6rschwin Fey","orcid":"https://orcid.org/0000-0001-6433-6265"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"G. Fey","raw_affiliation_strings":["Institute of Computer Science, University of Bremen, Bremen, Germany","Universitat Bremen, Bremen, Bremen, DE"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]},{"raw_affiliation_string":"Universitat Bremen, Bremen, Bremen, DE","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112775761","display_name":"Rolf Dreschler","orcid":null},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"R. Dreschler","raw_affiliation_strings":["Inst. of Comput. Sci., Bremen Univ., Germany"],"affiliations":[{"raw_affiliation_string":"Inst. of Comput. Sci., Bremen Univ., Germany","institution_ids":["https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008766097"],"corresponding_institution_ids":["https://openalex.org/I180437899"],"apc_list":null,"apc_paid":null,"fwci":1.7725,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.86073111,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"51","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9994999766349792,"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.9970999956130981,"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/debugging","display_name":"Debugging","score":0.8049948215484619},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7357302904129028},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7351771593093872},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.7022040486335754},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7011268734931946},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.6317819952964783},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5888849496841431},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.565802276134491},{"id":"https://openalex.org/keywords/runtime-verification","display_name":"Runtime verification","score":0.5581251978874207},{"id":"https://openalex.org/keywords/functional-verification","display_name":"Functional verification","score":0.5344727635383606},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.46129003167152405},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4541931748390198},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.3998132646083832},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.36123889684677124},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32188475131988525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1177348792552948}],"concepts":[{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.8049948215484619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7357302904129028},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7351771593093872},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.7022040486335754},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7011268734931946},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.6317819952964783},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5888849496841431},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.565802276134491},{"id":"https://openalex.org/C202973057","wikidata":"https://www.wikidata.org/wiki/Q7380130","display_name":"Runtime verification","level":3,"score":0.5581251978874207},{"id":"https://openalex.org/C62460635","wikidata":"https://www.wikidata.org/wiki/Q5508853","display_name":"Functional verification","level":3,"score":0.5344727635383606},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.46129003167152405},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4541931748390198},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3998132646083832},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.36123889684677124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32188475131988525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1177348792552948},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/memcod.2003.1210088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2003.1210088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.","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":3,"referenced_works":["https://openalex.org/W2096541971","https://openalex.org/W2117285997","https://openalex.org/W2127735256"],"related_works":["https://openalex.org/W2106507440","https://openalex.org/W2162615969","https://openalex.org/W3023586562","https://openalex.org/W3120172095","https://openalex.org/W4375857205","https://openalex.org/W3209085687","https://openalex.org/W4386764073","https://openalex.org/W1979906691","https://openalex.org/W2151755292","https://openalex.org/W2549038596"],"abstract_inverted_index":{"Today":[0],"up":[1],"to":[2,13,45,49,83,99],"80%":[3],"of":[4,21,74,106],"the":[5,33,51,69],"design":[6,29,52],"costs":[7],"for":[8,27],"integrated":[9],"circuits":[10],"are":[11,87,102],"due":[12],"verification.":[14],"Verification":[15],"tools":[16],"guarantee":[17],"completeness":[18],"if":[19],"equivalence":[20],"two":[22],"designs":[23],"or":[24],"a":[25,28],"property":[26],"is":[30,40,78,92],"proven.":[31],"In":[32],"other":[34],"case,":[35],"usually":[36],"only":[37],"one":[38,65,105],"counter-example":[39,66],"produced.":[41],"Then":[42],"debugging":[43,58],"has":[44],"be":[46,84],"carried":[47],"out":[48],"locate":[50],"error.":[53],"This":[54],"paper":[55],"investigates,":[56],"how":[57,98],"can":[59],"benefit":[60],"from":[61,104],"using":[62],"more":[63],"than":[64],"generated":[67],"by":[68,94],"verification":[70],"tool.":[71],"The":[72],"problem":[73],"finding":[75],"useful":[76],"counter-examples":[77,101],"theoretically":[79],"analyzed":[80],"and":[81,89],"proven":[82],"difficult.":[85],"Heuristics":[86],"introduced":[88],"their":[90],"quality":[91],"underlined":[93],"experimental":[95],"results.":[96],"Guidelines":[97],"generate":[100],"extracted":[103],"these":[107],"heuristics.":[108]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}