Twinning automata and regular expressions for string static analysis

DOI10.1007/978-3-030-67067-2_13zbMath1472.68039arXiv2006.02715OpenAlexW3126151140MaRDI QIDQ2234078

Pietro Ferrara, Agostino Cortesi, Luca Negrini, Vincenzo Arceri

Publication date: 18 October 2021

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

zbMATH Keywords

static analysisabstract interpretationstring analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Relational string abstract domains

Cites Work

• Unnamed Item
• Abstract domains for type juggling
• A parametric abstract domain for lattice-valued regular expressions
• Dashed strings for string constraint solving
• Computer aided verification. 26th international conference, CAV 2014, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 18--22, 2014. Proceedings
• Automata-based symbolic string analysis for vulnerability detection
• Widening and narrowing operators for abstract interpretation
• Completeness of abstract domains for string analysis of JavaScript programs
• Abstract Symbolic Automata
• Chain-Free String Constraints
• Abstract Program Slicing
• Abstract Interpretation Frameworks
• Computer Aided Verification
• Programming Languages and Systems
• Applications of Symbolic Finite Automata
• Making abstract interpretations complete
• A Practical String Analyzer by the Widening Approach
• Minimization of symbolic automata

This page was built for publication: Twinning automata and regular expressions for string static analysis