{"id":"https://openalex.org/W2149447807","doi":"https://doi.org/10.1145/513918.514059","title":"A general probabilistic framework for worst case timing analysis","display_name":"A general probabilistic framework for worst case timing analysis","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2149447807","doi":"https://doi.org/10.1145/513918.514059","mag":"2149447807"},"language":"en","primary_location":{"id":"doi:10.1145/513918.514059","doi":"https://doi.org/10.1145/513918.514059","is_oa":false,"landing_page_url":"https://doi.org/10.1145/513918.514059","pdf_url":null,"source":{"id":"https://openalex.org/S4210231368","display_name":"ACM/IEEE Design Automation Conference (DAC)","issn_l":"0738-100X","issn":["0738-100X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th conference on Design automation - DAC '02","raw_type":"proceedings-article"},"volume":null,"type":"conference-abstract","is_traditional":false,"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/A5090899796","display_name":"Michael E. Orshansky","orcid":"https://orcid.org/0000-0002-6223-4748","observed_orcids":["https://orcid.org/0000-0002-6223-4748"]},"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":"Michael Orshansky","raw_affiliation_strings":["University of California, Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047285420","display_name":"Kurt Keutzer","orcid":"https://orcid.org/0000-0003-3868-8501","observed_orcids":["https://orcid.org/0000-0003-3868-8501"]},"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":"Kurt Keutzer","raw_affiliation_strings":["University of California, Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":195,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"556","last_page":"556"},"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.8398000001907349,"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.8398000001907349,"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/T10142","display_name":"Formal Methods in Verification","score":0.07079999893903732,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.03849999979138374,"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/worst-case-execution-time-analysis","display_name":"worst-case execution time analysis","score":0.9399999976158142},{"id":"https://openalex.org/keywords/probabilistic-timing-analysis","display_name":"probabilistic timing analysis","score":0.8130000233650208},{"id":"https://openalex.org/keywords/joint-probability-density-function","display_name":"joint probability density function","score":0.8849999904632568},{"id":"https://openalex.org/keywords/maxima-of-random-variables","display_name":"maximum of random variables","score":0.8859999775886536},{"id":"https://openalex.org/keywords/path-correlation","display_name":"path correlation","score":0.6800000071525574},{"id":"https://openalex.org/keywords/gate-delay","display_name":"gate delay","score":0.6700000166893005},{"id":"https://openalex.org/keywords/static-timing-analysis","display_name":"static timing analysis","score":0.7360000014305115},{"id":"https://openalex.org/keywords/process-variation","display_name":"process variation","score":0.4690000116825104}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7778543829917908},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.725936770439148},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6702784895896912},{"id":"https://openalex.org/C197055811","wikidata":"https://www.wikidata.org/wiki/Q207522","display_name":"Probability density function","level":2,"score":0.6601606011390686},{"id":"https://openalex.org/C93682380","wikidata":"https://www.wikidata.org/wiki/Q2025226","display_name":"Static timing analysis","level":2,"score":0.5905790328979492},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5236127972602844},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5123809576034546},{"id":"https://openalex.org/C18653775","wikidata":"https://www.wikidata.org/wiki/Q1333358","display_name":"Joint probability distribution","level":2,"score":0.4916022717952728},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.4895859658718109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46925732493400574},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.4570907950401306},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.44615182280540466},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4303243160247803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23482945561408997},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1521776020526886},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08015790581703186},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/513918.514059","doi":"https://doi.org/10.1145/513918.514059","is_oa":false,"landing_page_url":"https://doi.org/10.1145/513918.514059","pdf_url":null,"source":{"id":"https://openalex.org/S4210231368","display_name":"ACM/IEEE Design Automation Conference (DAC)","issn_l":"0738-100X","issn":["0738-100X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th conference on Design automation - DAC '02","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.605","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.605","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sigda.org/Archives/ProceedingArchives/Dac/Dac2002/papers/2002/dac02/htmfiles/sun_sgi/../../pdffiles/36_1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1562147356","https://openalex.org/W2004216344","https://openalex.org/W2111046960","https://openalex.org/W2113582810","https://openalex.org/W2126827022","https://openalex.org/W2138086100","https://openalex.org/W2197932458","https://openalex.org/W2807835393"],"related_works":["https://openalex.org/W2145966358","https://openalex.org/W2103323734","https://openalex.org/W2560534857","https://openalex.org/W61749477","https://openalex.org/W2809309061","https://openalex.org/W4236674018","https://openalex.org/W2794688131","https://openalex.org/W113976412","https://openalex.org/W2126827022","https://openalex.org/W2099759796"],"abstract_inverted_index":{"The":[0],"traditional":[1],"approach":[2,50],"to":[3,12,29],"worst-case":[4],"static-timing":[5],"analysis":[6,40],"is":[7],"becoming":[8],"unacceptably":[9],"conservative":[10],"due":[11],"an":[13],"ever-increasing":[14],"number":[15],"of":[16,34,41,54,59,74,77],"circuit":[17],"and":[18,43,62,66],"process":[19],"effects.":[20],"We":[21,46],"propose":[22],"a":[23,48,78],"fundamentally":[24],"different":[25],"framework":[26],"that":[27],"aims":[28],"significantly":[30],"improve":[31],"the":[32,52,71,75],"accuracy":[33],"timing":[35],"predictions":[36],"through":[37],"fully":[38],"probabilistic":[39],"gate":[42],"path":[44,60,80,85],"delays.":[45],"describe":[47],"bottom-up":[49],"for":[51,69],"construction":[53],"joint":[55],"probability":[56],"density":[57],"function":[58],"delays,":[61],"present":[63],"novel":[64],"analytical":[65],"algorithmic":[67],"methods":[68],"finding":[70],"full":[72],"distribution":[73],"maximum":[76],"random":[79],"delay":[81],"space":[82],"with":[83],"arbitrary":[84],"correlations.":[86]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}