{"id":"https://openalex.org/W21975773","doi":null,"title":"Markov Chain Monte Carlo Stimulus Generation for Constrained Random Simulation","display_name":"Markov Chain Monte Carlo Stimulus Generation for Constrained Random Simulation","alternate_titles":[],"publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W21975773","mag":"21975773"},"language":"en","primary_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt6gp3z1t0","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/6gp3z1t0","pdf_url":"https://escholarship.org/content/qt6gp3z1t0/qt6gp3z1t0.pdf?t=mtfdwo","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},"parent_works":[],"lineage":["https://openalex.org/W21975773"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt6gp3z1t0/qt6gp3z1t0.pdf?t=mtfdwo","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009465781","display_name":"Nathan Kitchen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Nathan Kitchen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5009465781"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.42289999127388,"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.42289999127388,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.31619998812675476,"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"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.2029999941587448,"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/stimulus-generation","display_name":"stimulus generation","score":0.8320000171661377},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.9570000171661377},{"id":"https://openalex.org/keywords/metropolis-hastings-sampling","display_name":"Metropolis-Hastings sampling","score":0.9309999942779541},{"id":"https://openalex.org/keywords/stochastic-local-search","display_name":"stochastic local search","score":0.9330000281333923},{"id":"https://openalex.org/keywords/integrated-circuit-verification","display_name":"integrated circuit verification","score":0.7400000095367432},{"id":"https://openalex.org/keywords/logic-simulation","display_name":"logic simulation","score":0.5690000057220459},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.5669999718666077},{"id":"https://openalex.org/keywords/variable-elimination","display_name":"variable elimination","score":0.5849999785423279},{"id":"https://openalex.org/keywords/control-variables","display_name":"control variables","score":0.6370000243186951},{"id":"https://openalex.org/keywords/solution-distribution","display_name":"solution distribution","score":0.4180000126361847}],"concepts":[{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.7882347702980042},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7011222839355469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6999248266220093},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5949615240097046},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.581560492515564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5323213934898376},{"id":"https://openalex.org/C187192777","wikidata":"https://www.wikidata.org/wiki/Q381699","display_name":"Rejection sampling","level":5,"score":0.5140222311019897},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.46966540813446045},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.4631563723087311},{"id":"https://openalex.org/C13153151","wikidata":"https://www.wikidata.org/wiki/Q1639846","display_name":"Hybrid Monte Carlo","level":4,"score":0.43436896800994873},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3964914083480835},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23797330260276794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21539732813835144},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.20631206035614014},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.18618306517601013},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.1703452467918396},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11161711812019348},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:escholarship.org/ark:/13030/qt6gp3z1t0","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/6gp3z1t0","pdf_url":"https://escholarship.org/content/qt6gp3z1t0/qt6gp3z1t0.pdf?t=mtfdwo","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},{"id":"pmh:oai:berkeley.edu:28722-bk0007q6x8n","doi":null,"is_oa":false,"landing_page_url":"http://techreports.lib.berkeley.edu/accessPages/EECS-2010-165.html","pdf_url":null,"source":{"id":"https://openalex.org/S7407050879","display_name":"UC Berkeley","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I95457486","host_organization_name":"University of California, Berkeley","host_organization_lineage":["https://openalex.org/I95457486"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"technical reports"},{"id":"pmh:qt6gp3z1t0","doi":null,"is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/6gp3z1t0","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kitchen, Nathan. (2010). Markov Chain Monte Carlo Stimulus Generation for Constrained Random Simulation. UC Berkeley: Electrical Engineering &amp; Computer Sciences. Retrieved from: http://www.escholarship.org/uc/item/6gp3z1t0","raw_type":"dissertation"},{"id":"mag:21975773","doi":null,"is_oa":false,"landing_page_url":"https://escholarship.org/content/qt6gp3z1t0/qt6gp3z1t0.pdf?t=mtfdwo","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt6gp3z1t0","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/6gp3z1t0","pdf_url":"https://escholarship.org/content/qt6gp3z1t0/qt6gp3z1t0.pdf?t=mtfdwo","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W21975773.pdf","grobid_xml":"https://content.openalex.org/works/W21975773.grobid-xml"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W16743356","https://openalex.org/W109881820","https://openalex.org/W1481397690","https://openalex.org/W1489881735","https://openalex.org/W1505598781","https://openalex.org/W1517453125","https://openalex.org/W1518705996","https://openalex.org/W1537307653","https://openalex.org/W1575350781","https://openalex.org/W1592766895","https://openalex.org/W1600293573","https://openalex.org/W1602474091","https://openalex.org/W1666636243","https://openalex.org/W1964901903","https://openalex.org/W1970202913","https://openalex.org/W2017127020","https://openalex.org/W2020999234","https://openalex.org/W2023151136","https://openalex.org/W2024060531","https://openalex.org/W2056760934","https://openalex.org/W2057293816","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2067750291","https://openalex.org/W2069092471","https://openalex.org/W2080267935","https://openalex.org/W2083875149","https://openalex.org/W2102454528","https://openalex.org/W2114122189","https://openalex.org/W2114202040","https://openalex.org/W2118325845","https://openalex.org/W2118970405","https://openalex.org/W2129508712","https://openalex.org/W2132213263","https://openalex.org/W2138309709","https://openalex.org/W2140880945","https://openalex.org/W2142785340","https://openalex.org/W2148740615","https://openalex.org/W2155398252","https://openalex.org/W2161705718","https://openalex.org/W2166856993","https://openalex.org/W2169438188","https://openalex.org/W2404266688","https://openalex.org/W2467407789","https://openalex.org/W2611087190","https://openalex.org/W3149485484","https://openalex.org/W4244370844","https://openalex.org/W4245558686","https://openalex.org/W4249613718"],"related_works":["https://openalex.org/W3149485484","https://openalex.org/W2112421626","https://openalex.org/W2049195625","https://openalex.org/W3148472830","https://openalex.org/W2041212599","https://openalex.org/W1602474091","https://openalex.org/W2048982615","https://openalex.org/W2358888449","https://openalex.org/W255296881","https://openalex.org/W4253111545"],"abstract_inverted_index":{"As":[0],"integrated":[1],"circuits":[2],"have":[3],"grown":[4],"in":[5,27,168],"size":[6],"and":[7,48,74,133,171,184,202,209,221,225],"complexity,":[8],"the":[9,17,49,62,69,72,75,78,89,127,136,150,191,229],"time":[10],"required":[11],"for":[12,83,114],"functional":[13],"verification":[14,30,64],"has":[15],"become":[16],"largest":[18],"part":[19],"of":[20,61,71,77,91,93,130,135,139,173,186,193,204,218,228],"total":[21],"design":[22],"time.":[23],"The":[24,59],"main":[25],"workhorse":[26],"state-of-the-art":[28],"practical":[29],"is":[31],"constrained":[32],"random":[33],"simulation.":[34],"In":[35,211],"this":[36,107],"approach,":[37,147],"a":[38,56,111,215],"randomized":[39],"solver":[40,73],"generates":[41],"solutions":[42,50],"to":[43,55,104,196,206],"declaratively":[44],"specified":[45],"input":[46],"constraints,":[47],"are":[51],"applied":[52],"as":[53],"stimuli":[54],"logic":[57],"simulator.":[58],"efficiency":[60,208],"overall":[63],"process":[65],"depends":[66],"critically":[67],"on":[68,97,118,199],"speed":[70,87],"distribution":[76,94],"generated":[79],"solutions.":[80],"Previous":[81],"methods":[82,132,167],"stimulus":[84,115],"generation":[85,116],"achieve":[86],"at":[88],"expense":[90],"quality":[92,172],"or":[95],"rely":[96],"techniques":[98],"that":[99,162],"do":[100],"not":[101],"scale":[102],"well":[103],"large":[105],"designs.In":[106],"dissertation,":[108],"we":[109,180,213],"propose":[110],"new":[112],"method":[113],"based":[117],"Markov":[119],"chain":[120],"Monte":[121],"Carlo":[122],"(MCMC)":[123],"methods.":[124],"We":[125,144,157],"describe":[126,181],"basic":[128,178],"principles":[129],"MCMC":[131],"one":[134],"most":[137],"common":[138],"these":[140],"methods,":[141],"Metropolis-Hastings":[142,151],"sampling.":[143],"present":[145,214],"our":[146,177,219],"which":[148],"combines":[149],"algorithm":[152,220],"with":[153,159],"stochastic":[154],"local":[155],"search.":[156],"show":[158],"experimental":[160,226],"results":[161],"it":[163],"surpasses":[164],"existing":[165],"stimulus-generation":[166],"speed,":[169],"robustness,":[170],"distribution.":[174,210],"After":[175],"presenting":[176],"algorithm,":[179],"several":[182],"refinements":[183,189],"variations":[185],"it.":[187],"These":[188],"include":[190],"addition":[192],"control":[194],"variables":[195,205],"handle":[197],"dependencies":[198],"external":[200],"data":[201],"elimination":[203],"increase":[207],"addition,":[212],"parallel":[216],"version":[217],"give":[222],"theoretical":[223],"analysis":[224],"evidence":[227],"speedup":[230],"achieved":[231],"by":[232],"parallelization.":[233]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W21975773","counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-18T13:11:19.462570","created_date":"2016-06-24T00:00:00"}
