HAMPI

swMATH9864MaRDI QIDQ21843

No author found.

Related Items (20)

An SMT solver for regular expressions and linear arithmetic over string length ⋮ Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings ⋮ Symbolic Automata: The Toolkit ⋮ Satisfiability Modulo Theories ⋮ Unbounded Model-Checking with Interpolation for Regular Language Constraints ⋮ MiniZinc with strings ⋮ Towards more efficient methods for solving regular-expression heavy string constraints ⋮ A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings ⋮ Simple linear string constraints ⋮ Chain-Free String Constraints ⋮ An efficient SMT solver for string constraints ⋮ Automata-based symbolic string analysis for vulnerability detection ⋮ Z3str2: an efficient solver for strings, regular expressions, and length constraints ⋮ Automatic Evaluation of Context-Free Grammars (System Description) ⋮ Design and implementation of bounded-length sequence variables ⋮ The satisfiability of word equations: decidable and undecidable theories ⋮ On equations and first-order theory of one-relator monoids ⋮ Data-Parallel String-Manipulating Programs ⋮ Constraint programming for dynamic symbolic execution of JavaScript ⋮ Harnessing static analysis to help learn pseudo-inverses of string manipulating procedures for automatic test generation

This page was built for software: HAMPI