3 papers
cs.FL2023
Chain-Free String Constraints (Technical Report)
Parosh Aziz Abdulla, Mohamed Faouzi Atig Bui Phi Diep, Lukáš Holík +1
We address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This pro…
cs.LO2020
String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report)
Lukas Holik, Petr Janku, Anthony W. Lin +2
String analysis is the problem of reasoning about how strings are manipulated by a program. It has numerous applications including automatic detection of cross-site scripting (XSS)…
cs.LO2017
Lazy Automata Techniques for WS1S
Tomáš Fiedor, Lukáš Holík, Petr Janků +2
We present a new decision procedure for the logic WS1S. It originates from the classical approach, which first builds an automaton accepting all models of a formula and then tests…