Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Lin, Anthony W."'
We study a relational perspective of graph database querying. Such a perspective underlies various graph database systems but very few theoretical investigations have been conducted on it. This perspective offers a powerful and unified framework to s
Externí odkaz:
http://arxiv.org/abs/2407.06766
Autor:
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 protocols with an unbounded number of processes. Such distributed protocols often exploit proc
Externí odkaz:
http://arxiv.org/abs/2401.02618
We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey quantifiers, which assert the existence of cliques (complete graphs) in the graph induced by some formulas. The extended framework is known to have applications in provi
Externí odkaz:
http://arxiv.org/abs/2311.04031
Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic protocols (e
Externí odkaz:
http://arxiv.org/abs/2311.03901
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). Sequences are natural abstractions of extendable arrays, which permit a we
Externí odkaz:
http://arxiv.org/abs/2308.00175
Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite words and trees (ranked/unranked). We investigate the "directed versio
Externí odkaz:
http://arxiv.org/abs/2205.09015
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 often leads to security vulnerabilities (e.g. cross-site scripting an
Externí odkaz:
http://arxiv.org/abs/2112.06039
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, by choosing strategies that collectively form a game-theoretic equil
Externí odkaz:
http://arxiv.org/abs/2107.09119
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 the coordinate axes. This is a natural generalization of the classic problem in the computa
Externí odkaz:
http://arxiv.org/abs/2105.13071