HAMPI

swMATH9864MaRDI QIDQ21843FDOQ21843

Author name not available (Why is that?)

Cited In (20)

• On equations and first-order theory of one-relator monoids
• MiniZinc with strings
• Constraint programming for dynamic symbolic execution of JavaScript
• An SMT solver for regular expressions and linear arithmetic over string length
• Automatic evaluation of context-free grammars (system description)
• A decision procedure for regular membership and length constraints over unbounded strings
• Design and implementation of bounded-length sequence variables
• Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings
• The satisfiability of word equations: decidable and undecidable theories
• Unbounded model-checking with interpolation for regular language constraints
• Towards more efficient methods for solving regular-expression heavy string constraints
• Simple linear string constraints
• Satisfiability modulo theories
• Z3str2: an efficient solver for strings, regular expressions, and length constraints
• Automata-based symbolic string analysis for vulnerability detection
• Harnessing static analysis to help learn pseudo-inverses of string manipulating procedures for automatic test generation
• Chain-free string constraints
• Symbolic automata: the toolkit
• An efficient SMT solver for string constraints
• Data-parallel string-manipulating programs

This page was built for software: HAMPI