Completeness of string analysis for dynamic languages

DOI10.1016/J.IC.2021.104791MaRDI QIDQ2051812zbMATH OpenOpenAlexFDO

Authors Vincenzo Arceri, Martina Olliaro, Agostino Cortesi, Isabella Mastroeni

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

abstract interpretationcompletenessstring analysis

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Completeness of abstract domains for string analysis of JavaScript programs
• String analysis as an abstract interpretation
• Decidability and shortest strings in formal languages
• Computational and proof complexity of partial string avoidability
• scientific article; zbMATH DE number 6851884
• Static analysis of string encoders and decoders
• Completeness of context-sensitive rewriting
• A study in string processing languages
• An Evaluation of Automata Algorithms for String Analysis
• Model Checking for String Problems

Cites work

• Abstract domains for type juggling
• An efficient SMT solver for string constraints
• Automata-based symbolic string analysis for vulnerability detection
• Comparison of abstract interpretations
• Completeness in approximate transduction
• Completeness of abstract domains for string analysis of JavaScript programs
• Computing abstract distances in logic programs
• scientific article; zbMATH DE number 1638645 (Why is no real title available?)
• scientific article; zbMATH DE number 1973222 (Why is no real title available?)
• scientific article; zbMATH DE number 1834576 (Why is no real title available?)
• scientific article; zbMATH DE number 2090837 (Why is no real title available?)
• Inferring grammatical summaries of string values
• Making abstract interpretations complete
• Making abstract models complete
• Reference abstract domains and applications to string analysis
• Static analysis of arithmetical congruences
• Static analysis. 16th international symposium, SAS 2009, Los Angeles, CA, USA, August 9--11, 2009. Proceedings
• The closure operators of a lattice
• The octagon abstract domain
• The octahedron abstract domain
• The quotient of an abstract interpretation
• Transforming Abstract Interpretations by Abstract Interpretation
• Two variables per linear inequality as an abstract domain

Cited in

(5)

• Abstract domains for type juggling
• Relational string abstract domains
• Completeness of abstract domains for string analysis of JavaScript programs
• A complete mechanization of correctness of a string-preprocessing algorithm
• Analyzing the environment structure of higher-order languages using frame strings

Describes a project that uses

Uses Software

• JavaScript
• Rex
• Norn
• JSAI
• Phantm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051812)