activity
20132026
most citedCertiStr: A Certified String Solver (technical report)

18 citations · 51 across the 22 of their papers we have counts for

collaborators
Showing 2020Show all

5 papers · 1 filter

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.LO2020★ 12 cited

Competition Report: CHC-COMP-20

Philipp Rümmer

CHC-COMP-20 is the third competition of solvers for Constrained Horn Clauses. In this year, 9 solvers participated at the competition, and were evaluated in four separate tracks on…

cs.LO2020

A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type

Taolue Chen, Matthew Hague, Jinlong He +4

Strings are widely used in programs, especially in web applications. Integer data type occurs naturally in string-manipulating programs, and is frequently used to refer to lengths…

cs.LO2020

Regular Model Checking Revisited (Technical Report)

Anthony W. Lin, Philipp Rümmer

In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameter…

cs.LO2020

Monadic Decomposition in Integer Linear Arithmetic (Technical Report)

Matthew Hague, Anthony Widjaja Lin, Philipp Rümmer +1

Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicat…