18 citations · 38 across the 26 of their papers we have counts for
21 papers · 1 filter
Decision Procedures for Sequence Theories (Technical Report)
Artur Jeż, Anthony W. Lin, Oliver Markgraf +1
Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequ…
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin +1
Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite…
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)…
Complexity Analysis of Tree Share Structure
Xuan-Bach Le, Aquinas Hobor, Anthony W. Lin
The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are…
Parameterized Synthesis with Safety Properties
Oliver Markgraf, Chih-Duo Hong, Anthony W. Lin +2
Parameterized synthesis offers a solution to the problem of constructing correct and verified controllers for parameterized systems. Such systems occur naturally in practice (e.g.,…
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…