scientific article; zbMATH DE number 7471664

MaRDI QIDQ5028423

Rupak Majumdar, Anthony Widjaja Lin

Publication date: 9 February 2022

Full work available at URL: https://arxiv.org/abs/2007.15478

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

accelerationword equationslength constraintsPresburger with divisibility

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items

Word equations in the context of string solving, Unification modulo lists with reverse relation with certain word equations

Uses Software

• S3
• FAST
• Z3str3

Cites Work

• Automata-based symbolic string analysis for vulnerability detection
• String solving with word equations and transducers: towards a logic for analysing mutation XSS
• Almost linear Büchi automata
• Path Feasibility Analysis for String-Manipulating Programs
• The Diophantine Problem for Addition and Divisibility
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• The expressibility of languages and relations by word equations
• On the Complexity of Linear Arithmetic with Divisibility
• The hardness of solving simple word equations
• Automated Technology for Verification and Analysis
• On Context-Free Languages
• Concatenation as a basis for arithmetic
• Flat Parametric Counter Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item