Related papers: A Solver for a Theory of Strings and Bit-vectors

Progress on string theory in curved spacetimes since 1992 are reviewed. After a short introduction on strings in Minkowski and curved spacetimes, we focus on strings in cosmological spacetimes. The classical behaviour of strings in FRW and…

We present a class of solvable models that resemble string theories in many respects but have a strikingly different non-perturbative sector. In particular, there are no exponentially small contributions to perturbation theory in the string…

String-bit models are both an efficient way of organizing string perturbation theory, and a possible non-perturbative composite description of string theory. This is a summary of ideas and results of string-bit and superstring-bit models,…

{\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…

String matching is a fundamental problem in computer science, with critical applications in text retrieval, bioinformatics, and data analysis. Among the numerous solutions that have emerged for this problem in recent decades,…

In this manuscript we study Liouvillian non-integrability of strings in $AdS_{6}\times S^{2}\times\Sigma$ background. We consider soliton strings and look for simple solutions in order to reduce the equations to only one linear second order…

Sublinear time quantum algorithms have been established for many fundamental problems on strings. This work demonstrates that new, faster quantum algorithms can be designed when the string is highly compressible. We focus on two popular and…

We analyze the problem of calculating the solutions and the spectrum of a string with arbitrary density and fixed ends. We build a perturbative scheme which uses a basis of WKB-type functions and obtain explicit expressions for the…

Z3-Noodler is a fork of Z3 that replaces its string theory solver with a custom solver implementing the recently introduced stabilization-based algorithm for solving word equations with regular constraints. An extensive experimental…

Numbers and numerical vectors account for a large portion of data. However, recently the amount of string data generated has increased dramatically. Consequently, classifying string data is a common problem in many fields. The most widely…

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…

We present HornStr, the first solver for invariant synthesis for Regular Model Checking (RMC) with the specification provided in the SMT-LIB 2.6 theory of strings. It is well-known that invariant synthesis for RMC subsumes various important…

We construct two new classes of exact solutions to string theory which are not of the standard plane wave or gauged WZW type. Many of these solutions have curvature singularities. The first class includes the fundamental string solution,…

In this paper we study the spectrum of bosonic string theory on AdS_3. We study classical solutions of the SL(2,R) WZW model, including solutions for long strings with non-zero winding number. We show that the model has a symmetry relating…

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 of, or positions in, strings. Analysis and testing of…

Given a formula $F$ of satisfiability modulo theory (SMT), the classical SMT solver tries to (1) abstract $F$ as a Boolean formula $F_B$, (2) find a Boolean solution to $F_B$, and (3) check whether the Boolean solution is consistent with…

This is the second paper of a series of three. We construct effective open-closed superstring couplings by classically integrating out massive fields from open superstring field theories coupled to an elementary gauge invariant tadpole…

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…

It has been known for some time that the SL(2,R) WZWN model reduces to Liouville theory. Here we give a direct and physical derivation of this result based on the classical string equations of motion and the proper string size. This allows…

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…