{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T01:03:55Z","timestamp":1784595835718,"version":"3.55.0"},"reference-count":61,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.scico.2026.103510","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T06:54:41Z","timestamp":1779432881000},"page":"103510","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Effective methods for solving regex crossword puzzles"],"prefix":"10.1016","volume":"254","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0070-4095","authenticated-orcid":false,"given":"Rongchen","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8100-9127","authenticated-orcid":false,"given":"Weihao","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1617-1457","authenticated-orcid":false,"given":"Hong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2659-4148","authenticated-orcid":false,"given":"Haiming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zixuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/j.scico.2026.103510_bib0001","doi-asserted-by":"crossref","DOI":"10.1002\/smr.2273","article-title":"Automated generation of oracled test cases with regular expressions and combinatorial techniques","volume":"32","author":"Polo","year":"2020","journal-title":"J. Softw. Evol. Process."},{"key":"10.1016\/j.scico.2026.103510_bib0002","series-title":"SEBD 2021","first-page":"5","article-title":"Efficient validation of functional dependencies during incremental discovery","author":"Caruccio","year":"2021"},{"key":"10.1016\/j.scico.2026.103510_bib0003","first-page":"1","article-title":"Solving string constraints with regex-dependent functions through transducers with priorities and variables","volume":"6","author":"Chen","year":"2022","journal-title":"POPL 2022"},{"key":"10.1016\/j.scico.2026.103510_bib0004","series-title":"PLDI 2019","first-page":"425","article-title":"Sound regular expression semantics for dynamic symbolic execution of JavaScript","author":"Loring","year":"2019"},{"issue":"1","key":"10.1016\/j.scico.2026.103510_bib0005","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/TR.2019.2925415","article-title":"DIAVA: a traffic-based framework for detection of SQL injection attacks and vulnerability analysis of leaked data","volume":"69","author":"Gu","year":"2019","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/j.scico.2026.103510_bib0006","series-title":"ISSRE 2017","first-page":"339","article-title":"Automatically repairing web application firewalls based on successful SQL injection attacks","author":"Appelt","year":"2017"},{"key":"10.1016\/j.scico.2026.103510_bib0007","series-title":"ISSTA 2016","first-page":"189","article-title":"Optimal sanitization synthesis for web application vulnerability repair","author":"Yu","year":"2016"},{"key":"10.1016\/j.scico.2026.103510_bib0008","series-title":"CEC 2020","first-page":"1","article-title":"Data-driven regular expressions evolution for medical text classification using genetic programming","author":"Liu","year":"2020"},{"key":"10.1016\/j.scico.2026.103510_bib0009","series-title":"EMNLP 2020","first-page":"3193","article-title":"Cold-start and interpretability: turning regular expressions into trainable recurrent neural networks","author":"Jiang","year":"2020"},{"issue":"2","key":"10.1016\/j.scico.2026.103510_bib0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3490488","article-title":"SemMT: a semantic-based testing approach for machine translation systems","volume":"31","author":"Cao","year":"2022","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"issue":"2","key":"10.1016\/j.scico.2026.103510_bib0011","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/3484622.3484624","article-title":"Database principles and challenges in text analysis","volume":"50","author":"Doleschal","year":"2021","journal-title":"ACM SIGMOD Rec."},{"issue":"1","key":"10.1016\/j.scico.2026.103510_bib0012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3351451","article-title":"Efficient enumeration algorithms for regular document spanners","volume":"45","author":"Florenzano","year":"2020","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.scico.2026.103510_bib0013","series-title":"FSDM 2019","first-page":"645","article-title":"Active learning of predefined models for information extraction: selecting regular expressions from examples","author":"Bartoli","year":"2019"},{"issue":"1","key":"10.1016\/j.scico.2026.103510_bib0014","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s00236-016-0282-1","article-title":"Conjunctive query containment over trees using schema information","volume":"55","author":"Bj\u00f6rklund","year":"2018","journal-title":"Acta Inform."},{"issue":"2","key":"10.1016\/j.scico.2026.103510_bib0015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2850413","article-title":"Querying graphs with data","volume":"63","author":"Libkin","year":"2016","journal-title":"J. ACM"},{"key":"10.1016\/j.scico.2026.103510_bib0016","series-title":"ICDE 2020","first-page":"1962","article-title":"FlashSchema: achieving high quality XML schemas with powerful inference algorithms and large-scale schema data","author":"Li","year":"2020"},{"key":"10.1016\/j.scico.2026.103510_bib0017","series-title":"SPIN \u201917","first-page":"196","article-title":"ExpoSE: practical symbolic execution of standalone JavaScript","author":"Loring","year":"2017"},{"key":"10.1016\/j.scico.2026.103510_bib0018","series-title":"USENIX Security \u201921","first-page":"3847","article-title":"ReDoSHunter: a combined static and dynamic approach for regular expression DoS detection","author":"Li","year":"2021"},{"key":"10.1016\/j.scico.2026.103510_bib0019","series-title":"S&P 2022","first-page":"1049","article-title":"Repairing DoS vulnerability of real-world regexes","author":"Chida","year":"2022"},{"key":"10.1016\/j.scico.2026.103510_bib0020","first-page":"1","article-title":"Automatic repair of regular expressions","volume":"3","author":"Pan","year":"2019","journal-title":"OOPSLA 2019"},{"key":"10.1016\/j.scico.2026.103510_bib0021","series-title":"PLDI 2020","first-page":"487","article-title":"Multi-modal synthesis of regular expressions","author":"Chen","year":"2020"},{"key":"10.1016\/j.scico.2026.103510_bib0022","series-title":"ASE 2020","first-page":"659","article-title":"FlashRegex: deducing Anti-ReDos regexes from examples","author":"Li","year":"2020"},{"key":"10.1016\/j.scico.2026.103510_bib0023","series-title":"ICST 2010","first-page":"498","article-title":"Rex: symbolic regular expression explorer","author":"Veanes","year":"2010"},{"key":"10.1016\/j.scico.2026.103510_bib0024","unstructured":"Y. Jeong, regex-crossword-solver, 2018, https:\/\/github.com\/blukat29\/regex-crossword-solver."},{"key":"10.1016\/j.scico.2026.103510_bib0025","series-title":"FSCD 2022","first-page":"15:1","article-title":"On lookaheads in regular expressions with backreferences","volume":"228","author":"Chida","year":"2022"},{"issue":"3","key":"10.1016\/j.scico.2026.103510_bib0026","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/1353782.1374190","article-title":"Crossword puzzle: clues and solutions","volume":"15","author":"Anderson","year":"2008","journal-title":"Interactions"},{"key":"10.1016\/j.scico.2026.103510_bib0027","series-title":"AI 2001","first-page":"78","article-title":"Constraint programming lessons learned from crossword puzzles","author":"Beacham","year":"2001"},{"key":"10.1016\/j.scico.2026.103510_bib0028","series-title":"AAAI Conference on Artificial Intelligence","first-page":"210","article-title":"Search lessons learned from crossword puzzles","volume":"Vol. 90","author":"Ginsberg","year":"1990"},{"key":"10.1016\/j.scico.2026.103510_bib0029","unstructured":"Slashdot, Can You Do the Regular Expression Crossword, 2013, https:\/\/games.slashdot.org\/story\/13\/02\/13\/2346253\/canyou-do-the-regular-expression-crossword."},{"key":"10.1016\/j.scico.2026.103510_bib0030","unstructured":"L. Black, Can You Do the Regular Expression Crossword, 2014, https:\/\/www.i-programmer.info\/news\/144-graphics-and-games\/5450-can-youdo-the-regular-expression-crossword.html."},{"key":"10.1016\/j.scico.2026.103510_bib0031","unstructured":"CTFtime.org, CTFtime.org \/ HackPack CTF 2021 \/ Regex World, 2021, https:\/\/ctftime.org\/task\/15582."},{"key":"10.1016\/j.scico.2026.103510_bib0032","unstructured":"MIT, A Regular Crossword (Solution), 2013, http:\/\/www.mit.edu\/activities\/puzzle\/2013\/coinheist.com\/rubik\/a_regular_crossword\/answer\/index.html."},{"key":"10.1016\/j.scico.2026.103510_bib0033","unstructured":"A. Trux, Regex-crossword-solver, 2017, https:\/\/github.com\/antoine-trux\/regex-crossword-solver."},{"key":"10.1016\/j.scico.2026.103510_bib0034","unstructured":"M. Shcherban, gp-crossword-solver, 2019, https:\/\/github.com\/maxymczech\/gp-regex-crossword."},{"key":"10.1016\/j.scico.2026.103510_bib0035","unstructured":"R. Abolofia, Regex-crossword-solver, 2015, https:\/\/github.com\/purple4reina\/regex-crossword-solver."},{"key":"10.1016\/j.scico.2026.103510_bib0036","unstructured":"H. Schaaf, Regex-crossword-solver, 2014, https:\/\/github.com\/hermanschaaf\/regex-crossword-solver."},{"key":"10.1016\/j.scico.2026.103510_bib0037","unstructured":"S. Fenner, The complexity of some regex crossword problems, 2014, arXiv: 1411.5437."},{"key":"10.1016\/j.scico.2026.103510_bib0038","article-title":"The complexity of regex crosswords","volume":"286","author":"Fenner","year":"2021","journal-title":"Inf. Comput."},{"key":"10.1016\/j.scico.2026.103510_bib0039","series-title":"CAV 2000","first-page":"154","article-title":"Counterexample-guided abstraction refinement","author":"Clarke","year":"2000"},{"issue":"3","key":"10.1016\/j.scico.2026.103510_bib0040","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/j.scico.2026.103510_bib0041","series-title":"SETTA 2023","first-page":"206","article-title":"Modeling regex operators for solving regex crossword puzzles","author":"Su","year":"2023"},{"key":"10.1016\/j.scico.2026.103510_bib0042","series-title":"Handbook of Formal Languages, Vol. 1: Word, Language, Grammar","first-page":"41","article-title":"Regular languages","author":"Yu","year":"1997"},{"key":"10.1016\/j.scico.2026.103510_bib0043","unstructured":"ECMA-262, ECMAScript\u00ae 2022 Language Specification, 2022, https:\/\/tc39.es\/ecma262\/multipage\/."},{"key":"10.1016\/j.scico.2026.103510_bib0044","unstructured":"R. Cox, Regular Expression Matching Can Be Simple And Fast, 2007, https:\/\/swtch.com\/~rsc\/regexp\/regexp1.html."},{"key":"10.1016\/j.scico.2026.103510_bib0045","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.tcs.2022.10.041","article-title":"Re-examining regular expressions with backreferences","volume":"940","author":"Berglund","year":"2022","journal-title":"Theor. Comput. Sci."},{"issue":"06","key":"10.1016\/j.scico.2026.103510_bib0046","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1142\/S012905410300214X","article-title":"A formal study of practical regular expressions","volume":"14","author":"C\u00e2mpeanu","year":"2003","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"10.1016\/j.scico.2026.103510_bib0047","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s00224-012-9389-0","article-title":"Extended regular expressions: succinctness and decidability","volume":"53","author":"Freydenberger","year":"2013","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.scico.2026.103510_bib0048","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2016.02.003","article-title":"Characterising REGEX languages by regular languages equipped with factor-referencing","volume":"249","author":"Schmid","year":"2016","journal-title":"Inf. Comput."},{"key":"10.1016\/j.scico.2026.103510_bib0049","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jcss.2019.04.001","article-title":"Deterministic regular expressions with back-references","volume":"105","author":"Freydenberger","year":"2019","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.scico.2026.103510_bib0050","series-title":"LATA 2009","first-page":"279","article-title":"On extended regular expressions","author":"Carle","year":"2009"},{"key":"10.1016\/j.scico.2026.103510_bib0051","first-page":"255","article-title":"Algorithms for finding patterns in strings","volume":"1","author":"Alfred","year":"2014","journal-title":"Algorithms Complex."},{"key":"10.1016\/j.scico.2026.103510_bib0052","series-title":"TACAS 2008","first-page":"337","article-title":"Z3: an efficient SMT solver","author":"de Moura","year":"2008"},{"key":"10.1016\/j.scico.2026.103510_bib0053","unstructured":"R. Cox, Regular Expression Matching in the Wild, 2010, https:\/\/swtch.com\/~rsc\/regexp\/regexp3.html."},{"key":"10.1016\/j.scico.2026.103510_bib0054","series-title":"CP 2004","first-page":"482","article-title":"A regular language membership constraint for finite sequences of variables","author":"Pesant","year":"2004"},{"key":"10.1016\/j.scico.2026.103510_bib0055","series-title":"S&P 2010","first-page":"513","article-title":"A symbolic execution framework for JavaScript","author":"Saxena","year":"2010"},{"key":"10.1016\/j.scico.2026.103510_bib0056","series-title":"HVC 2013","first-page":"15","article-title":"PASS: string solving with parameterized array and interval automaton","author":"Li","year":"2013"},{"key":"10.1016\/j.scico.2026.103510_bib0057","first-page":"1026","article-title":"Derivative based nonbacktracking real-world regex matching with backtracking semantics","volume":"7","author":"Moseley","year":"2023","journal-title":"PLDI 2023"},{"key":"10.1016\/j.scico.2026.103510_bib0058","unstructured":"N. Peter, Regex Golf with Peter Norvig, 2014, https:\/\/www.oreilly.com\/learning\/regex-golf-with-peternorvig."},{"key":"10.1016\/j.scico.2026.103510_bib0059","unstructured":"C.-M. Media, Copy Editor, 2021, https:\/\/www.cinqmarsmedia.com\/copyeditor\/index.html."},{"key":"10.1016\/j.scico.2026.103510_bib0060","unstructured":"M.L. Lab, RegexPlay, 2016, http:\/\/play.inginf.units.it\/."},{"key":"10.1016\/j.scico.2026.103510_bib0061","unstructured":"M. Lurig, RegEx Crossword Puzzle | Fun with Regular Expressions, https:\/\/mariolurig.com\/crossword\/."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642326000766?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642326000766?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T00:41:13Z","timestamp":1784594473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642326000766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":61,"alternative-id":["S0167642326000766"],"URL":"https:\/\/doi.org\/10.1016\/j.scico.2026.103510","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Effective methods for solving regex crossword puzzles","name":"articletitle","label":"Article Title"},{"value":"Science of Computer Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.scico.2026.103510","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103510"}}