{"id":"https://openalex.org/W4390605487","doi":"https://doi.org/10.1145/3632907","title":"Parikh\u2019s Theorem Made Symbolic","display_name":"Parikh\u2019s Theorem Made Symbolic","publication_year":2024,"publication_date":"2024-01-02","ids":{"openalex":"https://openalex.org/W4390605487","doi":"https://doi.org/10.1145/3632907"},"language":"en","primary_location":{"id":"doi:10.1145/3632907","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632907","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632907","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3632907","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083664380","display_name":"Matthew Hague","orcid":"https://orcid.org/0000-0003-4913-3800"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Matthew Hague","raw_affiliation_strings":["Royal Holloway, University of London, Egham, UK"],"raw_orcid":"https://orcid.org/0000-0003-4913-3800","affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, UK","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066525178","display_name":"Artur Je\u017c","orcid":"https://orcid.org/0000-0003-4321-3105"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Artur Je\u017c","raw_affiliation_strings":["University of Wroclaw, Wroclaw, Poland"],"raw_orcid":"https://orcid.org/0000-0003-4321-3105","affiliations":[{"raw_affiliation_string":"University of Wroclaw, Wroclaw, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034129725","display_name":"Anthony W. Lin","orcid":"https://orcid.org/0000-0003-4715-5096"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]},{"id":"https://openalex.org/I2802076133","display_name":"University of Koblenz and Landau","ror":"https://ror.org/01j9f6752","country_code":"DE","type":"education","lineage":["https://openalex.org/I2802076133"]},{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Anthony W. Lin","raw_affiliation_strings":["Max-Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany","University of Kaiserslautern-Landau, Kaiserslautern, Germany","University of Kaiserslautern-Landau, Kaiserslautern, Germany / Max-Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4715-5096","affiliations":[{"raw_affiliation_string":"Max-Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]},{"raw_affiliation_string":"University of Kaiserslautern-Landau, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046","https://openalex.org/I2802076133"]},{"raw_affiliation_string":"University of Kaiserslautern-Landau, Kaiserslautern, Germany / Max-Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046","https://openalex.org/I4210121786"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0055,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.88601153,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"8","issue":"POPL","first_page":"1945","last_page":"1977"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12479","display_name":"Web Application Security Vulnerabilities","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12479","display_name":"Web Application Security Vulnerabilities","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9988999962806702,"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.9980000257492065,"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/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.6302518844604492},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5651883482933044},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5266839265823364},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5088589191436768},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.505530595779419},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47977882623672485},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4539581835269928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31121915578842163},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2732926607131958}],"concepts":[{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.6302518844604492},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5651883482933044},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5266839265823364},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5088589191436768},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.505530595779419},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47977882623672485},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4539581835269928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31121915578842163},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2732926607131958}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3632907","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632907","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632907","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3632907","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632907","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632907","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.7300000190734863,"id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G1727486901","display_name":null,"funder_award_id":"101089343","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G308361849","display_name":null,"funder_award_id":"101089343","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G7068158299","display_name":null,"funder_award_id":"2017/26/E/ST6/00191","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320322650","display_name":"Narodowym Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390605487.pdf","grobid_xml":"https://content.openalex.org/works/W4390605487.grobid-xml"},"referenced_works_count":59,"referenced_works":["https://openalex.org/W2436624","https://openalex.org/W125973810","https://openalex.org/W147131300","https://openalex.org/W1480909796","https://openalex.org/W1487351738","https://openalex.org/W1528946883","https://openalex.org/W1580879785","https://openalex.org/W1580943896","https://openalex.org/W1599228120","https://openalex.org/W1826894354","https://openalex.org/W1879732467","https://openalex.org/W1994584977","https://openalex.org/W2026405784","https://openalex.org/W2062179480","https://openalex.org/W2094568767","https://openalex.org/W2099837287","https://openalex.org/W2107604680","https://openalex.org/W2117657788","https://openalex.org/W2157148396","https://openalex.org/W2157390113","https://openalex.org/W2160520283","https://openalex.org/W2162593546","https://openalex.org/W2164778826","https://openalex.org/W2184561108","https://openalex.org/W2293422809","https://openalex.org/W2295791966","https://openalex.org/W2310431176","https://openalex.org/W2500265108","https://openalex.org/W2626453174","https://openalex.org/W2676873924","https://openalex.org/W2809018007","https://openalex.org/W2897675441","https://openalex.org/W2899573209","https://openalex.org/W2910081537","https://openalex.org/W2946774019","https://openalex.org/W2965996947","https://openalex.org/W2981614836","https://openalex.org/W2999769907","https://openalex.org/W3016735580","https://openalex.org/W3037249291","https://openalex.org/W3048452377","https://openalex.org/W3095013546","https://openalex.org/W3099242157","https://openalex.org/W3099647739","https://openalex.org/W3159683821","https://openalex.org/W3177350684","https://openalex.org/W3212912612","https://openalex.org/W4225922019","https://openalex.org/W4232808412","https://openalex.org/W4241782937","https://openalex.org/W4242620488","https://openalex.org/W4281658241","https://openalex.org/W4283073178","https://openalex.org/W4299138792","https://openalex.org/W4323026879","https://openalex.org/W4379518504","https://openalex.org/W4384573523","https://openalex.org/W6929270900","https://openalex.org/W6967270245"],"related_works":["https://openalex.org/W4225592929","https://openalex.org/W4294016381","https://openalex.org/W3130346675","https://openalex.org/W2583753471","https://openalex.org/W2122700562","https://openalex.org/W2922024459","https://openalex.org/W2506746226","https://openalex.org/W2109489765","https://openalex.org/W1587864502","https://openalex.org/W1540595797"],"abstract_inverted_index":{"Parikh\u2019s":[0,50,190,213,238],"Theorem":[1,51,191,214,239],"is":[2,67,79],"a":[3,58,80,107,163,185,234],"fundamental":[4],"result":[5],"in":[6,12,45,69,135,170,256],"automata":[7,63,132,194,217,221,242],"theory":[8,25,218],"with":[9],"numerous":[10],"applications":[11,99],"computer":[13],"science.":[14],"These":[15],"include":[16],"software":[17],"verification":[18,28],"(e.g.":[19,32,42,104],"infinite-state":[20],"verification,":[21],"string":[22,303],"constraints,":[23],"and":[24,39,174,243,261,295],"of":[26,29,57,109,122,166,172,184,188,200,226,273,280,285],"arrays),":[27],"cryptographic":[30],"protocols":[31],"using":[33],"Horn":[34],"clauses":[35],"modulo":[36],"equational":[37],"theories)":[38],"database":[40],"querying":[41],"evaluating":[43],"path-queries":[44],"graph":[46],"databases),":[47],"among":[48],"others.":[49],"states":[52],"that":[53,305],"the":[54,123,136,198,262,271,281],"letter-counting":[55],"abstraction":[56],"language":[59],"recognized":[60],"by":[61,206,310],"finite":[62,148],"or":[64,126,149],"context-free":[65],"grammars":[66],"definable":[68],"Linear":[70],"Integer":[71],"Arithmetic":[72],"(a.k.a.":[73],"Presburger":[74,85,224,260],"Arithmetic).":[75],"In":[76,229,265],"fact,":[77,266],"there":[78],"linear-time":[81],"algorithm":[82,251,268,294],"computing":[83],"existential":[84,223,254],"formulas":[86,225],"capturing":[87],"such":[88],"abstractions,":[89],"which":[90,112,161,245,277],"enables":[91],"an":[92,141,157,179,207,253],"efficient":[93],"analysis":[94],"via":[95],"SMT-solvers.":[96],"Unfortunately,":[97,210],"real-world":[98],"typically":[100],"require":[101],"large":[102,147],"alphabets":[103,124],"Unicode,":[105],"containing":[106],"million":[108],"characters)":[110],"\u2014":[111,125],"are":[113,204,278,306],"well-known":[114],"to":[115,119,139,178,196,219,270,301,308],"be":[116,140,299],"not":[117],"amenable":[118],"explicit":[120],"treatment":[121],"even":[127,150],"worse":[128],"infinite":[129,151,288],"alphabets.":[130,152,289],"Symbolic":[131],"have":[133,291],"proven":[134],"last":[137],"decade":[138],"effective":[142,158],"algorithmic":[143],"framework":[144],"for":[145,192,237,240],"handling":[146],"A":[153],"symbolic":[154,164,193,220,241,275],"automaton":[155],"employs":[156],"boolean":[159],"algebra,":[160],"offers":[162],"representation":[165,183],"character":[167],"sets":[168],"(i.e.":[169],"terms":[171],"predicates)":[173],"often":[175],"lends":[176],"itself":[177],"exponentially":[180],"more":[181],"succinct":[182],"language.":[186],"Instead":[187],"letter-counting,":[189],"amounts":[195],"counting":[197],"number":[199],"times":[201],"different":[202],"predicates":[203],"satisfied":[205],"input":[208],"sequence.":[209],"naively":[211],"applying":[212],"from":[215],"classical":[216],"yields":[222],"exponential":[227,248],"size.":[228],"this":[230,247],"paper,":[231],"we":[232],"provide":[233],"new":[235],"construction":[236],"grammars,":[244,276],"avoids":[246],"blowup:":[249],"our":[250,267,293],"computes":[252],"formula":[255],"polynomial-time":[257],"over":[258,287],"(quantifier-free)":[259],"base":[263],"theory.":[264],"extends":[269],"model":[272],"parametric":[274],"one":[279],"most":[282],"expressive":[283],"models":[284],"languages":[286],"We":[290],"implemented":[292],"show":[296],"it":[297],"can":[298],"used":[300],"solve":[302,309],"constraints":[304],"difficult":[307],"existing":[311],"solvers.":[312]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}