Completeness of string analysis for dynamic languages

DOI10.1016/j.ic.2021.104791OpenAlexW3196466373MaRDI QIDQ2051812

Isabella Mastroeni, Vincenzo Arceri, Martina Olliaro, Agostino Cortesi

Publication date: 25 November 2021

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104791

zbMATH Keywords

completenessabstract interpretationstring analysis

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Relational string abstract domains

Uses Software

• JavaScript
• Rex
• Norn
• JSAI
• Phantm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient SMT solver for string constraints
• The octagon abstract domain
• The octahedron abstract domain
• The quotient of an abstract interpretation
• Abstract domains for type juggling
• Completeness in approximate transduction
• Automata-based symbolic string analysis for vulnerability detection
• Static analysis. 16th international symposium, SAS 2009, Los Angeles, CA, USA, August 9--11, 2009. Proceedings
• Completeness of abstract domains for string analysis of JavaScript programs
• The closure operators of a lattice
• Inferring Grammatical Summaries of String Values
• Two Variables per Linear Inequality as an Abstract Domain
• Transforming Abstract Interpretations by Abstract Interpretation
• Reference Abstract Domains and Applications to String Analysis
• Static analysis of arithmetical congruences
• Computing Abstract Distances in Logic Programs
• Comparison of abstract interpretations
• Making abstract interpretations complete
• Making abstract models complete

This page was built for publication: Completeness of string analysis for dynamic languages