Regular expressions are a classical concept in formal language theory. Regular expressions in programming languages (RegEx) such as JavaScript, feature non-standard semantics of operators (e.g. greedy/lazy Kleene star), as well as additional features such as capturing groups and references. While symbolic execution of programs containing RegExes appeals to string solvers natively supporting important features of RegEx, such a string solver is hitherto missing. In this paper, we propose the first string theory and string solver that natively provides such support. The key idea of our string solver is to introduce a new automata model, called prioritized streaming string transducers (PSST), to formalize the semantics of RegEx-dependent string...
String analysis is the problem of reasoning about how strings are manipulated by a program. It has n...
String processing is ubiquitous across computer science, and arguably more so in web programming. In...
Motivated by the vulnerability analysis of web programs which work on string inputs, we present S3, ...
Regular expressions are a classical concept in formal language theory. Regular expressions in progra...
Regular expressions are a classical concept in formal language theory. Regular expressions in progra...
Widespread use of string solvers in the formal analysis of string-heavy programs has led to a growin...
Using a regular language as a pattern for string matching is nowadays a common-and sometimes unsafe-...
Strings are ubiquitous in software. Tools for verification and testing of software rely in various d...
Evaluation Artifacts for: Solving String Theories involving Regular Membership Predicates Using SAT ...
The theory of strings with concatenation has been widely argued as the basis of constraint solving f...
AbstractIn this paper we revisit the semantics of extended regular expressions (regex), defined succ...
Abstract. There has been significant recent interest in automated rea-soning techniques, in particul...
We present a novel length-aware solving algorithm for the quantifier-free first-order theory over re...
Widespread use of string solvers in formal analysis of stringheavy programs has led to a growing dem...
Using dashed strings is an approach recently introduced in Constraint Programming (CP) to represent ...
String analysis is the problem of reasoning about how strings are manipulated by a program. It has n...
String processing is ubiquitous across computer science, and arguably more so in web programming. In...
Motivated by the vulnerability analysis of web programs which work on string inputs, we present S3, ...
Regular expressions are a classical concept in formal language theory. Regular expressions in progra...
Regular expressions are a classical concept in formal language theory. Regular expressions in progra...
Widespread use of string solvers in the formal analysis of string-heavy programs has led to a growin...
Using a regular language as a pattern for string matching is nowadays a common-and sometimes unsafe-...
Strings are ubiquitous in software. Tools for verification and testing of software rely in various d...
Evaluation Artifacts for: Solving String Theories involving Regular Membership Predicates Using SAT ...
The theory of strings with concatenation has been widely argued as the basis of constraint solving f...
AbstractIn this paper we revisit the semantics of extended regular expressions (regex), defined succ...
Abstract. There has been significant recent interest in automated rea-soning techniques, in particul...
We present a novel length-aware solving algorithm for the quantifier-free first-order theory over re...
Widespread use of string solvers in formal analysis of stringheavy programs has led to a growing dem...
Using dashed strings is an approach recently introduced in Constraint Programming (CP) to represent ...
String analysis is the problem of reasoning about how strings are manipulated by a program. It has n...
String processing is ubiquitous across computer science, and arguably more so in web programming. In...
Motivated by the vulnerability analysis of web programs which work on string inputs, we present S3, ...