{"id":"https://openalex.org/W2155938123","doi":"https://doi.org/10.1109/memcod.2010.5558624","title":"ATLAS: Automatic Term-level abstraction of RTL designs","display_name":"ATLAS: Automatic Term-level abstraction of RTL designs","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2155938123","doi":"https://doi.org/10.1109/memcod.2010.5558624","mag":"2155938123"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2010.5558624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2010.5558624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)","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/A5111407359","display_name":"Bryan Brady","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bryan A. Brady","raw_affiliation_strings":["University of California Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054408811","display_name":"Randal E. Bryant","orcid":"https://orcid.org/0000-0001-5024-6613"},"institutions":[{"id":"https://openalex.org/I2802039673","display_name":"California Miramar University","ror":"https://ror.org/04phxq043","country_code":"US","type":"education","lineage":["https://openalex.org/I2802039673"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Randal E. Bryant","raw_affiliation_strings":["CMU, USA"],"affiliations":[{"raw_affiliation_string":"CMU, USA","institution_ids":["https://openalex.org/I2802039673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064230639","display_name":"Sanjit A. Seshia","orcid":"https://orcid.org/0000-0001-6190-8707"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjit A. Seshia","raw_affiliation_strings":["University of California Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105768200","display_name":"John O\u2019Leary","orcid":"https://orcid.org/0000-0001-9327-5852"},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John W. O'Leary","raw_affiliation_strings":["Intel Corporation, USA"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, USA","institution_ids":["https://openalex.org/I1343180700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111407359"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":1.3665,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.82286855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2725","issue":null,"first_page":"31","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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.9994000196456909,"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.9918000102043152,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.991599977016449,"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/computer-science","display_name":"Computer science","score":0.8274915218353271},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6853171586990356},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6609795689582825},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6501866579055786},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6041101813316345},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5364530682563782},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5261275768280029},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.5254456400871277},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5197094082832336},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.48496222496032715},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.48083385825157166},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.4570716321468353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10416364669799805}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8274915218353271},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6853171586990356},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6609795689582825},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6501866579055786},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6041101813316345},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5364530682563782},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5261275768280029},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.5254456400871277},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5197094082832336},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.48496222496032715},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.48083385825157166},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.4570716321468353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10416364669799805},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/memcod.2010.5558624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2010.5558624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.cmu.edu:isr-1299","is_oa":false,"landing_page_url":"http://repository.cmu.edu/isr/293","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Institute for Software Research","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.170.86","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.86","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://uclid.eecs.berkeley.edu/atlas/memocode2010-atlas.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1481397690","https://openalex.org/W1486829726","https://openalex.org/W1515959435","https://openalex.org/W1551538037","https://openalex.org/W1579437898","https://openalex.org/W1590506622","https://openalex.org/W1592502301","https://openalex.org/W1741528175","https://openalex.org/W1790711334","https://openalex.org/W1992748711","https://openalex.org/W2004936005","https://openalex.org/W2047932652","https://openalex.org/W2107106621","https://openalex.org/W2108065216","https://openalex.org/W2109589569","https://openalex.org/W2109939657","https://openalex.org/W2137351629","https://openalex.org/W3157645869","https://openalex.org/W6628836516","https://openalex.org/W6634743126","https://openalex.org/W6635458761","https://openalex.org/W6651492333","https://openalex.org/W6676143505"],"related_works":["https://openalex.org/W2152752131","https://openalex.org/W2106507440","https://openalex.org/W2105710452","https://openalex.org/W2122355433","https://openalex.org/W2578463151","https://openalex.org/W2162615969","https://openalex.org/W2096723742","https://openalex.org/W2810367355","https://openalex.org/W2137328468","https://openalex.org/W2158533859"],"abstract_inverted_index":{"Abstraction":[0],"plays":[1],"a":[2,11,18,36,82],"central":[3],"role":[4],"in":[5,17,68],"formal":[6,19],"verification.":[7],"Term-level":[8],"abstraction":[9,46,64,102,118],"is":[10,23,48,79,108,119,159],"technique":[12,47,61],"for":[13,44,62,101,143],"abstracting":[14],"word-level":[15],"designs":[16,175],"logic,":[20,148],"wherein":[21],"data":[22],"modeled":[24],"with":[25,30,35,103],"abstract":[26],"terms,":[27],"functional":[28,96],"blocks":[29,97],"uninterpreted":[31,104],"functions,":[32],"and":[33,73,87,134,149,161],"memories":[34],"suitable":[37,100],"theory":[38],"of":[39,65,71,84],"memories.":[40],"A":[41],"major":[42],"challenge":[43],"any":[45],"to":[49,94,111,169],"determine":[50],"what":[51],"components":[52],"can":[53],"be":[54],"safely":[55],"abstracted.":[56],"We":[57,90,139,152],"present":[58,153],"an":[59],"automatic":[60],"term-level":[63,123,165],"hardware":[66],"designs,":[67,146],"the":[69,163,173],"context":[70],"equivalence":[72],"refinement":[74],"checking":[75],"problems.":[76,179],"Our":[77],"approach":[78,142,158],"hybrid,":[80],"involving":[81],"combination":[83],"random":[85,92],"simulation":[86,93],"static":[88],"analysis.":[89],"use":[91],"identify":[95],"that":[98,156,162],"are":[99,125,167],"functions.":[105],"Static":[106],"analysis":[107],"then":[109],"used":[110],"compute":[112],"conditions":[113],"under":[114],"which":[115],"such":[116],"function":[117],"performed.":[120],"The":[121],"generated":[122],"abstractions":[124],"verified":[126],"using":[127],"techniques":[128],"based":[129],"on":[130],"Boolean":[131],"satisfiability":[132,135],"(SAT)":[133],"modulo":[136],"theories":[137],"(SMT).":[138],"demonstrate":[140],"our":[141,157],"verifying":[144],"processor":[145],"interface":[147],"low-power":[150],"designs.":[151],"experimental":[154],"evidence":[155],"efficient":[160],"resulting":[164],"models":[166],"easier":[168],"verify":[170],"even":[171],"when":[172],"abstracted":[174],"generate":[176],"larger":[177],"SAT":[178]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}