Scalable and Precise Static Analysis of JavaScript Applications via Loop-Sensitivity
Saved in:
| Title: | Scalable and Precise Static Analysis of JavaScript Applications via Loop-Sensitivity |
|---|---|
| Authors: | Park, Changhee, Ryu, Sukyoung |
| Contributors: | Changhee Park and Sukyoung Ryu |
| Publisher Information: | Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
| Publication Year: | 2015 |
| Collection: | DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics ) |
| Subject Terms: | JavaScript, static analysis, loops |
| Description: | The numbers and sizes of JavaScript applications are ever growing but static analysis techniques for analyzing large-scale JavaScript applications are not yet ready in a scalable and precise manner. Even when building complex software like compilers and operating systems in JavaScript, developers do not get much benefits from existing static analyzers, which suffer from mutually intermingled problems of scalability and imprecision. In this paper, we present Loop-Sensitive Analysis (LSA) that improves the analysis scalability by enhancing the analysis precision in loops. LSA distinguishes loop iterations as many as needed by automatically choosing loop unrolling numbers during analysis. We formalize LSA in the abstract interpretation framework and prove its soundness and precision theorems using Coq. We evaluate our implementation of LSA using the analysis results of main web pages in the 5 most popular websites and those of the programs that use top 5 JavaScript libraries, and show that it outperforms the state-of-the-art JavaScript static analyzers in terms of analysis scalability. Our mechanization and implementation of LSA are both publicly available. |
| Document Type: | article in journal/newspaper conference object |
| File Description: | application/pdf |
| Language: | English |
| Relation: | Is Part Of LIPIcs, Volume 37, 29th European Conference on Object-Oriented Programming (ECOOP 2015); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2015.735 |
| DOI: | 10.4230/LIPIcs.ECOOP.2015.735 |
| Availability: | https://doi.org/10.4230/LIPIcs.ECOOP.2015.735 https://nbn-resolving.org/urn:nbn:de:0030-drops-52458 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2015.735 |
| Rights: | https://creativecommons.org/licenses/by/3.0/legalcode |
| Accession Number: | edsbas.4BBFA0DC |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | The numbers and sizes of JavaScript applications are ever growing but static analysis techniques for analyzing large-scale JavaScript applications are not yet ready in a scalable and precise manner. Even when building complex software like compilers and operating systems in JavaScript, developers do not get much benefits from existing static analyzers, which suffer from mutually intermingled problems of scalability and imprecision. In this paper, we present Loop-Sensitive Analysis (LSA) that improves the analysis scalability by enhancing the analysis precision in loops. LSA distinguishes loop iterations as many as needed by automatically choosing loop unrolling numbers during analysis. We formalize LSA in the abstract interpretation framework and prove its soundness and precision theorems using Coq. We evaluate our implementation of LSA using the analysis results of main web pages in the 5 most popular websites and those of the programs that use top 5 JavaScript libraries, and show that it outperforms the state-of-the-art JavaScript static analyzers in terms of analysis scalability. Our mechanization and implementation of LSA are both publicly available. |
|---|---|
| DOI: | 10.4230/LIPIcs.ECOOP.2015.735 |