{"id":"https://openalex.org/W1976641633","doi":"https://doi.org/10.1145/1101908.1101913","title":"Exploiting predicate structure for efficient reachability detection","display_name":"Exploiting predicate structure for efficient reachability detection","publication_year":2005,"publication_date":"2005-11-07","ids":{"openalex":"https://openalex.org/W1976641633","doi":"https://doi.org/10.1145/1101908.1101913","mag":"1976641633"},"language":"en","primary_location":{"id":"doi:10.1145/1101908.1101913","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1101908.1101913","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering","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/A5060680057","display_name":"Sujatha Kashyap","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":true,"raw_author_name":"Sujatha Kashyap","raw_affiliation_strings":["University of Texas at Austin, Austin, TX"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061474994","display_name":"Vijay K. Garg","orcid":"https://orcid.org/0000-0002-5797-4389"},"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":"Vijay K. Garg","raw_affiliation_strings":["University of Texas at Austin, Austin, TX"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060680057"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10217892,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"4","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9986000061035156,"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/T11424","display_name":"Security and Verification in Computing","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/interleaving","display_name":"Interleaving","score":0.8942484855651855},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7706709504127502},{"id":"https://openalex.org/keywords/partial-order-reduction","display_name":"Partial order reduction","score":0.7480337023735046},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.738227367401123},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7379581928253174},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.589199423789978},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49204394221305847},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47019585967063904},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.4518064260482788},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4115731716156006},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.29351502656936646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22125357389450073},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.17005324363708496}],"concepts":[{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.8942484855651855},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7706709504127502},{"id":"https://openalex.org/C94633896","wikidata":"https://www.wikidata.org/wiki/Q7140378","display_name":"Partial order reduction","level":3,"score":0.7480337023735046},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.738227367401123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7379581928253174},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.589199423789978},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49204394221305847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47019585967063904},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.4518064260482788},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4115731716156006},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.29351502656936646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22125357389450073},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.17005324363708496},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"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/1101908.1101913","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1101908.1101913","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.80.3203","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.3203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.utexas.edu/~garg/dist/ASE05.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":33,"referenced_works":["https://openalex.org/W68069235","https://openalex.org/W284453067","https://openalex.org/W1482875841","https://openalex.org/W1523442991","https://openalex.org/W1525568670","https://openalex.org/W1528441743","https://openalex.org/W1547206149","https://openalex.org/W1568729458","https://openalex.org/W1652742168","https://openalex.org/W1705394006","https://openalex.org/W1943502734","https://openalex.org/W1967333679","https://openalex.org/W1973501242","https://openalex.org/W1985091167","https://openalex.org/W1986895439","https://openalex.org/W2016300863","https://openalex.org/W2036167043","https://openalex.org/W2041743477","https://openalex.org/W2054554282","https://openalex.org/W2087409327","https://openalex.org/W2093397547","https://openalex.org/W2099620341","https://openalex.org/W2109691981","https://openalex.org/W2119610731","https://openalex.org/W2144690539","https://openalex.org/W2144884804","https://openalex.org/W2160800498","https://openalex.org/W2561675875","https://openalex.org/W3137220996","https://openalex.org/W4300885858","https://openalex.org/W6631499605","https://openalex.org/W6637485546","https://openalex.org/W6673656472"],"related_works":["https://openalex.org/W2133697637","https://openalex.org/W4253571630","https://openalex.org/W2837991191","https://openalex.org/W1873898332","https://openalex.org/W2172078515","https://openalex.org/W1579910157","https://openalex.org/W2141183298","https://openalex.org/W2315923944","https://openalex.org/W1579149493","https://openalex.org/W2574965914"],"abstract_inverted_index":{"Partial":[0],"order":[1],"(p.o.)":[2],"reduction":[3,47,70,82,253],"techniques":[4,23],"are":[5],"a":[6,25,73,116,163,236],"popular":[7,217],"and":[8,221,258],"effective":[9],"approach":[10,75,142],"for":[11,119,177],"tackling":[12],"state":[13,37,93],"space":[14,28,94],"explosion":[15],"in":[16,65,104,138,156,167,187,192,215,241],"the":[17,35,44,53,58,78,84,88,91,99,109,124,136,145,152,157,171,193,196,209,216,227],"verification":[18],"of":[19,46,69,80,90,98,111,123,147,170,180,195,229,247,261],"concurrent":[20],"systems.":[21],"These":[22],"generate":[24],"reduced":[26],"search":[27],"that":[29,43,87,150,189,204,225],"could":[30,63],"be":[31,185,206],"exponentially":[32],"smaller":[33],"than":[34],"complete":[36],"space.":[38],"Their":[39],"major":[40],"drawback":[41],"is":[42,49,95,190],"amount":[45],"achieved":[48],"highly":[50],"sensitive":[51],"to":[52,114,135,160],"properties":[54,62,100],"being":[55,101],"verified.":[56,102],"For":[57,232],"same":[59],"program,":[60],"different":[61,67],"result":[64],"very":[66],"amounts":[68],"achieved.We":[71],"present":[72,222],"new":[74],"which":[76],"combines":[77],"benefits":[79],"p.o.":[81,105,252],"with":[83],"added":[85],"advantage":[86],"size":[89],"constructed":[92],"completely":[96],"independent":[97],"As":[103],"reduction,":[106],"we":[107,127,234],"use":[108,146],"notion":[110],"persistent":[112],"sets":[113],"construct":[115],"representative":[117,158],"interleaving":[118,159,169],"each":[120,139],"maximal":[121],"trace":[122],"program.":[125],"However,":[126],"retain":[128],"concurrency":[129,154],"information":[130,155],"by":[131,208],"assigning":[132],"vector":[133],"timestamps":[134],"events":[137],"interleaving.":[140,197],"Our":[141],"hinges":[143],"upon":[144],"efficient":[148],"algorithms":[149,214],"parse":[151],"encoded":[153],"determine":[161],"whether":[162],"safety":[164],"violation":[165],"exists":[166],"any":[168],"corresponding":[172],"trace.":[173],"We":[174],"show":[175],"that,":[176],"some":[178],"types":[179],"predicates,":[181],"reachability":[182],"detection":[183,210],"can":[184,205],"performed":[186],"time":[188],"polynomial":[191],"length":[194],"Typically,":[198],"these":[199],"predicates":[200],"exhibit":[201],"certain":[202],"characteristics":[203],"exploited":[207],"algorithm.We":[211],"implemented":[212],"our":[213,230],"model":[218],"checker":[219],"SPIN,":[220,249],"experimental":[223],"results":[224],"demonstrate":[226],"effectiveness":[228],"techniques.":[231],"example,":[233],"verified":[235],"distributed":[237],"dining":[238],"philosophers":[239],"protocol":[240],"0.03":[242],"seconds,":[243],"using":[244,250],"1.253":[245],"MB":[246,260],"memory.":[248,262],"traditional":[251],"techniques,":[254],"took":[255],"759.71":[256],"seconds":[257],"439.116":[259]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}