Related papers: OSTRICH2: Solver for Complex String Constraints
We develop a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of all intervals with rational endpoints. Internally, such sets…
Determining whether an unordered collection of overlapping substrings (called shingles) can be uniquely decoded into a consistent string is a problem that lies within the foundation of a broad assortment of disciplines ranging from…
Widespread use of string solvers in formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this context, especially for real-world cases. Designing an…
Strings are extensively used in modern programming languages and constraints over strings of unknown length occur in a wide range of real-world applications such as software analysis and verification, testing, model checking, and web…
We consider the problem of training a deep neural network with nonsmooth regularization to retrieve a sparse and efficient sub-structure. Our regularizer is only assumed to be lower semi-continuous and prox-bounded. We combine an adaptive…
We present Woorpje, a string solver for bounded word equations (i.e., equations where the length of each variable is upper bounded by a given integer). Our algorithm works by reformulating the satisfiability of bounded word equations as a…
The domains of data mining and knowledge discovery make use of large amounts of textual data, which need to be handled efficiently. Specific problems, like finding the maximum weight ordered common subset of a set of ordered sets or…
Many SMT solvers implement efficient SAT-based procedures for solving fixed-size bit-vector formulas. These approaches, however, cannot be used directly to reason about bit-vectors of symbolic bit-width. To address this shortcoming, we…
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern matching problem inspired by the popularity of such compression…
We observe a different type of complex solutions in the isotropic spin-1/2 Heisenberg chain starting from N=12, where the central rapidity of some of the odd-length strings becomes complex making not all the strings self-conjugate…
In this Letter, we explore nonrelativistic string solutions in various subsectors of the $ SU(1,2|3) $ SMT strings that correspond to different spin groups and satisfy the respective BPS bounds. In particular, we carry out an explicit…
JavaScript obfuscators are widely deployed to protect intellectual property and resist reverse engineering, yet their correctness has been largely overlooked compared to performance and resilience. Existing evaluations typically measure…
There are various reasons why adding stubs to the vertices of open string field theory (OSFT) is interesting: Not only the stubs can tame certain singularities and make the theory more well-behaved, but also the new theory shares a lot of…
SMT solvers have been used successfully as reasoning engines for automated verification and other applications based on automated reasoning. Current techniques for dealing with quantified formulas in SMT are generally incomplete, forcing…
We present a new approach for solving string equations as extensions of Nielsen transformations. Key to our work are the combination of three techniques: a power operator for strings; generalisations of Parikh images; and equality…
In recent years, dynamic languages, such as JavaScript or Python, have been increasingly used in a wide range of fields and applications. Their tricky and misunderstood behaviors pose a hard challenge for static analysis of these…
Motivated by the recent interest in the different aspects of the string/field theory duality, we describe an approach for obtaining exact string solutions in general backgrounds, based on two types of string embedding, allowing for…
In this paper we present a new boundary integral equation formulation for the solution of the elastostatic traction boundary value problem in two and three dimensions. The approach relies on the introduction of new layer potentials, called…
Exact substring matching is a common task in many software applications. Despite the existence of several algorithms for finding whether or not a pattern string is present in a target string, the most common implementation is a na\"ive,…
{\bf Exact} solutions of the string equations of motion and constraints are {\bf systematically} constructed in de Sitter spacetime using the dressing method of soliton theory. The string dynamics in de Sitter spacetime is integrable due to…