Aarhus University Seal / Aarhus Universitets segl

Sparse Dataflow Analysis with Pointers and Reachability

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Standard

Sparse Dataflow Analysis with Pointers and Reachability. / Madsen, Magnus; Møller, Anders.

Static Analysis: 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. ed. / Markus Müller-Olm ; Helmut Seidl. Springer VS, 2014. p. 201-218 (Lecture Notes in Computer Science, Vol. 8723).

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Harvard

Madsen, M & Møller, A 2014, Sparse Dataflow Analysis with Pointers and Reachability. in M Müller-Olm & H Seidl (eds), Static Analysis: 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. Springer VS, Lecture Notes in Computer Science, vol. 8723, pp. 201-218, International Static Analysis Symposium (SAS), Munich, Germany, 11/09/2014. https://doi.org/10.1007/978-3-319-10936-7_13

APA

Madsen, M., & Møller, A. (2014). Sparse Dataflow Analysis with Pointers and Reachability. In M. Müller-Olm , & H. Seidl (Eds.), Static Analysis: 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings (pp. 201-218). Springer VS. Lecture Notes in Computer Science Vol. 8723 https://doi.org/10.1007/978-3-319-10936-7_13

CBE

Madsen M, Møller A. 2014. Sparse Dataflow Analysis with Pointers and Reachability. Müller-Olm M, Seidl H, editors. In Static Analysis: 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. Springer VS. pp. 201-218. (Lecture Notes in Computer Science, Vol. 8723). https://doi.org/10.1007/978-3-319-10936-7_13

MLA

Madsen, Magnus and Anders Møller "Sparse Dataflow Analysis with Pointers and Reachability". and Müller-Olm , Markus Seidl, Helmut (editors). Static Analysis: 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. Springer VS. (Lecture Notes in Computer Science, Vol. 8723). 2014, 201-218. https://doi.org/10.1007/978-3-319-10936-7_13

Vancouver

Madsen M, Møller A. Sparse Dataflow Analysis with Pointers and Reachability. In Müller-Olm M, Seidl H, editors, Static Analysis: 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. Springer VS. 2014. p. 201-218. (Lecture Notes in Computer Science, Vol. 8723). https://doi.org/10.1007/978-3-319-10936-7_13

Author

Madsen, Magnus ; Møller, Anders. / Sparse Dataflow Analysis with Pointers and Reachability. Static Analysis: 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. editor / Markus Müller-Olm ; Helmut Seidl. Springer VS, 2014. pp. 201-218 (Lecture Notes in Computer Science, Vol. 8723).

Bibtex

@inproceedings{a56c91db1a4b4abb84218f13fb6bdf8d,
title = "Sparse Dataflow Analysis with Pointers and Reachability",
abstract = " Many static analyzers exploit sparseness techniques to reduce the amount of information being propagated and stored during analysis. Although several variations are described in the literature, no existing technique is suitable for analyzing JavaScript code. In this paper, we point out the need for a sparse analysis framework that supports pointers and reachability. We present such a framework, which uses static single assignment form for heap addresses and computes def-use information on-the-fly. We also show that essential information about dominating definitions can be maintained efficiently using quadtrees. The framework is presented as a systematic modification of a traditional dataflow analysis algorithm.Our experimental results demonstrate the effectiveness of the technique for a suite of JavaScript programs. By also comparing the performance with an idealized staged approach that computes pointer information with a pre-analysis, we show that the cost of computing def-use information on-the-fly is remarkably small. ",
author = "Magnus Madsen and Anders M{\o}ller",
year = "2014",
doi = "10.1007/978-3-319-10936-7_13",
language = "English",
isbn = "978-3-319-10935-0",
series = "Lecture Notes in Computer Science",
publisher = "Springer VS",
pages = "201--218",
editor = "{ M{\"u}ller-Olm }, {Markus } and { Seidl}, {Helmut }",
booktitle = "Static Analysis",
note = "null ; Conference date: 11-09-2014 Through 13-09-2014",

}

RIS

TY - GEN

T1 - Sparse Dataflow Analysis with Pointers and Reachability

AU - Madsen, Magnus

AU - Møller, Anders

PY - 2014

Y1 - 2014

N2 - Many static analyzers exploit sparseness techniques to reduce the amount of information being propagated and stored during analysis. Although several variations are described in the literature, no existing technique is suitable for analyzing JavaScript code. In this paper, we point out the need for a sparse analysis framework that supports pointers and reachability. We present such a framework, which uses static single assignment form for heap addresses and computes def-use information on-the-fly. We also show that essential information about dominating definitions can be maintained efficiently using quadtrees. The framework is presented as a systematic modification of a traditional dataflow analysis algorithm.Our experimental results demonstrate the effectiveness of the technique for a suite of JavaScript programs. By also comparing the performance with an idealized staged approach that computes pointer information with a pre-analysis, we show that the cost of computing def-use information on-the-fly is remarkably small.

AB - Many static analyzers exploit sparseness techniques to reduce the amount of information being propagated and stored during analysis. Although several variations are described in the literature, no existing technique is suitable for analyzing JavaScript code. In this paper, we point out the need for a sparse analysis framework that supports pointers and reachability. We present such a framework, which uses static single assignment form for heap addresses and computes def-use information on-the-fly. We also show that essential information about dominating definitions can be maintained efficiently using quadtrees. The framework is presented as a systematic modification of a traditional dataflow analysis algorithm.Our experimental results demonstrate the effectiveness of the technique for a suite of JavaScript programs. By also comparing the performance with an idealized staged approach that computes pointer information with a pre-analysis, we show that the cost of computing def-use information on-the-fly is remarkably small.

U2 - 10.1007/978-3-319-10936-7_13

DO - 10.1007/978-3-319-10936-7_13

M3 - Article in proceedings

SN - 978-3-319-10935-0

T3 - Lecture Notes in Computer Science

SP - 201

EP - 218

BT - Static Analysis

A2 - Müller-Olm , Markus

A2 - Seidl, Helmut

PB - Springer VS

Y2 - 11 September 2014 through 13 September 2014

ER -