{"id":"https://openalex.org/W2024779397","doi":"https://doi.org/10.1145/1328438.1328460","title":"Subcubic algorithms for recursive state machines","display_name":"Subcubic algorithms for recursive state machines","publication_year":2008,"publication_date":"2008-01-07","ids":{"openalex":"https://openalex.org/W2024779397","doi":"https://doi.org/10.1145/1328438.1328460","mag":"2024779397"},"language":"en","primary_location":{"id":"doi:10.1145/1328438.1328460","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","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/A5057341982","display_name":"Swarat Chaudhuri","orcid":"https://orcid.org/0000-0002-6859-1391"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Swarat Chaudhuri","raw_affiliation_strings":["Pennsylvania State University, University Park, PA","PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY PARK, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park, PA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"PENNSYLVANIA STATE UNIVERSITY, UNIVERSITY PARK, PA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057341982"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":4.5712,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.95980512,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"159","last_page":"169"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9995999932289124,"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.9994999766349792,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.998199999332428,"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/reachability","display_name":"Reachability","score":0.8427655696868896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5617619156837463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5162394046783447},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5137368440628052},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47836607694625854},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4455813765525818},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.44232407212257385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4274870455265045},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41651201248168945},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4137459397315979},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3339657187461853}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8427655696868896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5617619156837463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5162394046783447},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5137368440628052},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47836607694625854},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4455813765525818},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.44232407212257385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4274870455265045},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41651201248168945},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4137459397315979},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3339657187461853},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1328438.1328460","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.362.9128","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.9128","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.psu.edu/~swarat/pubs/popl08.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W117468351","https://openalex.org/W148396834","https://openalex.org/W198808598","https://openalex.org/W1535237014","https://openalex.org/W1589224558","https://openalex.org/W1655990431","https://openalex.org/W1965253335","https://openalex.org/W1981904441","https://openalex.org/W1990051509","https://openalex.org/W2002089154","https://openalex.org/W2002644257","https://openalex.org/W2028806953","https://openalex.org/W2030166143","https://openalex.org/W2044199853","https://openalex.org/W2047505657","https://openalex.org/W2064982280","https://openalex.org/W2070992781","https://openalex.org/W2079752311","https://openalex.org/W2080573945","https://openalex.org/W2093080079","https://openalex.org/W2097382431","https://openalex.org/W2098645109","https://openalex.org/W2110052743","https://openalex.org/W2110833886","https://openalex.org/W2151670874","https://openalex.org/W2152290683","https://openalex.org/W2563394493","https://openalex.org/W2770491639","https://openalex.org/W4230104298","https://openalex.org/W4247632680","https://openalex.org/W4302339081","https://openalex.org/W6637190722"],"related_works":["https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W2099490078","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W4224983736","https://openalex.org/W2141183298","https://openalex.org/W2315923944"],"abstract_inverted_index":{"We":[0,45],"show":[1,47],"that":[2,30,48],"the":[3,34,54],"reachability":[4],"problem":[5],"for":[6,15,33],"recursive":[7,61],"state":[8],"machines":[9],"(or":[10],"equivalently,":[11],"pushdown":[12],"systems),":[13],"believed":[14],"long":[16],"to":[17],"have":[18,59],"cubic":[19],"worst-case":[20],"complexity,":[21],"can":[22],"be":[23],"solved":[24],"in":[25],"slightly":[26],"subcubic":[27],"time.":[28],"All":[29],"is":[31,37],"necessary":[32],"new":[35],"bound":[36],"a":[38,42,49],"simple":[39],"adaptation":[40],"of":[41],"known":[43],"technique.":[44],"also":[46],"better":[50],"algorithm":[51],"exists":[52],"if":[53],"input":[55],"machine":[56],"does":[57],"not":[58],"infinite":[60],"loops.":[62]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}