Pushdown Abstractions of JavaScript

Details Pushdown Abstractions of JavaScript Pushdown Abstractions of JavaScript

2011-09-21

arxiv.org/abs/1109.4467v2

Computer Science

Programming Languages

Scientific paper

We design a family of program analyses for JavaScript that make no approximation in matching calls with returns, exceptions with handlers, and breaks with labels. We do so by starting from an established reduction semantics for JavaScript and systematically deriving its intensional abstract interpretation. Our first step is to transform the semantics into an equivalent low-level abstract machine: the JavaScript Abstract Machine (JAM). We then give an infinite-state yet decidable pushdown machine whose stack precisely models the structure of the concrete program stack. The precise model of stack structure in turn confers precise control-flow analysis even in the presence of control effects, such as exceptions and finally blocks. We give pushdown generalizations of traditional forms of analysis such as k-CFA, and prove the pushdown framework for abstract interpretation is sound and computable.

Affiliated with

Also associated with

No associations

Rating

Pushdown Abstractions of JavaScript does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pushdown Abstractions of JavaScript, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pushdown Abstractions of JavaScript will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256951