{"id":"https://openalex.org/W4416933462","doi":"https://doi.org/10.1145/3776723","title":"Counting and Sampling Traces in Regular Languages","display_name":"Counting and Sampling Traces in Regular Languages","publication_year":2026,"publication_date":"2026-01-08","ids":{"openalex":"https://openalex.org/W4416933462","doi":"https://doi.org/10.1145/3776723"},"language":"en","primary_location":{"id":"doi:10.1145/3776723","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776723","pdf_url":null,"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":null,"license_id":null,"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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3776723","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068440199","display_name":"Alexis de Colnet","orcid":"https://orcid.org/0000-0002-7517-6735"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Alexis de Colnet","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041528950","display_name":"Kuldeep S. Meel","orcid":"https://orcid.org/0000-0001-9423-5270"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kuldeep S. Meel","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016958234","display_name":"Umang Mathur","orcid":"https://orcid.org/0000-0002-7610-0660"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Umang Mathur","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068440199"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01631412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"POPL","first_page":"2352","last_page":"2379"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9520999789237976,"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/T11567","display_name":"semigroups and automata theory","score":0.9520999789237976,"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/T12029","display_name":"DNA and Biological Computing","score":0.008999999612569809,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.008100000210106373,"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/regular-language","display_name":"Regular language","score":0.569100022315979},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5310999751091003},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.5232999920845032},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.46540001034736633},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.45339998602867126},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4474000036716461},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.430400013923645},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4300000071525574},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.4131999909877777},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4104999899864197}],"concepts":[{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.569100022315979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5516999959945679},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5310999751091003},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.5232999920845032},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.46540001034736633},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.45339998602867126},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4474000036716461},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.430400013923645},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4300000071525574},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.4131999909877777},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4104999899864197},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4104999899864197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4004000127315521},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3955000042915344},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.3630000054836273},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.3612000048160553},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.35519999265670776},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.34360000491142273},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3375000059604645},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.33379998803138733},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.33219999074935913},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.3310000002384186},{"id":"https://openalex.org/C2779795794","wikidata":"https://www.wikidata.org/wiki/Q7315343","display_name":"Reset (finance)","level":2,"score":0.3255999982357025},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31450000405311584},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.30959999561309814},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.2955000102519989},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.2709999978542328},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.25609999895095825}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3776723","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776723","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2512.00314","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.00314","pdf_url":"https://arxiv.org/pdf/2512.00314","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3776723","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776723","pdf_url":null,"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":null,"license_id":null,"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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,36],"study":[4],"the":[5,21,65,68,71,81,108,111,149,152,185,192,195,206,211,226,231,262,284],"fundamental":[6],"problems":[7,35,129],"of":[8,73,92,148,151,213,240],"counting":[9,66,186,210,227],"and":[10,24,237,270],"sampling":[11,109],"traces":[12,75,96,280],"that":[13,79,97,120,167,184,225,278,283],"a":[14,41,49,57,114,118,145,214,250,266,271],"regular":[15,42],"language":[16,43,196],"touches.":[17],"Formally,":[18],"one":[19,101],"fixes":[20],"alphabet":[22],"\u03a3":[23,30,90],"an":[25,144],"independence":[26],"relation":[27],"I":[28],"\u2286":[29],"\u00d7":[31],"\u03a3.":[32],"The":[33],"computational":[34],"address":[37],"take":[38],"as":[39,48,135,159,161],"input":[40],"L":[44,85,88,93,104,197,242],"over":[45,124],"\u03a3,":[46],"presented":[47],"finite":[50],"automaton":[51,193],"with":[52,56,258,292],"m":[53],"states,":[54],"together":[55],"natural":[58],"number":[59,72],"n":[60,82,86,91,105],"(presented":[61],"in":[62,103,202,219,230],"unary).":[63],"For":[64,107],"problem,":[67,110],"output":[69,112],"is":[70,113,121,175,188,198,201,217,243,289],"Mazurkiewicz":[74],"(induced":[76],"by":[77,132],"I)":[78],"intersect":[80],"th":[83],"slice":[84],"=":[87],"\u2229":[89],",":[94],"i.e.,":[95],"have":[98],"at":[99],"least":[100],"linearization":[102],".":[106],"trace":[115],"drawn":[116],"from":[117],"distribution":[119,285],"approximately":[122,290],"uniform":[123,173,275,291],"all":[125],"such":[126,134],"traces.":[127],"These":[128],"are":[130,249],"motivated":[131],"applications":[133],"bounded":[136],"model":[137],"checking":[138],"based":[139],"on":[140,287],"partial-order":[141],"reduction,":[142],"where":[143,172],"priori":[146],"estimate":[147],"size":[150],"state":[153],"space":[154],"can":[155],"significantly":[156],"improve":[157],"usability,":[158],"well":[160],"testing":[162],"approaches":[163],"for":[164,177,209,234],"concurrent":[165],"programs":[166],"use":[168],"partial-order-aware":[169],"random":[170],"sampling,":[171],"exploration":[174],"desirable":[176],"effective":[178],"bug":[179],"detection.":[180],"We":[181,222],"first":[182],"show":[183,224],"problem":[187,208,228],"#P-hard":[189],"even":[190],"when":[191],"accepting":[194],"deterministic,":[199],"which":[200,216],"sharp":[203],"contrast":[204],"to":[205],"corresponding":[207],"words":[212],"DFA,":[215],"solvable":[218],"polynomial":[220],"time.":[221],"then":[223],"remains":[229],"class":[232],"#P":[233],"both":[235],"NFAs":[236],"DFAs,":[238],"independent":[239],"whether":[241],"trace-closed.":[244],"Finally,":[245],"our":[246],"main":[247],"contributions":[248],"fully":[251,272],"polynomial-time":[252,273],"randomized":[253],"approximation":[254],"scheme":[255],"(FPRAS)":[256],"that,":[257],"high":[259,293],"probability,":[260],"estimates":[261],"desired":[263],"count":[264],"within":[265],"specified":[267],"accuracy":[268],"parameter,":[269],"almost":[274],"sampler":[276],"(FPAUS)":[277],"generates":[279],"while":[281],"ensuring":[282],"induced":[286],"them":[288],"probability.":[294]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-12-03T00:00:00"}