{"id":"https://openalex.org/W2170821802","doi":"https://doi.org/10.1145/1278480.1278530","title":"Memory modeling in ESL-RTL equivalence checking","display_name":"Memory modeling in ESL-RTL equivalence checking","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2170821802","doi":"https://doi.org/10.1145/1278480.1278530","mag":"2170821802"},"language":"en","primary_location":{"id":"doi:10.1145/1278480.1278530","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1278480.1278530","pdf_url":null,"source":{"id":"https://openalex.org/S4210231368","display_name":"Proceedings - ACM IEEE Design Automation Conference","issn_l":"0738-100X","issn":["0738-100X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 44th annual conference on Design automation - DAC '07","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/A5002285546","display_name":"Alfred Koelbl","orcid":null},"institutions":[{"id":"https://openalex.org/I4210088951","display_name":"Synopsys (United States)","ror":"https://ror.org/013by2m91","country_code":"US","type":"company","lineage":["https://openalex.org/I4210088951"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alfred Koelbl","raw_affiliation_strings":["Synopsys, Inc., Hillsboro, OR"],"affiliations":[{"raw_affiliation_string":"Synopsys, Inc., Hillsboro, OR","institution_ids":["https://openalex.org/I4210088951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052048440","display_name":"Jerry R. Burch","orcid":null},"institutions":[{"id":"https://openalex.org/I4210088951","display_name":"Synopsys (United States)","ror":"https://ror.org/013by2m91","country_code":"US","type":"company","lineage":["https://openalex.org/I4210088951"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jerry R. Burch","raw_affiliation_strings":["Synopsys, Inc., Hillsboro, OR"],"affiliations":[{"raw_affiliation_string":"Synopsys, Inc., Hillsboro, OR","institution_ids":["https://openalex.org/I4210088951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069098823","display_name":"Carl Pixley","orcid":null},"institutions":[{"id":"https://openalex.org/I4210088951","display_name":"Synopsys (United States)","ror":"https://ror.org/013by2m91","country_code":"US","type":"company","lineage":["https://openalex.org/I4210088951"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carl Pixley","raw_affiliation_strings":["Synopsys, Inc., Hillsboro, OR"],"affiliations":[{"raw_affiliation_string":"Synopsys, Inc., Hillsboro, OR","institution_ids":["https://openalex.org/I4210088951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002285546"],"corresponding_institution_ids":["https://openalex.org/I4210088951"],"apc_list":null,"apc_paid":null,"fwci":1.8216,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.86130805,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"205","last_page":"205"},"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/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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6833235025405884},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.6158297657966614},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5182785391807556},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5154641270637512},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5086046457290649},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.48388800024986267},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.36598917841911316},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3344818353652954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16362980008125305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13301092386245728}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6833235025405884},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.6158297657966614},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5182785391807556},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5154641270637512},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5086046457290649},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.48388800024986267},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.36598917841911316},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3344818353652954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16362980008125305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13301092386245728}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1278480.1278530","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1278480.1278530","pdf_url":null,"source":{"id":"https://openalex.org/S4210231368","display_name":"Proceedings - ACM IEEE Design Automation Conference","issn_l":"0738-100X","issn":["0738-100X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 44th annual conference on Design automation - DAC '07","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1511737804","https://openalex.org/W1741528175","https://openalex.org/W1887046375","https://openalex.org/W2097708690","https://openalex.org/W2099386032","https://openalex.org/W2137249130","https://openalex.org/W2164778826","https://openalex.org/W2170145744","https://openalex.org/W3181441684"],"related_works":["https://openalex.org/W3148913902","https://openalex.org/W2103625331","https://openalex.org/W2161772051","https://openalex.org/W2151898527","https://openalex.org/W2114398233","https://openalex.org/W3046927439","https://openalex.org/W2122041181","https://openalex.org/W1915669309","https://openalex.org/W2075646267","https://openalex.org/W3159206213"],"abstract_inverted_index":{"When":[0],"designers":[1],"create":[2],"RTL":[3,29,109],"models":[4],"from":[5],"a":[6,37,67,87,94],"system-level":[7,12],"specification,":[8],"arrays":[9,27,139],"in":[10,19,54,72,79,86,90,97,107,117,145],"the":[11,20,23,34,42,46,61,73,76,91,98,108,130,134,136],"model":[13,44,100,132],"are":[14],"often":[15],"implemented":[16,103],"as":[17],"memories":[18,30,106,141],"RTL.":[21,47,92],"Knowing":[22],"correspondence":[24,137],"between":[25,41,129,138],"ESL":[26,43,99,131],"and":[28,45,133,140],"can":[31,161],"significantly":[32],"reduce":[33],"complexity":[35],"of":[36,66,69,165],"formal":[38],"equivalence":[39,56,158],"check":[40],"In":[48,149],"practice,":[49],"however,":[50],"handling":[51],"memory":[52],"mappings":[53],"ESL-RTL":[55,157],"checking":[57,159],"is":[58],"non-trivial":[59],"for":[60],"following":[62],"reasons:":[63],"First,":[64],"because":[65],"lack":[68],"bit-accurate":[70],"data-types":[71],"systemlevel":[74],"language,":[75],"information":[77],"stored":[78,85,116],"an":[80,154],"array":[81,96],"location":[82],"may":[83,101,114,142],"be":[84,102,115],"compressed":[88],"form":[89],"Second,":[93],"single":[95],"by":[104],"multiple":[105],"and/or":[110],"corresponding":[111],"data":[112],"items":[113],"different":[118],"locations.":[119],"And":[120],"last":[121],"but":[122],"not":[123,143],"least,":[124],"due":[125],"to":[126,156],"timing":[127],"differences":[128],"RTL,":[135],"hold":[144],"every":[146],"clock":[147],"cycle.":[148],"this":[150],"paper,":[151],"we":[152],"propose":[153],"approach":[155],"which":[160],"deal":[162],"with":[163],"all":[164],"these":[166],"difficulties.":[167]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}