Matthew Hague
Skip Abstract Section
Abstract
The first edition of MOSCA, the Meeting on String Constraints and Applications was held in May 2019 in the otherworldly location of Bertinoro [D'Antoni et al. 2019]. For one week, 43 participants presented surveys and discussed recent research into the analysis of string constraints.
- Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, and Philipp Rümmer. 2017a. Flatten and conquer: a framework for efficient analysis of string constraints. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, Barcelona, Spain, June 18--23, 2017. 602--617. Google Scholar
Digital Library
- Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Seth Fogarty, Lukas Holik, Chih-Duo Hong, Ondra Lengal, Richard Mayr, Jiri Simacek, Moshe Vardi, and Tomas Vojnar. 2017b. http://languageinclusion.org. (2017). [Online; accessed 18-July-2019].Google Scholar
- Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey, and Guido Tack. 2016. MiniZinc with Strings. In Logic-Based Program Synthesis and Transformation - 26th International Symposium, LOPSTR 2016, Edinburgh, UK, September 6--8, 2016, Revised Selected Papers. 59--75. Google ScholarCross Ref
- Renzo Angles, Marcelo Arenas, Pablo Barceló, Aidan Hogan, Juan L. Reutter, and Domagoj Vrgoc. 2017. Foundations of Modern Query Languages for Graph Databases. ACM Comput. Surv. 50, 5 (2017), 68:1--68:40. Google ScholarDigital Library
- Abdulbaki Aydin, William Eiers, Lucas Bang, Tegan Brennan, Miroslav Gavrilov, Tevfik Bultan, and Fang Yu. 2018. Parameterized model counting for string and numeric constraints. In Proceedings of the 2018 ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC/SIGSOFT FSE 2018, Lake Buena Vista, FL, USA, November 04--09, 2018. 400--410. Google ScholarDigital Library
- Pablo Barceló, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, and Reino Niskanen. 2019. Monadic Decomposability of Regular Relations. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9--12, 2019, Patras, Greece. 103:1--103:14. Google ScholarCross Ref
- Nikolaj Bjørner, Nikolai Tillmann, and Andrei Voronkov. 2009. Path Feasibility Analysis for String-Manipulating Programs. In Tools and Algorithms for the Construction and Analysis of Systems, 15th International Conference, TACAS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22--29, 2009. Proceedings. 307--321. Google ScholarDigital Library
- J Richard Büchi and Steven Senger. 1990. Definability in the existential theory of concatenation and undecidable extensions of this theory. In The Collected Works of J. Richard Büchi. Springer, 671--683.Google Scholar
- Cristian Cadar, Daniel Dunbar, and Dawson Engler. 2008. KLEE: Unassisted and Automatic Generation of High-coverage Tests for Complex Systems Programs. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI'08). USENIX Association, Berkeley, CA, USA, 209--224. http://dl.acm.org/citation.cfm?id=1855741.1855756Google ScholarDigital Library
- Taolue Chen, Matthew Hague, Anthony W. Lin, Philipp Rümmer, and Zhilin Wu. 2019. Decision procedures for path feasibility of string-manipulating programs with complex operations. PACMPL 3, POPL (2019), 49:1--49:30. Google ScholarDigital Library
- Dmitry Chistikov and Mikhail Vyalyi. 2019. Re-pairing brackets. CoRR abs/1904.08402 (2019). http://arxiv.org/abs/1904.08402Google Scholar
- Lori A. Clarke. 1976. A System to Generate Test Data and Symbolically Execute Programs. IEEE Trans. Software Eng. 2, 3 (1976), 215--222. Google ScholarDigital Library
- Arlen Cox and Jason Leasure. 2017. Model Checking Regular Language Constraints. CoRR abs/1708.09073 (2017). http://arxiv.org/abs/1708.09073Google Scholar
- Loris D'Antoni, Anthony W. Lin, and Philipp Rümmer. 2019. Meeting on String Constraints and Applications. https://mosca19.github.io. (2019).Google Scholar
- Loris D'Antoni and Margus Veanes. 2017. The Power of Symbolic Automata and Transducers. In Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24--28, 2017, Proceedings, Part I. 47--67. Google ScholarCross Ref
- Vrunda Dave, Paul Gastin, and Shankara Narayanan Krishna. 2018. Regular Transducer Expressions for Regular Transformations. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09--12, 2018. 315--324. Google ScholarDigital Library
- Martin Davis, Hilary Putnam, and Julia Robinson. 1961. The Decision Problem for Exponential Diophantine Equations. Annals of Mathematics 74, 3 (1961), 425--436. http://www.jstor.org/stable/1970289Google ScholarCross Ref
- Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, and Danny Bøgsted Poulsen. 2019. On Solving Word Equations Using SAT. In Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11--13, 2019, Proceedings. 93--106. Google ScholarCross Ref
- Joel D. Day, Florin Manea, and Dirk Nowotka. 2017. The Hardness of Solving Simple Word Equations. In 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21--25, 2017 - Aalborg, Denmark. 18:1--18:14. Google ScholarCross Ref
- María Emilia Descotte, Diego Figueira, and Gabriele Puppis. 2018. Resynchronizing Classes of Word Relations. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9--13, 2018, Prague, Czech Republic. 123:1--123:13. Google ScholarCross Ref
- Volker Diekert, Claudio Gutiérrez, and Christian Hagenah. 2001. The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. In STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15--17, 2001, Proceedings. 170--182. Google ScholarCross Ref
- Volker Diekert, Yuri V. Matiyasevich, and Anca Muscholl. 1997. Solving Trace Equations Using Lexicographical Normal Forms. In Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7--11 July 1997, Proceedings. 336--346. Google ScholarCross Ref
- Volker Diekert and John Michael Robson. 1999. Quadratic Word Equations. In Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa. 314--326.Google Scholar
- Valery Durnev. 1997. Studying Algorithmic Problems for Free Semi-groups and Groups. In Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6--12, 1997, Proceedings. 88--101. Google ScholarCross Ref
- Javier Esparza and Pierre Ganty. 2011. Complexity of pattern-based verification for multi-threaded programs. In Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26--28, 2011. 499--510. Google ScholarDigital Library
- Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, and Tomás Vojnar. 2017. Lazy Automata Techniques for WS1S. In Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22--29, 2017, Proceedings, Part I. 407--425. Google ScholarDigital Library
- Claudio Gutiérrez. 1998. Satisfiability of Word Equations with Constants is in Exponential Space. In 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8--11, 1998, Palo Alto, California, USA. 112--119. Google ScholarCross Ref
- Ju. I. Hmelevskii. 1971. Equations in free semigroups. Trudy Mat. Inst. Steklov. 107 (1971).Google Scholar
- Lukás Holík, Petr Janku, Anthony W. Lin, Philipp Rümmer, and Tomás Vojnar. 2018. String constraints with concatenation and transducers solved efficiently. PACMPL 2, POPL (2018), 4:1--4:32. Google ScholarDigital Library
- Chih-Duo Hong, Anthony W. Lin, Rupak Majumdar, and Philipp Rümmer. 2019. Probabilistic Bisimulation for Parameterized Systems - (with Applications to Verifying Anonymous Protocols). In Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15--18, 2019, Proceedings, Part I. 455--474. Google ScholarCross Ref
- Joxan Jaffar. 1990. Minimal and Complete Word Unification. J. ACM 37, 1 (1990), 47--85. Google ScholarDigital Library
- Artur Jez. 2013. Recompression: a simple and powerful technique for word equations. In 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany. 233--244. Google ScholarCross Ref
- James C. King. 1976. Symbolic Execution and Program Testing. Commun. ACM 19, 7 (1976), 385--394. Google ScholarDigital Library
- Antoni Koscielski and Leszek Pacholski. 1996. Complexity of Makanin's Algorithm. J. ACM 43, 4 (1996), 670--684. Google ScholarDigital Library
- Antonia Lechner, Joël Ouaknine, and James Worrell. 2015. On the Complexity of Linear Arithmetic with Divisibility. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6--10, 2015. 667--676. Google ScholarDigital Library
- Ondrej Lengál, Anthony Widjaja Lin, Rupak Majumdar, and Philipp Rümmer. 2017. Fair Termination for Parameterized Probabilistic Concurrent Systems. In Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22--29, 2017, Proceedings, Part I. 499--517. Google ScholarDigital Library
- Tianyi Liang, Andrew Reynolds, Nestan Tsiskaridze, Cesare Tinelli, Clark W. Barrett, and Morgan Deters. 2016. An efficient SMT solver for string constraints. Formal Methods in System Design 48, 3 (2016), 206--234. Google ScholarDigital Library
- Anthony Widjaja Lin and Pablo Barceló. 2016. String solving with word equations and transducers: towards a logic for analysing mutation XSS. In Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20 - 22, 2016. 123--136. Google ScholarDigital Library
- Anthony W. Lin and Rupak Majumdar. 2018. Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility. In Automated Technology for Verification and Analysis - 16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7--10, 2018, Proceedings. 352--369. Google ScholarCross Ref
- Blake Loring, Duncan Mitchell, and Johannes Kinder. 2019. Sound regular expression semantics for dynamic symbolic execution of JavaScript. In Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, Phoenix, AZ, USA, June 22--26, 2019. 425--438. Google ScholarDigital Library
- G. S. Makanin. 1977. The problem of solvability of equations in a free semigroup. Sbornik: Mathematics 32, 2 (1977), 129198.Google Scholar
- G. S. Makanin. 1982. Equations in a free group. Izv. Akad. Nauk SSSR, Ser: Mat. 46 (1982), 11991273.Google Scholar
- Yu. Matiyasevich. 1970. The Diophantineness of enumerable sets. Dokl. Akad. Nauk SSSR 191 (1970), 279--282.Google Scholar
- Yuri V. Matiyasevich. 1997. Some Decision Problems for Traces. In Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6--12, 1997, Proceedings. 248--257. Google ScholarCross Ref
- Yannic Noller, Corina S. Pasareanu, Aymeric Fromherz, Xuan-Bach D. Le, and Willem Visser. 2019. Symbolic Pathfinder for SV-COMP - (Competition Contribution). In Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of TACAS: TOOLympics, Held as Part of ETAPS 2019, Prague, Czech Republic, April 6--11, 2019, Proceedings, Part III. 239--243. Google ScholarCross Ref
- Wojciech Plandowski. 1999. Satisfiability of Word Equations with Constants is in PSPACE. In 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17--18 October, 1999, New York, NY, USA. 495--500. Google ScholarCross Ref
- Wojciech Plandowski and Wojciech Rytter. 1998. Application of Lempel-Ziv Encodings to the Solution of Words Equations. In Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13--17, 1998, Proceedings. 731--742. Google ScholarCross Ref
- W. V. Quine. 1946. Concatenation as a Basis for Arithmetic. J. Symb. Log. 11, 4 (1946), 105--114. Google ScholarCross Ref
- Mark Santolucito, Drew Goldman, Allyson Weseley, and Ruzica Piskac. 2018. Programming by Example: Efficient, but Not "Helpful". In 9th Workshop on Evaluation and Usability of Programming Languages and Tools, PLATEAU@SPLASH 2018, November 5, 2018, Boston, Massachusetts, USA. 3:1--3:10. Google ScholarCross Ref
- Klaus U. Schulz. 1990. Makanin's Algorithm for Word Equations - Two Improvements and a Generalization. In Word Equations and Related Topics, First International Workshop, IWWERT '90, Tübingen, Germany, October 1--3, 1990, Proceedings. 85--150. Google ScholarCross Ref
- Margus Veanes. 2017. Symbolic Automata Theory with Applications (Invited Talk). In 26th EACSL Annual Conference on Computer Science Logic, CSL 2017, August 20--24, 2017, Stockholm, Sweden. 7:1--7:3. Google ScholarCross Ref
- Hung-En Wang, Shih-Yu Chen, Fang Yu, and Jie-Hong R. Jiang. 2018. A symbolic model checking approach to the analysis of string and length constraints. In Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering, ASE 2018, Montpellier, France, September 3--7, 2018. 623--633. Google ScholarDigital Library
- Yunhui Zheng, Vijay Ganesh, Sanu Subramanian, Omer Tripp, Murphy Berzish, Julian Dolby, and Xiangyu Zhang. 2017. Z3str2: an efficient solver for strings, regular expressions, and length constraints. Formal Methods in System Design 50, 2--3 (2017), 249--288. Google ScholarDigital Library
Index Terms
- Strings at MOSCA
Index terms have been assigned to the content through auto-classification.
Recommendations
Prefix and Suffix Reversals on Strings
SPIRE 2015: Proceedings of the 22nd International Symposium on String Processing and Information Retrieval - Volume 9309The Sorting by Prefix Reversals problem consists in sorting the elements of a given permutation $$\pi $$ with a minimum number of prefix reversals, i.e. reversals that always imply the leftmost element of $$\pi $$. A natural extension of this problem is ...
Bounding prefix transposition distance for strings and permutations
A transposition is an operation that exchanges two adjacent substrings. Transpositions over permutations, the sequences with no repeated symbols, are related to genome rearrangements. If one of the substrings is restricted to a prefix then it is called ...
Prefix and suffix transreversals on binary and ternary strings
The problem of sorting by a genome rearrangement event asks for the minimum number of that event required to sort the elements of a given permutation. In this paper, we study a variant of the rearrangement event called prefix and suffix transreversal. A ...
Comments