Completeness of string analysis for dynamic languages

DOI10.1016/J.IC.2021.104791OpenAlexW3196466373MaRDI QIDQ2051812FDOQ2051812

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

abstract interpretationcompletenessstring analysis

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The octagon abstract domain
• Making abstract interpretations complete
• Two Variables per Linear Inequality as an Abstract Domain
• Static analysis of arithmetical congruences
• The octahedron abstract domain
• The closure operators of a lattice
• An efficient SMT solver for string constraints
• Comparison of abstract interpretations
• Abstract domains for type juggling
• The quotient of an abstract interpretation
• Completeness in approximate transduction
• Reference Abstract Domains and Applications to String Analysis
• 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
• Inferring Grammatical Summaries of String Values
• Transforming Abstract Interpretations by Abstract Interpretation
• Computing Abstract Distances in Logic Programs
• Making abstract models complete

Cited In (3)

• Analyzing the environment structure of higher-order languages using frame strings
• Relational string abstract domains
• A complete mechanization of correctness of a string-preprocessing algorithm

Uses Software

• JavaScript
• Rex
• Norn
• JSAI
• Phantm

Recommendations

• Title not available (Why is that?) 👍 👎
• An Evaluation of Automata Algorithms for String Analysis 👍 👎
• Completeness of context-sensitive rewriting 👍 👎
• Static Analysis of String Encoders and Decoders 👍 👎
• Computational and Proof Complexity of Partial String Avoidability 👍 👎
• A study in string processing languages 👍 👎
• Completeness of abstract domains for string analysis of JavaScript programs 👍 👎
• String Analysis as an Abstract Interpretation 👍 👎
• Model Checking for String Problems 👍 👎
• Decidability and Shortest Strings in Formal Languages 👍 👎

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)