{"id":"https://openalex.org/W4230390140","doi":"https://doi.org/10.1109/aspdac.2009.4796493","title":"Bound-based identification of timing-violating paths under variability","display_name":"Bound-based identification of timing-violating paths under variability","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W4230390140","doi":"https://doi.org/10.1109/aspdac.2009.4796493"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2009.4796493","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2009.4796493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Asia and South Pacific Design Automation Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100302890","display_name":"Lin Xie","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lin Xie","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of Wisconsin, Madison, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of Wisconsin, Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072204999","display_name":"Azadeh Davoodi","orcid":"https://orcid.org/0000-0001-5213-2556"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Azadeh Davoodi","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of Wisconsin, Madison, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of Wisconsin, Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":null,"first_page":"278","last_page":"283"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9998999834060669,"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/T14117","display_name":"Integrated Circuits and Semiconductor Failure Analysis","score":0.9997000098228455,"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/path","display_name":"Path (computing)","score":0.5591445565223694},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5024545192718506},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.491657555103302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44023919105529785},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42674264311790466},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3363310694694519},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26493334770202637},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.24296823143959045},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11224275827407837}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5591445565223694},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5024545192718506},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.491657555103302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44023919105529785},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42674264311790466},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3363310694694519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26493334770202637},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.24296823143959045},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11224275827407837},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2009.4796493","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2009.4796493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Asia and South Pacific Design Automation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6499999761581421,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2037102348","https://openalex.org/W2042931999","https://openalex.org/W2126157463","https://openalex.org/W2142213725","https://openalex.org/W2156306402","https://openalex.org/W4229847476","https://openalex.org/W4231005419","https://openalex.org/W4236775215","https://openalex.org/W4246853090","https://openalex.org/W4246922879","https://openalex.org/W4254562289","https://openalex.org/W4255800147","https://openalex.org/W6659537720","https://openalex.org/W6678886708"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W4394360958","https://openalex.org/W2948670949","https://openalex.org/W4288047943","https://openalex.org/W2053286651","https://openalex.org/W2980963558","https://openalex.org/W2181743346","https://openalex.org/W2187401768"],"abstract_inverted_index":{"We":[0,156,229,240],"introduce":[1],"a":[2,13,37,119,167,171,200,206],"bound-based":[3,201],"technique":[4,120],"to":[5,170,179,192],"identify":[6],"the":[7,19,22,34,42,54,58,75,92,163,184,189,194,219],"top":[8,185],"M":[9],"timing-violating":[10],"paths":[11,20,235],"in":[12,140],"circuit":[14,210],"under":[15],"variability.":[16],"These":[17,174],"are":[18],"with":[21,244],"highest":[23],"violation":[24,55],"probability":[25,35,116],"(i.e.,":[26,39,60,68],"C":[27,47,61,69,81,86,126,131,147],"<sub":[28,48,62,70,82,87,127,132,148],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[29,49,63,71,83,88,128,133,149,181],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">p</sub>":[30,50,150],")":[31,65,73],"which":[32],"is":[33,139,191],"that":[36,203],"path":[38,154,168],"p)":[40],"violates":[41],"timing":[43],"constraint.":[44],"To":[45],"compute":[46],",":[51,135],"we":[52,78,110,198,217],"require":[53],"probabilities":[56],"of":[57,90,100,151,162,209,223,233],"nodes":[59,93],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sub>":[64,84,129],"and":[66,85,94,105,130,143,221],"edges":[67,95],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">e</sub>":[72,89,134],"on":[74],"path.":[76],"First,":[77],"show":[79,157,199],"computing":[80,141],"all":[91],"requires":[96],"only":[97],"two":[98],"rounds":[99],"Statistical":[101],"Static":[102],"Timing":[103],"Analysis":[104],"then":[106],"for":[107,115,146,159,226],"each":[108],"node/edge":[109],"need":[111],"one":[112],"table":[113],"lookup":[114],"calculation":[117],"using":[118,236],"known":[121],"as":[122],"Pearson":[123],"Curve.":[124],"Given":[125],"our":[136,215,224],"major":[137],"contribution":[138],"upper":[142],"lower":[144],"bounds":[145,164,175,225],"an":[152],"arbitrary":[153],"segment.":[155],"constant-time":[158],"incremental":[160],"update":[161],"when":[165],"extending":[166],"segment":[169],"longer":[172],"one.":[173],"can":[176,204],"be":[177],"used":[178],"<i":[180],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">exactly</i>":[182],"construct":[183],"violating":[186],"paths.":[187,228],"If":[188],"goal":[190],"find":[193],"single":[195],"most-violating":[196],"path,":[197],"formulation":[202],"prune":[205],"large":[207],"portion":[208],"without":[211],"losing":[212],"optimality.":[213],"In":[214],"simulations,":[216],"verify":[218,231],"correctness":[220],"accuracy":[222,243],"individual":[227],"also":[230],"identification":[232],"selected":[234],"Monte":[237],"Carlo":[238],"simulation.":[239],"obtain":[241],"near-optimal":[242],"fast":[245],"runtimes.":[246]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}