Static Analysis for ECMAScript String Manipulation Programs

doi:10.3390/app10103525

Static Analysis for ECMAScript String Manipulation Programs

2020-05-20

0

OA

AI

DOI：10.3390/app10103525

原文链接

查看原文

摘要

En 中文

In recent years, dynamic languages, such as JavaScript or Python, have been increasingly used in a wide range of fields and applications. Their tricky and misunderstood behaviors pose a great challenge for static analysis of these languages. A key aspect of any dynamic language program is the multiple usage of strings, since they can be implicitly converted to another type value, transformed by string-to-code primitives or used to access an object-property. Unfortunately, string analyses for dynamic languages still lack precision and do not take into account some important string features. In this scenario, more precise string analyses become a necessity. The goal of this paper is to place a first step for precisely handling dynamic language string features. In particular, we propose a new abstract domain approximating strings as finite state automata and an abstract interpretation-based static analysis for the most common string manipulating operations provided by the ECMAScript specification. The proposed analysis comes with a prototype static analyzer implementation for an imperative string manipulating language, allowing us to show and evaluate the improved precision of the proposed analysis.

Static Analysis for ECMAScript String Manipulation Programs

摘要

AI总结

期刊

机构

引用论文