{"id":"https://openalex.org/W2160730441","doi":"https://doi.org/10.1109/hldvt.2005.1568829","title":"Overlap reduction in symbolic system traversal","display_name":"Overlap reduction in symbolic system traversal","publication_year":2006,"publication_date":"2006-01-18","ids":{"openalex":"https://openalex.org/W2160730441","doi":"https://doi.org/10.1109/hldvt.2005.1568829","mag":"2160730441"},"language":"en","primary_location":{"id":"doi:10.1109/hldvt.2005.1568829","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2005.1568829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Tenth IEEE International High-Level Design Validation and Test Workshop, 2005.","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/A5010126980","display_name":"Prakash Peranandam","orcid":null},"institutions":[{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"P.M. Peranandam","raw_affiliation_strings":["Department of Computer Engineering, University of T\u00fcbingen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of T\u00fcbingen, Germany","institution_ids":["https://openalex.org/I8087733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022136602","display_name":"Pradeep K. Nalla","orcid":null},"institutions":[{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"P.K. Nalla","raw_affiliation_strings":["Department of Computer Engineering, University of T\u00fcbingen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of T\u00fcbingen, Germany","institution_ids":["https://openalex.org/I8087733"]}]},{"author_position":"middle","author":{"id":null,"display_name":"R.J. Weiss","orcid":null},"institutions":[{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"R.J. Weiss","raw_affiliation_strings":["Department of Computer Engineering, University of T\u00fcbingen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of T\u00fcbingen, Germany","institution_ids":["https://openalex.org/I8087733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110113933","display_name":"J. Ruf","orcid":null},"institutions":[{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J. Ruf","raw_affiliation_strings":["Department of Computer Engineering, University of T\u00fcbingen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of T\u00fcbingen, Germany","institution_ids":["https://openalex.org/I8087733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111985942","display_name":"Thomas Kr\u00f6pf","orcid":null},"institutions":[{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"T. Kropf","raw_affiliation_strings":["Department of Computer Engineering, University of T\u00fcbingen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of T\u00fcbingen, Germany","institution_ids":["https://openalex.org/I8087733"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087076980","display_name":"Wolfgang Rosenstiel","orcid":null},"institutions":[{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"W. Rosenstiel","raw_affiliation_strings":["Department of Computer Engineering, University of T\u00fcbingen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of T\u00fcbingen, Germany","institution_ids":["https://openalex.org/I8087733"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5010126980"],"corresponding_institution_ids":["https://openalex.org/I8087733"],"apc_list":null,"apc_paid":null,"fwci":1.3541,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.82133298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"58","issue":null,"first_page":"145","last_page":"152"},"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.995199978351593,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/tree-traversal","display_name":"Tree traversal","score":0.8493847846984863},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6938912272453308},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6493868827819824},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6411849856376648},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6077843308448792},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.576202929019928},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5399385094642639},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.518115222454071},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4892129898071289},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.48783472180366516},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4876386225223541},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.48395898938179016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48098719120025635},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47656989097595215},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.43761131167411804},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43744516372680664},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.42998722195625305},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.326099157333374},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09136521816253662}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8493847846984863},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6938912272453308},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6493868827819824},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6411849856376648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6077843308448792},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.576202929019928},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5399385094642639},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.518115222454071},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4892129898071289},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.48783472180366516},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4876386225223541},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.48395898938179016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48098719120025635},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47656989097595215},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.43761131167411804},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43744516372680664},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.42998722195625305},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.326099157333374},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09136521816253662},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hldvt.2005.1568829","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2005.1568829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Tenth IEEE International High-Level Design Validation and Test Workshop, 2005.","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":30,"referenced_works":["https://openalex.org/W1492561650","https://openalex.org/W1500983681","https://openalex.org/W1543442775","https://openalex.org/W1569305728","https://openalex.org/W1583869287","https://openalex.org/W1600140696","https://openalex.org/W1802780861","https://openalex.org/W1839466040","https://openalex.org/W1853488118","https://openalex.org/W1965690669","https://openalex.org/W1979520342","https://openalex.org/W2008212717","https://openalex.org/W2030224590","https://openalex.org/W2034695828","https://openalex.org/W2061438988","https://openalex.org/W2088572430","https://openalex.org/W2104994971","https://openalex.org/W2113251992","https://openalex.org/W2122809061","https://openalex.org/W2133143481","https://openalex.org/W2145343136","https://openalex.org/W2152154822","https://openalex.org/W2163401477","https://openalex.org/W2401075618","https://openalex.org/W2913459036","https://openalex.org/W4235197231","https://openalex.org/W4246045935","https://openalex.org/W4250225510","https://openalex.org/W4285719527","https://openalex.org/W6713011746"],"related_works":["https://openalex.org/W2109998394","https://openalex.org/W2133491672","https://openalex.org/W2187008505","https://openalex.org/W4248224315","https://openalex.org/W2169792446","https://openalex.org/W1995041806","https://openalex.org/W1967845326","https://openalex.org/W4389483408","https://openalex.org/W3187430668","https://openalex.org/W2390183607"],"abstract_inverted_index":{"A":[0],"divide-and-conquer":[1],"approach":[2],"in":[3,41,75,100],"BDD-based":[4],"verification":[5],"to":[6,11,19,27,115],"handle":[7],"larger":[8],"designs":[9],"is":[10,87,119],"partition":[12],"BDDs":[13],"exceeding":[14],"a":[15,106,112],"threshold":[16],"size":[17],"and":[18,46,102],"deal":[20],"with":[21,53],"the":[22,28,32,44,54,80,83,91],"partitions":[23,45],"separately.":[24],"Crossover":[25],"transitions":[26],"same":[29],"state":[30,68,84],"cause":[31],"main":[33],"problem":[34],"of":[35,43,70,79,93,105],"this":[36,57],"methodology,":[37],"because":[38],"they":[39],"result":[40],"overlap":[42,86,117],"thus":[47],"introduce":[48],"redundant":[49],"computations":[50],"when":[51],"dealing":[52],"partitions.":[55],"In":[56],"paper":[58],"we":[59],"describe":[60],"an":[61],"algorithm":[62,96],"for":[63],"splitting":[64,95],"Boolean":[65],"functions":[66],"representing":[67],"sets":[69],"synchronous":[71],"systems":[72],"such":[73],"that":[74],"subsequent":[76],"symbolic":[77],"traversal":[78],"resulting":[81],"subsets":[82],"set":[85],"reduced.":[88],"We":[89],"demonstrate":[90],"effectiveness":[92],"our":[94],"by":[97],"applying":[98],"it":[99],"sequential":[101],"distributed":[103],"versions":[104],"bounded":[107],"property":[108],"checking":[109],"algorithm.":[110],"Also,":[111],"dynamic":[113],"extension":[114],"static":[116],"reduction":[118],"sketched.":[120]},"counts_by_year":[],"updated_date":"2026-03-25T23:56:10.502304","created_date":"2025-10-10T00:00:00"}