{"id":"https://openalex.org/W2172078515","doi":"https://doi.org/10.1145/2509136.2509556","title":"Bounded partial-order reduction","display_name":"Bounded partial-order reduction","publication_year":2013,"publication_date":"2013-10-23","ids":{"openalex":"https://openalex.org/W2172078515","doi":"https://doi.org/10.1145/2509136.2509556","mag":"2172078515"},"language":"en","primary_location":{"id":"doi:10.1145/2509136.2509556","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2509136.2509556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications","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/A5058111491","display_name":"Katherine E. Coons","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Katherine E. Coons","raw_affiliation_strings":["University of Texas at Austin, Austin, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011198874","display_name":"Madan Musuvathi","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madan Musuvathi","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087054368","display_name":"Kathryn S. McKinley","orcid":"https://orcid.org/0000-0002-7188-2501"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kathryn S. McKinley","raw_affiliation_strings":["Microsoft Research, Redmond, WA & University of Texas at Austin, Austin, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA & University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.9291,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.97692043,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"833","last_page":"848"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9991999864578247,"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/partial-order-reduction","display_name":"Partial order reduction","score":0.8755693435668945},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.8715026378631592},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7815526127815247},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.7739770412445068},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.7542541027069092},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.736852765083313},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7285714149475098},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.5626013278961182},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.49802494049072266},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45146963000297546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38830381631851196},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3724592924118042},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.3069494962692261},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2722886800765991},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2332679033279419},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10548430681228638},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10265651345252991},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08081793785095215}],"concepts":[{"id":"https://openalex.org/C94633896","wikidata":"https://www.wikidata.org/wiki/Q7140378","display_name":"Partial order reduction","level":3,"score":0.8755693435668945},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8715026378631592},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7815526127815247},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.7739770412445068},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.7542541027069092},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.736852765083313},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7285714149475098},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5626013278961182},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.49802494049072266},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45146963000297546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38830381631851196},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3724592924118042},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3069494962692261},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2722886800765991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2332679033279419},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10548430681228638},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10265651345252991},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08081793785095215},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2509136.2509556","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2509136.2509556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.486.3373","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.486.3373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/mckinley/papers/bpor-oopsla-2013.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6000000238418579}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1540223539","https://openalex.org/W1568729458","https://openalex.org/W1773520078","https://openalex.org/W1826004531","https://openalex.org/W1887412317","https://openalex.org/W1934074768","https://openalex.org/W1980522179","https://openalex.org/W1989877393","https://openalex.org/W2065675749","https://openalex.org/W2086147982","https://openalex.org/W2093709900","https://openalex.org/W2109819183","https://openalex.org/W2135948849","https://openalex.org/W2142297249","https://openalex.org/W2154266022","https://openalex.org/W2169870841","https://openalex.org/W2171480813","https://openalex.org/W2172078515","https://openalex.org/W2913202392","https://openalex.org/W4230480080","https://openalex.org/W4255531499","https://openalex.org/W6684852215"],"related_works":["https://openalex.org/W4253571630","https://openalex.org/W2133697637","https://openalex.org/W2837991191","https://openalex.org/W1873898332","https://openalex.org/W2741423451","https://openalex.org/W1601224578","https://openalex.org/W2172078515","https://openalex.org/W2574965914","https://openalex.org/W147489498","https://openalex.org/W2462966030"],"abstract_inverted_index":{"Eliminating":[0],"concurrency":[1,24],"errors":[2,25],"is":[3],"increasingly":[4],"important":[5],"as":[6],"systems":[7],"rely":[8],"more":[9],"on":[10,77],"parallelism":[11],"for":[12],"performance.":[13],"Exhaustively":[14],"exploring":[15],"the":[16],"state-space":[17,34,40],"of":[18,55],"a":[19,71],"program's":[20],"thread":[21],"interleavings":[22,66],"finds":[23],"and":[26,50],"provides":[27,47,61],"coverage":[28,49,63],"guarantees,":[29],"but":[30],"suffers":[31],"from":[32],"exponential":[33],"explosion.":[35,41],"Two":[36],"prior":[37],"approaches":[38],"alleviate":[39],"(1)":[42],"Dynamic":[43],"partial-order":[44,80],"reduction":[45,81],"(DPOR)":[46],"full":[48],"explores":[51],"only":[52],"one":[53],"interleaving":[54],"independent":[56],"transitions.":[57],"(2)":[58],"Bounded":[59],"search":[60],"bounded":[62],"by":[64],"enumerating":[65],"that":[67],"do":[68],"not":[69],"exceed":[70],"bound.":[72],"In":[73],"particular,":[74],"we":[75],"focus":[76],"preemption-bounding.":[78],"Combining":[79],"with":[82],"preemption-bounding":[83],"had":[84],"remained":[85],"an":[86],"open":[87],"problem.":[88]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}