A symbolic algorithm for the case-split rule in solving word constraints with extensions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F23%3APU149380" target="_blank" >RIV/00216305:26230/23:PU149380 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.jss.2023.111673" target="_blank" >http://dx.doi.org/10.1016/j.jss.2023.111673</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.jss.2023.111673" target="_blank" >10.1016/j.jss.2023.111673</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A symbolic algorithm for the case-split rule in solving word constraints with extensions

Popis výsledku v původním jazyce

Case split is a core proof rule in current decision procedures for the theory of string constraints. Its use is the primary cause of the state space explosion in string constraint solving, since it is the only rule that creates branches in the proof tree. Moreover, explicit handling of the case split rule may cause recomputation of the same tasks in multiple branches of the proof tree. In this paper, we propose a symbolic algorithm that significantly reduces such a redundancy. In particular, we encode a string constraint as a regular language and proof rules as rational transducers. This allows us to perform similar steps in the proof tree only once, alleviating the state space explosion. We also extend the encoding to handle arbitrary Boolean combinations of string constraints, length constraints, and regular constraints. In our experimental results, we validate that our technique works in many practical cases where other state-of-the-art solvers fail to provide an answer; our Python prototype implementation solved over 50% of string constraints that could not be solved by the other tools.

Název v anglickém jazyce

A symbolic algorithm for the case-split rule in solving word constraints with extensions

Popis výsledku anglicky

Case split is a core proof rule in current decision procedures for the theory of string constraints. Its use is the primary cause of the state space explosion in string constraint solving, since it is the only rule that creates branches in the proof tree. Moreover, explicit handling of the case split rule may cause recomputation of the same tasks in multiple branches of the proof tree. In this paper, we propose a symbolic algorithm that significantly reduces such a redundancy. In particular, we encode a string constraint as a regular language and proof rules as rational transducers. This allows us to perform similar steps in the proof tree only once, alleviating the state space explosion. We also extend the encoding to handle arbitrary Boolean combinations of string constraints, length constraints, and regular constraints. In our experimental results, we validate that our technique works in many practical cases where other state-of-the-art solvers fail to provide an answer; our Python prototype implementation solved over 50% of string constraints that could not be solved by the other tools.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2023

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

JOURNAL OF SYSTEMS AND SOFTWARE

ISSN

0164-1212

e-ISSN

1873-1228

Svazek periodika

201

Číslo periodika v rámci svazku

201

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

21

Strana od-do

111673-111693

Kód UT WoS článku

000965770000001

EID výsledku v databázi Scopus

2-s2.0-85150809916