Search Results - "Lin, Anthony W"

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility by Lin, Anthony W., Majumdar, Rupak

“…Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables…”
Get full text

A linear-time algorithm for the orbit problem over cyclic groups by Lin, Anthony W., Zhou, Sanming

“…The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent…”
Get full text

Relational Perspective on Graph Query Languages by Figueira, Diego, Lin, Anthony W, Peterfreund, Liat

“…We study a relational perspective of graph database querying. Such a perspective underlies various graph database systems but very few theoretical…”
Get full text

Regular Abstractions for Array Systems by Hong, Chih-Duo, Lin, Anthony W

“…Verifying safety and liveness over array systems is a highly challenging problem. Array systems naturally capture parameterized systems such as distributed…”
Get full text

Parikh's Theorem Made Symbolic by Hague, Matthew, Jeż, Artur, Lin, Anthony W

“…Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state…”
Get full text

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility by Lin, Anthony W, Majumdar, Rupak

“…Logical Methods in Computer Science, Volume 17, Issue 4 (October 29, 2021) lmcs:6693 Word equations are a crucial element in the theoretical foundation of…”
Get full text

Ramsey Quantifiers in Linear Arithmetics by Bergsträßer, Pascal, Ganardi, Moses, Lin, Anthony W, Zetzsche, Georg

“…We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey quantifiers, which assert the existence of cliques (complete graphs) in the…”
Get full text

Regular Model Checking Revisited (Technical Report) by Lin, Anthony W, Rümmer, Philipp

“…In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems,…”
Get full text

Decision Procedures for Sequence Theories (Technical Report) by Jeż, Artur, Lin, Anthony W, Markgraf, Oliver, Rümmer, Philipp

“…Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear…”
Get full text

Learning Union of Integer Hypercubes with Queries (Technical Report) by Markgraf, Oliver, Stan, Daniel, Lin, Anthony W

“…We study the problem of learning a finite union of integer (axis-aligned) hypercubes over the d-dimensional integer lattice, i.e., whose edges are parallel to…”
Get full text

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification by Bergsträßer, Pascal, Ganardi, Moses, Lin, Anthony W, Zetzsche, Georg

“…Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic…”
Get full text

Characterising and Verifying the Core in Concurrent Multi-Player Mean-Payoff Games (Full Version) by Gutierrez, Julian, Lin, Anthony W, Najib, Muhammad, Steeples, Thomas, Wooldridge, Michael

“…Concurrent multi-player mean-payoff games are important models for systems of agents with individual, non-dichotomous preferences. Whilst these games have been…”
Get full text

CertiStr: A Certified String Solver (technical report) by Kan, Shuanglong, Lin, Anthony W, Rümmer, Philipp, Schrader, Micha

“…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…”
Get full text

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility by Lin, Anthony W, Majumdar, Rupak

“…Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years…”
Get full text

Probabilistic Bisimulation for Parameterized Systems (Technical Report) by Hong, Chih-Duo, Lin, Anthony W, Majumdar, Rupak, Rümmer, Philipp

“…Probabilistic bisimulation is a fundamental notion of process equivalence for probabilistic systems. Among others, it has important applications including…”
Get full text

Complexity Analysis of Tree Share Structure by Le, Xuan-Bach, Hobor, Aquinas, Lin, Anthony W

“…The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures…”
Get full text

Rational Verification for Probabilistic Systems by Gutierrez, Julian, Hammond, Lewis, Lin, Anthony W, Najib, Muhammad, Wooldridge, Michael

“…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…”
Get full text

Liveness of Randomised Parameterised Systems under Arbitrary Schedulers (Technical Report) by Lin, Anthony W, Ruemmer, Philipp

“…We consider the problem of verifying liveness for systems with a finite, but unbounded, number of processes, commonly known as parameterised systems. Typical…”
Get full text

Learning to prove safety over parameterised concurrent systems by Yu-Fang Chen, Chih-Duo Hong, Lin, Anthony W., Rummer, Philipp

“…We revisit the classic problem of proving safety over parameterised concurrent systems, i.e., an infinite family of finite-state concurrent systems that are…”
Get full text

String Solving with Word Equations and Transducers: Towards a Logic for Analysing Mutation XSS (Full Version) by Lin, Anthony W, Barcelo, Pablo

“…We study the fundamental issue of decidability of satisfiability over string logics with concatenations and finite-state transducers as atomic operations…”
Get full text