Chain-Free String Constraints

DOI10.1007/978-3-030-31784-3_16zbMath1437.68131OpenAlexW2981614836MaRDI QIDQ3297597

Mohamed Faouzi Atig, Bui Phi Diep, Petr Janků, Lukáš Holík, Parosh Aziz Abdulla

Publication date: 20 July 2020

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-31784-3_16

zbMATH Keywords

program verificationsatisfiability modulo theoriesstring constraints

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational aspects of satisfiability (68R07)

Related Items (6)

Relational string abstract domains ⋮ A solver for arrays with concatenation ⋮ Word equations in synergy with regular constraints ⋮ Twinning automata and regular expressions for string static analysis ⋮ Unnamed Item ⋮ A decision procedure for string to code point conversion

Uses Software

• z3
• Stranger
• CVC4
• HAMPI
• S3
• Norn
• GitHub
• Z3str3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling up DPLL(T) string solvers using context-dependent simplification
• String solving with word equations and transducers: towards a logic for analysing mutation XSS
• Graph Logics with Rational Relations
• An efficient algorithm for solving word equations
• Satisfiability of word equations with constants is in PSPACE
• Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• Progressive Reasoning over Recursively-Defined Strings
• String Analysis via Automata Manipulation with Logic Circuit Representation
• Automata, Languages and Programming
• Concatenation as a basis for arithmetic
• Makanin's algorithm for word equations-two improvements and a generalization

This page was built for publication: Chain-Free String Constraints