18 citations · 38 across the 26 of their papers we have counts for
30 papers
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…
CertiStr: A Certified String Solver (technical report)
Shuanglong Kan, Anthony W. Lin, Philipp Rümmer +1
Theories over strings are among the most heavily researched logical theories in the SMT community in the past decade, owing to the error-prone nature of string manipulations, which…
Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorities And Variables
Taolue Chen, Alejandro Flores Lamas, Matthew Hague +6
Regular expressions are a classical concept in formal language theory. Regular expressions in programming languages (RegEx) such as JavaScript, feature non-standard semantics of op…
Rational Verification for Probabilistic Systems
Julian Gutierrez, Lewis Hammond, Anthony W. Lin +2
Rational verification is the problem of determining which temporal logic properties will hold in a multi-agent system, under the assumption that agents in the system act rationally…
Regular Model Checking Approach to Knowledge Reasoning over Parameterized Systems (technical report)
Daniel Stan, Anthony Widjaja Lin
We present a general framework for modelling and verifying epistemic properties over parameterized multi-agent systems that communicate by truthful public announcements. In our fra…