Výsledky vyhledávání

Report

Chain-Free String Constraints (Technical Report)

Autor: Abdulla, Parosh Aziz, Diep, Mohamed Faouzi Atig Bui Phi, Holík, Lukáš, Janků, Petr

We address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This problem is undecidable in general. Therefore, we propose a new decidable

Externí odkaz: http://arxiv.org/abs/2307.03970

Zobrazit plný text záznamu

Report

String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report)

Autor: Holik, Lukas, Janku, Petr, Lin, Anthony W., Rümmer, Philipp, Vojnar, Tomas

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). A popular string analysis technique includes symbolic executions, wh

Externí odkaz: http://arxiv.org/abs/2010.15975

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Report

Lazy Automata Techniques for WS1S

Autor: Fiedor, Tomáš, Holík, Lukáš, Janků, Petr, Lengál, Ondřej, Vojnar, Tomáš

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 whether its language is empty. The main novelty is to test the emptine

Externí odkaz: http://arxiv.org/abs/1701.06282

Zobrazit plný text záznamu