{"id":"https://openalex.org/W2074131210","doi":"https://doi.org/10.1145/2676726.2676979","title":"Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth","display_name":"Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth","publication_year":2014,"publication_date":"2014-12-19","ids":{"openalex":"https://openalex.org/W2074131210","doi":"https://doi.org/10.1145/2676726.2676979","mag":"2074131210"},"language":"en","primary_location":{"id":"doi:10.1145/2676726.2676979","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2676726.2676979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd 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/A5052607806","display_name":"Krishnendu Chatterjee","orcid":"https://orcid.org/0000-0002-4561-241X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Krishnendu Chatterjee","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria","IST Austria, Klosterneuburg, Austria.;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]},{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria.;","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072999400","display_name":"Rasmus Ibsen-Jensen","orcid":"https://orcid.org/0000-0003-4783-0389"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Rasmus Ibsen-Jensen","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria","IST Austria, Klosterneuburg, Austria.;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]},{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria.;","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022252401","display_name":"Andreas Pavlogiannis","orcid":"https://orcid.org/0000-0002-8943-0722"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Andreas Pavlogiannis","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria","IST Austria, Klosterneuburg, Austria.;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]},{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria.;","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067035316","display_name":"Prateesh Goyal","orcid":"https://orcid.org/0000-0001-7945-1821"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prateesh Goyal","raw_affiliation_strings":["IIT Bombay, Mumbai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"97","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.998199999332428,"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/semiring","display_name":"Semiring","score":0.7629484534263611},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7553583383560181},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6068978309631348},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.5401280522346497},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4924977719783783},{"id":"https://openalex.org/keywords/alias","display_name":"Alias","score":0.4629247188568115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4330156445503235},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4280718266963959},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4148094952106476},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2699888050556183},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2505510747432709},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20365571975708008},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19955849647521973},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.09983280301094055}],"concepts":[{"id":"https://openalex.org/C21696900","wikidata":"https://www.wikidata.org/wiki/Q1333055","display_name":"Semiring","level":2,"score":0.7629484534263611},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7553583383560181},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6068978309631348},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.5401280522346497},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4924977719783783},{"id":"https://openalex.org/C46681722","wikidata":"https://www.wikidata.org/wiki/Q4725589","display_name":"Alias","level":2,"score":0.4629247188568115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4330156445503235},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4280718266963959},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4148094952106476},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2699888050556183},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2505510747432709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20365571975708008},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19955849647521973},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.09983280301094055},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2676726.2676979","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2676726.2676979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.722.7499","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.7499","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pub.ist.ac.at/%7Epavlogiannis/publications/papers/popl15b.pdf","raw_type":"text"},{"id":"pmh:oai:dsapce.library.iitb.ac.in:100/18307","is_oa":false,"landing_page_url":"http://dspace.library.iitb.ac.in/jspui/handle/100/18307","pdf_url":null,"source":{"id":"https://openalex.org/S4306400899","display_name":"DSpace (IIT Bombay)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162827531","host_organization_name":"Indian Institute of Technology Bombay","host_organization_lineage":["https://openalex.org/I162827531"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:dspace.library.iitb.ac.in:100/18307","is_oa":false,"landing_page_url":"http://doi.org/10.1145/2676726.2676979","pdf_url":null,"source":{"id":"https://openalex.org/S4306400899","display_name":"DSpace (IIT Bombay)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162827531","host_organization_name":"Indian Institute of Technology Bombay","host_organization_lineage":["https://openalex.org/I162827531"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4000000059604645}],"awards":[{"id":"https://openalex.org/G1125058943","display_name":null,"funder_award_id":"S11405, P23499-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G7934954343","display_name":null,"funder_award_id":"279307: Graph Games","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320307764","display_name":"Microsoft","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W143512583","https://openalex.org/W1585404558","https://openalex.org/W1589089428","https://openalex.org/W1593165330","https://openalex.org/W1873658816","https://openalex.org/W1984451181","https://openalex.org/W1989556004","https://openalex.org/W1989969759","https://openalex.org/W1991755800","https://openalex.org/W2002722727","https://openalex.org/W2008440715","https://openalex.org/W2016056456","https://openalex.org/W2024779397","https://openalex.org/W2034579607","https://openalex.org/W2035767178","https://openalex.org/W2036157748","https://openalex.org/W2047153806","https://openalex.org/W2055545029","https://openalex.org/W2065818693","https://openalex.org/W2071362870","https://openalex.org/W2080573945","https://openalex.org/W2080696000","https://openalex.org/W2098645109","https://openalex.org/W2110833886","https://openalex.org/W2119468705","https://openalex.org/W2133853963","https://openalex.org/W2137477742","https://openalex.org/W2143406303","https://openalex.org/W2143659699","https://openalex.org/W2145913834","https://openalex.org/W2151617868","https://openalex.org/W2151670874","https://openalex.org/W2156881251","https://openalex.org/W2160098350","https://openalex.org/W2162150822","https://openalex.org/W2166091242","https://openalex.org/W2401216365","https://openalex.org/W2545919726","https://openalex.org/W2752885492","https://openalex.org/W2770491639","https://openalex.org/W2914617426","https://openalex.org/W2986773320","https://openalex.org/W3145128584","https://openalex.org/W4213368513","https://openalex.org/W4242680074","https://openalex.org/W4244831445","https://openalex.org/W4246219036","https://openalex.org/W4248607285","https://openalex.org/W4399554296","https://openalex.org/W6651122923","https://openalex.org/W6683227944","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2998381397","https://openalex.org/W185248416","https://openalex.org/W4236419692","https://openalex.org/W3167919718","https://openalex.org/W4239447582","https://openalex.org/W2171015181","https://openalex.org/W4225271228","https://openalex.org/W1484403103","https://openalex.org/W4385605198","https://openalex.org/W2521947294"],"abstract_inverted_index":{"Interprocedural":[0],"analysis":[1,61,78],"is":[2,87,149],"at":[3],"the":[4,37,63,67,84,90,131,135,151,205],"heart":[5],"of":[6,93,117,134],"numerous":[7],"applications":[8,109],"in":[9,107,112,124],"programming":[10],"languages,":[11],"such":[12,110,213],"as":[13,89,105,111,202,214],"alias":[14,113],"analysis,":[15],"constant":[16,159,181],"propagation,":[17],"etc.":[18,72],"Recursive":[19],"state":[20],"machines":[21],"(RSMs)":[22],"are":[23,39,47,164],"standard":[24],"models":[25],"for":[26,76,139,155,173,177,209,225],"interprocedural":[27,59,77,215,226],"analysis.":[28,114],"We":[29,220],"consider":[30,101,148],"a":[31,42,94,125,222,234],"general":[32],"framework":[33],"with":[34,49,53],"RSMs":[35,52,178],"where":[36,83],"transitions":[38],"labeled":[40],"from":[41],"semiring,":[43],"and":[44,166,217,228],"path":[45,55,65,70,81,175,231],"properties":[46,56,82,176],"algebraic":[48,54,174],"semiring":[50],"operations.":[51],"can":[57,196],"model":[58],"dataflow":[60],"problems,":[62,212],"shortest":[64,218,230],"problem,":[66,71],"most":[68,156],"probable":[69],"The":[73,115,143],"traditional":[74],"algorithms":[75,168,189],"focus":[79],"on":[80,237],"starting":[85],"point":[86,92],"fixed":[88],"entry":[91],"specific":[95],"method.":[96],"In":[97],"this":[98],"work,":[99],"we":[100,147],"possible":[102],"multiple":[103,118,171],"queries":[104,119,172,199],"required":[106],"many":[108],"study":[116],"allows":[120],"us":[121],"to":[122,204],"bring":[123],"very":[126],"important":[127,211],"algorithmic":[128],"distinction":[129],"between":[130],"resource":[132],"usage":[133],"one-time":[136,193],"preprocessing":[137],"vs":[138],"each":[140],"individual":[141],"query.":[142],"second":[144],"aspect":[145],"that":[146,150,169,179,187,232],"control":[152],"flow":[153],"graphs":[154],"programs":[157],"have":[158,180,190],"treewidth.":[160,182],"Our":[161,183],"main":[162],"contributions":[163],"simple":[165],"implementable":[167],"support":[170],"theoretical":[184],"results":[185],"show":[186],"our":[188],"small":[191],"additional":[192],"preprocessing,":[194],"but":[195],"answer":[197],"subsequent":[198],"significantly":[200],"faster":[201],"compared":[203],"current":[206],"best-known":[207],"solutions":[208],"several":[210,238],"reachability":[216,227],"path.":[219],"provide":[221],"prototype":[223],"implementation":[224],"intraprocedural":[229],"gives":[233],"significant":[235],"speed-up":[236],"benchmarks.":[239]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}