{"id":"https://openalex.org/W2151670874","doi":"https://doi.org/10.1145/1075382.1075387","title":"Analysis of recursive state machines","display_name":"Analysis of recursive state machines","publication_year":2005,"publication_date":"2005-07-01","ids":{"openalex":"https://openalex.org/W2151670874","doi":"https://doi.org/10.1145/1075382.1075387","mag":"2151670874"},"language":"en","primary_location":{"id":"doi:10.1145/1075382.1075387","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1075382.1075387","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1075382.1075387","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1075382.1075387","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065059795","display_name":"Rajeev Alur","orcid":"https://orcid.org/0000-0003-1733-7083"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rajeev Alur","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037774973","display_name":"Michael Benedikt","orcid":"https://orcid.org/0000-0003-2964-0880"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Benedikt","raw_affiliation_strings":["Bell Laboratories, Lisle, IL"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lisle, IL","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003946901","display_name":"Kousha Etessami","orcid":"https://orcid.org/0000-0001-5700-3462"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kousha Etessami","raw_affiliation_strings":["University of Edinburgh, Scotland, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Scotland, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069392259","display_name":"Patrice Godefroid","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Patrice Godefroid","raw_affiliation_strings":["Bell Laboratories, Lisle, IL"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lisle, IL","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066155126","display_name":"Thomas Reps","orcid":"https://orcid.org/0000-0002-5676-9949"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Reps","raw_affiliation_strings":["University of Wisconsin, Madison, WI"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin, Madison, WI","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["Columbia University, New York, NY"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5065059795"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":17.1703,"has_fulltext":true,"cited_by_count":219,"citation_normalized_percentile":{"value":0.99611194,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"27","issue":"4","first_page":"786","last_page":"818"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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/T10126","display_name":"Logic, programming, and type systems","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/computer-science","display_name":"Computer science","score":0.7933663725852966},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6960773468017578},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6490583419799805},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.620641827583313},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5575573444366455},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5192158818244934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49958300590515137},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.48820310831069946},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.47979265451431274},{"id":"https://openalex.org/keywords/abstract-state-machines","display_name":"Abstract state machines","score":0.4321424961090088},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4280809462070465},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41942986845970154},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.41673964262008667},{"id":"https://openalex.org/keywords/component","display_name":"Component (thermodynamics)","score":0.4104255437850952},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2657049894332886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18681666254997253}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7933663725852966},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6960773468017578},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6490583419799805},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.620641827583313},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5575573444366455},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5192158818244934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49958300590515137},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.48820310831069946},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.47979265451431274},{"id":"https://openalex.org/C145243422","wikidata":"https://www.wikidata.org/wiki/Q333385","display_name":"Abstract state machines","level":3,"score":0.4321424961090088},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4280809462070465},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41942986845970154},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.41673964262008667},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.4104255437850952},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2657049894332886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18681666254997253},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1075382.1075387","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1075382.1075387","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1075382.1075387","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.29.872","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.872","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~alur/Cav01Recursive.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.3817","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.3817","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.inf.ed.ac.uk/kousha/rsm_cav2001.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/1075382.1075387","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1075382.1075387","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1075382.1075387","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5199999809265137}],"awards":[{"id":"https://openalex.org/G2066610422","display_name":null,"funder_award_id":"CCR-0341658","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2811237814","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G3500687615","display_name":"Shape-Analysis for Languages with Destructive Updating","funder_award_id":"9619219","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7781858378","display_name":"Investigation of a New Compressed Representation of Boolean Functions","funder_award_id":"9986308","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2151670874.pdf","grobid_xml":"https://content.openalex.org/works/W2151670874.grobid-xml"},"referenced_works_count":54,"referenced_works":["https://openalex.org/W42134522","https://openalex.org/W148396834","https://openalex.org/W1480600454","https://openalex.org/W1491036809","https://openalex.org/W1504739534","https://openalex.org/W1507046749","https://openalex.org/W1520729440","https://openalex.org/W1535237014","https://openalex.org/W1540492331","https://openalex.org/W1556566737","https://openalex.org/W1561389604","https://openalex.org/W1582456956","https://openalex.org/W1585404558","https://openalex.org/W1589224558","https://openalex.org/W1595179046","https://openalex.org/W1691700263","https://openalex.org/W1758177211","https://openalex.org/W1905205673","https://openalex.org/W1979706237","https://openalex.org/W1984451181","https://openalex.org/W1992810975","https://openalex.org/W2002644257","https://openalex.org/W2030166143","https://openalex.org/W2033071128","https://openalex.org/W2035032881","https://openalex.org/W2036157748","https://openalex.org/W2047505657","https://openalex.org/W2064982280","https://openalex.org/W2080573945","https://openalex.org/W2088140535","https://openalex.org/W2088846354","https://openalex.org/W2092483417","https://openalex.org/W2093080079","https://openalex.org/W2099529102","https://openalex.org/W2101605758","https://openalex.org/W2119736157","https://openalex.org/W2142840915","https://openalex.org/W2158487182","https://openalex.org/W2159765281","https://openalex.org/W2160520283","https://openalex.org/W2162621793","https://openalex.org/W2166521230","https://openalex.org/W2176705267","https://openalex.org/W2463469442","https://openalex.org/W2737235214","https://openalex.org/W2748837517","https://openalex.org/W2756011084","https://openalex.org/W2770491639","https://openalex.org/W3005728772","https://openalex.org/W3022006420","https://openalex.org/W4285719527","https://openalex.org/W6630211742","https://openalex.org/W6657879031","https://openalex.org/W7061297332"],"related_works":["https://openalex.org/W2098353690","https://openalex.org/W4251237796","https://openalex.org/W2371707945","https://openalex.org/W2348641362","https://openalex.org/W1838372604","https://openalex.org/W2154046960","https://openalex.org/W2522533476","https://openalex.org/W2381339326","https://openalex.org/W36216204","https://openalex.org/W2906490231"],"abstract_inverted_index":{"Recursive":[0],"state":[1,9,27,54,137,194,254],"machines":[2,10],"(RSMs)":[3],"enhance":[4],"the":[5,32,76,108,180,183,189,197,200,205,226,230,238,250,253,259],"power":[6],"of":[7,25,71,110,114,182,196,199,202,207,209,252,261],"ordinary":[8,18],"by":[11,120],"allowing":[12],"vertices":[13],"to":[14,17,21,68,106,235],"correspond":[15],"either":[16],"states":[19],"or":[20],"potentially":[22],"recursive":[23,40,184],"invocations":[24],"other":[26,89],"machines.":[28],"RSMs":[29,83,262],"can":[30,44,96,160],"model":[31,130,223],"control":[33],"flow":[34],"in":[35,75,163,229,237,249],"sequential":[36],"imperative":[37],"programs":[38],"containing":[39,150],"procedure":[41],"calls.":[42],"They":[43,64],"be":[45,97,161],"viewed":[46],"as":[47],"a":[48,135,147,246,264],"visual":[49],"notation":[50],"extending":[51],"Statecharts-like":[52],"hierarchical":[53],"machines,":[55,195],"where":[56,177],"concurrency":[57],"is":[58,62,105,179,188],"disallowed":[59],"but":[60,256],"recursion":[61],"allowed.":[63],"are":[65],"also":[66],"related":[67],"various":[69],"models":[70],"pushdown":[72],"systems":[73],"studied":[74],"verification":[77,95,109],"and":[78,84,129,142,171,186,204,243],"program":[79],"analysis":[80,128],"communities.After":[81],"introducing":[82],"comparing":[85],"their":[86],"expressiveness":[87],"with":[88,122,225,263],"models,":[90],"we":[91,214],"focus":[92],"on":[93],"whether":[94],"efficiently":[98],"performed":[99],"for":[100,126,218,258],"RSMs.":[101,115],"Our":[102],"first":[103],"goal":[104],"examine":[107],"linear":[111,219,248],"time":[112,164,220,240],"properties":[113,236],"We":[116,154,232],"begin":[117],"this":[118],"study":[119],"dealing":[121],"two":[123],"key":[124],"components":[125],"algorithmic":[127],"checking,":[131],"namely,":[132],"reachability":[133],"(Is":[134,145],"target":[136],"reachable":[138,148],"from":[139],"initial":[140],"states?)":[141],"cycle":[143,149],"detection":[144],"there":[146],"an":[151],"accepting":[152],"state?).":[153],"show":[155],"that":[156],"both":[157],"these":[158],"problems":[159],"solved":[162],"O":[165,173],"(":[166,174],"n":[167,175,178],"\u03b8":[168,187],"2":[169],")":[170],"space":[172],"\u03b8),":[176],"size":[181,251],"machine":[185],"maximum,":[190],"over":[191],"all":[192],"component":[193],"minimum":[198],"number":[201,206],"entries":[203],"exits":[208],"each":[210],"component.":[211],"From":[212],"this,":[213],"easily":[215],"derive":[216],"algorithms":[217],"temporal":[221],"logic":[222,241],"checking":[224],"same":[227],"complexity":[228],"model.":[231],"then":[233],"turn":[234],"branching":[239],"CTL*,":[242],"again":[244],"demonstrate":[245],"bound":[247],"machine,":[255],"only":[257],"case":[260],"single":[265],"exit":[266],"node.":[267]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":15}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}