2 citations · 2 across the 4 of their papers we have counts for
7 papers · 1 filter
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…
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…
CSS Minification via Constraint Solving (Technical Report)
Matthew Hague, Anthony W. Lin, Chih-Duo Hong
Minification is a widely-accepted technique which aims at reducing the size of the code transmitted over the web. We study the problem of minifying Cascading Style Sheets (CSS) ---…
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems
Matthew Hague, Roland Meyer, Sebastian Muskalla +1
We give a direct polynomial-time reduction from parity games played over the configuration graphs of collapsible pushdown systems to safety games played over the same class of grap…
What Is Decidable about String Constraints with the ReplaceAll Function
Taolue Chen, Yan Chen, Matthew Hague +2
Recently, it was shown that any theory of strings containing the string-replace function (even the most restricted version where pattern/replacement strings are both constant strin…
Decidable models of integer-manipulating programs with recursive parallelism (technical report)
Matthew Hague, Anthony Widjaja Lin
We study safety verification for multithreaded programs with recursive parallelism (i.e. unbounded thread creation and recursion) as well as unbounded integer variables. Since the…