research-article

Points-to analysis for JavaScript

Authors:

Kwang-Moo ChoeAuthors Info & Claims

SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing

Pages 1930 - 1937

https://doi.org/10.1145/1529282.1529711

Published: 08 March 2009 Publication History

Abstract

JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is evident. Points-to analysis for JavaScript is to determine the set of objects to which a reference variable or an object property may point. Points-to analysis for JavaScript is a basis for further program analyses for JavaScript. It has a wide range of applications in code optimization and software engineering tools. However, points-to analysis for JavaScript has not yet been developed.

JavaScript has dynamic features such as the runtime modification of objects through addition of properties or updating of methods. We propose a points-to analysis for JavaScript which precisely handles the dynamic features of JavaScript. Our work is the first attempt to analyze the points-to behavior of JavaScript. We evaluate the analysis on a set of JavaScript programs. We also apply the analysis to a code optimization technique to show that the analysis can be practically useful.

References

[1]

A. Aho, M. Lam, R. Sethi, and J. Ullman. Compilers: principles, techniques, and tools. Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA, 2006.

Digital Library

[2]

L. Andersen. Program analysis and specialization for the C programming language. PhD thesis, University of Cophenhagen, 1994.

[3]

C. Anderson, P. Giannini, and S. Drossopoulou. Towards type inference for JavaScript. 19th European Conference on Object-Oriented Programming, pages 428--453, 2005.

Digital Library

[4]

P. Cousot and R. Cousot. Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form. Lecture Notes in Computer Science, 939:293--308, 1995.

Digital Library

[5]

M. Das. Unification-based pointer analysis with directional assignments. Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, pages 35--46, 2000.

Digital Library

[6]

ECMA International. ECMAScript language specification. Stardard ECMA-262, 3rd Edition, Dec 1999. http://www.ecma-international.org/publications/files/ECMA-ST/Ecma-262.pdf.

[7]

J. Garrett. Ajax: A new approach to web applications, 2005.

[8]

N. Heintze. Set based program analysis. PhD thesis, Carnegie Mellon University, 1992.

Digital Library

[9]

N. Heintze. Set-based analysis of ML programs. ACM SIGPLAN Lisp Pointers, 7(3):306--317, 1994.

Digital Library

[10]

M. Hind and A. Pioli. Which pointer analysis should I use? ACM SIGSOFT Software Engineering Notes, 25(5):113--123, 2000.

Digital Library

[11]

A. Le Hors, P. Le Hégaret, L. Wood, G. Nicol, J. Robie, M. Champion, and S. Byrne. Document object model (DOM) level 3 core specification (W3C recommendation), 2004. http://www.w3.org/TR/DOM-Level-3-Core.

[12]

A. Rountev, A. Milanova, and B. Ryder. Points-to analysis for Java using annotated constraints. Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications, pages 43--55, 2001.

Digital Library

[13]

B. Steensgaard. Points-to analysis in almost linear time. Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 32--41, 1996.

Digital Library

[14]

The Webkit Open Source Project. Sunspider JavaScript benchmark, 2007. http://webkit.org/perf/sunspider-0.9/sunspider.html/.

[15]

The Mozilla Organization. Rhino: JavaScript for Java, 2004. http://www.mozilla.org/rhino/.

[16]

P. Thiemann. Towards a type system for analyzing JavaScript programs. European Symposium On Programming, pages 408--422, 2005.

Digital Library

Cited By

Ferreira MMonteiro MBrito TCoimbra MSantos NJia LSantos J(2024)Efficient Static Vulnerability Analysis for JavaScript with Multiversion Dependency GraphsProceedings of the ACM on Programming Languages10.1145/36563948:PLDI(417-441)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656394
Abadi AMakovitzki BShemer RTyszberowicz SHong JBures MPark JCerny T(2022)A lightweight approach for sound call graph approximationProceedings of the 37th ACM/SIGAPP Symposium on Applied Computing10.1145/3477314.3507126(1837-1844)Online publication date: 25-Apr-2022
https://dl.acm.org/doi/10.1145/3477314.3507126
Mathiasen APavlogiannis A(2021)The fine-grained and parallel complexity of andersen’s pointer analysisProceedings of the ACM on Programming Languages10.1145/34343155:POPL(1-29)Online publication date: 4-Jan-2021
https://dl.acm.org/doi/10.1145/3434315
Show More Cited By

Index Terms

