Completeness of abstract domains for string analysis of JavaScript programs

DOI10.1007/978-3-030-32505-3_15MaRDI QIDQ2279128zbMATH OpenOpenAlexFDO

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

Publication date 12 December 2019

Full work available at URL http://hdl.handle.net/10278/3721097

zbMATH Keywords

string analysisabstract interpretation completenessstring abstract domains

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Completeness of string analysis for dynamic languages
• Making abstract models complete
• Making abstract interpretations complete
• Complete abstractions everywhere
• Deciding program properties via complete abstractions on bounded domains

Cited in

(2)

• Completeness of string analysis for dynamic languages
• Twinning automata and regular expressions for string static analysis

Describes a project that uses

Uses Software

• Phantm
• JSAI
• Norn
• JavaScript

This page was built for publication: Completeness of abstract domains for string analysis of JavaScript programs

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