The following pages link to Norn (Q33653):
Displaying 13 items.
- The satisfiability of word equations: decidable and undecidable theories (Q1798903) (← links)
- Design and implementation of bounded-length sequence variables (Q2011574) (← links)
- Dashed strings for string constraint solving (Q2046015) (← links)
- On equations and first-order theory of one-relator monoids (Q2051781) (← links)
- Completeness of string analysis for dynamic languages (Q2051812) (← links)
- A decision procedure for string to code point conversion (Q2096448) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- Completeness of abstract domains for string analysis of JavaScript programs (Q2279128) (← links)
- Constraint programming for dynamic symbolic execution of JavaScript (Q2327235) (← links)
- MiniZinc with strings (Q2409726) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
- Chain-Free String Constraints (Q3297597) (← links)