Points-to analysis for JavaScript
1. Software and its engineering
  1. Software notations and tools
    1. Context specific languages
      1. Specialized application languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Program analysis
    2. Program semantics

Recommendations

Merging equivalent contexts for scalable heap-cloning-based context-sensitive points-to analysis
ISSTA '08: Proceedings of the 2008 international symposium on Software testing and analysis

A context-sensitive points-to analysis maintains separate points-to relationships for each possible (abstract) calling context of a method. Previous work has shown that a large number of equivalence classes exists in the representation of calling ...
Correlation tracking for points-to analysis of javascript
ECOOP'12: Proceedings of the 26th European conference on Object-Oriented Programming

JavaScript poses significant challenges for points-to analysis, particularly due to its flexible object model in which object properties can be created and deleted at run-time and accessed via first-class names. These features cause an increase in the ...
Efficient points-to analysis for whole-program analysis

To function on programs written in languages such as C that make extensive use of pointers, automated software engineering tools require safe alias information. Existing alias-analysis techniques that are sufficiently efficient for analysis on large ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing

March 2009

2347 pages

ISBN:9781605581668

DOI:10.1145/1529282

Conference Chairs:
Sung Y. Shin
South Dakota State University, United States
,
Sascha Ossowski
University Rey Juan Carlos, Spain

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 March 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Ministry of Education, Science and Technology

Conference

SAC09

Sponsor:

SIGAPP

SAC09: The 2009 ACM Symposium on Applied Computing

March 8, 2009 - March 12, 2008

Hawaii, Honolulu

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
725
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)1

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ferreira MMonteiro MBrito TCoimbra MSantos NJia LSantos J(2024)Efficient Static Vulnerability Analysis for JavaScript with Multiversion Dependency GraphsProceedings of the ACM on Programming Languages10.1145/36563948:PLDI(417-441)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656394
Abadi AMakovitzki BShemer RTyszberowicz SHong JBures MPark JCerny T(2022)A lightweight approach for sound call graph approximationProceedings of the 37th ACM/SIGAPP Symposium on Applied Computing10.1145/3477314.3507126(1837-1844)Online publication date: 25-Apr-2022
https://dl.acm.org/doi/10.1145/3477314.3507126
Mathiasen APavlogiannis A(2021)The fine-grained and parallel complexity of andersen’s pointer analysisProceedings of the ACM on Programming Languages10.1145/34343155:POPL(1-29)Online publication date: 4-Jan-2021
https://dl.acm.org/doi/10.1145/3434315
Santos JMaksimović PGrohens TDolby JGardner PSabel DThiemann P(2018)Symbolic Execution for JavaScriptProceedings of the 20th International Symposium on Principles and Practice of Declarative Programming10.1145/3236950.3236956(1-14)Online publication date: 3-Sep-2018
https://dl.acm.org/doi/10.1145/3236950.3236956
Elyasov APrasetya IHage J(2018)Search-Based Test Data Generation for JavaScript Functions that Interact with the DOM2018 IEEE 29th International Symposium on Software Reliability Engineering (ISSRE)10.1109/ISSRE.2018.00020(88-99)Online publication date: Oct-2018
https://doi.org/10.1109/ISSRE.2018.00020
Fragoso Santos JMaksimović PNaudžiūnienė DWood TGardner P(2017)JaVerT: JavaScript verification toolchainProceedings of the ACM on Programming Languages10.1145/31581382:POPL(1-33)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3158138
Sun KRyu S(2017)Analysis of JavaScript ProgramsACM Computing Surveys10.1145/310674150:4(1-34)Online publication date: 25-Aug-2017
https://dl.acm.org/doi/10.1145/3106741
Bielik PRaychev VVechev M(2017)Learning a Static Analyzer from DataComputer Aided Verification10.1007/978-3-319-63387-9_12(233-253)Online publication date: 13-Jul-2017
https://doi.org/10.1007/978-3-319-63387-9_12
Hague MLin AOng C(2015)Detecting redundant CSS rules in HTML5 applications: a tree rewriting approachACM SIGPLAN Notices10.1145/2858965.281428850:10(1-19)Online publication date: 23-Oct-2015
https://dl.acm.org/doi/10.1145/2858965.2814288
Hague MLin AOng CAldrich JEugster P(2015)Detecting redundant CSS rules in HTML5 applications: a tree rewriting approachProceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications10.1145/2814270.2814288(1-19)Online publication date: 23-Oct-2015
https://dl.acm.org/doi/10.1145/2814270.2814288
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten