Automated reasoning over string constraints

Liang, Tianyi

doi:10.17077/etd.rnqkky2n

Cited by 1 publication

(1 citation statement)

References 88 publications

(112 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reasoning about strings is increasingly required in program verification or in analysis of web applications and recently much effort has been dedicated toward designing solvers that handle string theories (possibly in combination with other theories), see e.g. [GKA + 11,ZZG13,LRT + 14,AAC + 14, HL14,Lia14]. This also includes works related to first-order theory of strings with order, see e.g.…”

Section: Introductionmentioning

confidence: 99%

Temporal logics on strings with prefix relation

Demri

Deters

2015

J Logic Computation

View full text Add to dashboard Cite

We show that linear-time temporal logic over concrete domains made of finite strings and the prefix relation admits a PSpace-complete satisfiability problem. Actually, we extend a known result with the concrete domain made of the set of natural numbers and the greater than relation (corresponding to the singleton alphabet case) and we solve an open problem mentioned in several publications. Since the prefix relation is not a total ordering, it is not possible to take advantage of existing techniques dedicated to temporal logics with concrete domains that are essentially linearly ordered structures. Instead, we introduce an adequate encoding of string constraints into length constraints that allows us to reduce the problem on strings to the problem on natural numbers. To do so, we also propose an extended version of the logic on strings that is able to compare lengths of longest common prefixes and for which the satisfiability problem is shown in PSpace. Finally, we show how to lift the result for the branching-time case in order to get decidability when the underlying temporal logic is CTL .

show abstract

Section: Introductionmentioning

confidence: 99%