A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Pushdown control-flow analysis for free
2016
SIGPLAN notices
Preserved Fulltext
Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. ...
Control-Flow Analysis (PDCFA) Pushdown control-flow analysis (PDCFA) is a strategy for creating a computable equivalent to the precision of our unbounded-stack machine at a quadratic-factor increase to ...
[4] presents a pushdown control-flow analysis (PD-CFA), which improves on traditional control-flow analysis by annotating edges in the state graph with stack actions (i.e., push and pop) that implicitly ...
doi:10.1145/2914770.2837631
fatcat:uuyxazeyr5fbvc4bliewcv7z4u
Pushdown control-flow analysis for free
2016
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Traditional control-flow analysis (CFA) for higher-order languages, whether implemented by constraint-solving or abstract interpretation, introduces spurious connections between callers and callees. ...
Furthermore, all three are computationally expensive; for a monovariant analysis, CFA2 is in O(2^n), PDCFA is in O(n^6), and AAC is in O(n^9 log n). ...
Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. ...
doi:10.1145/2837614.2837631
dblp:conf/popl/GilrayL0MH16
fatcat:vqaae7jkdvet5knl4yvbplmefi
Pushdown Control-Flow Analysis of Higher-Order Programs
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In the end, we arrive at a framework for control-flow analysis that can efficiently compute pushdown generalizations of classical control-flow analyses. ...
To this young body of work on context-free analysis of higher-order programs, we contribute a pushdown control-flow analysis framework, which we derive as an abstract interpretation of a CESK machine with ...
Acknowledgements We thank Dimitrios Vardoulakis for comments and discussions, and reviewers of ICFP and this workshop. ...
arXiv:1007.4268v1
fatcat:7lhbwmzqqfahhezs755ai4pvti
Introspective pushdown analysis of higher-order programs
2012
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming - ICFP '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For this example, pushdown analysis eliminates spurious return-flow from the use of recursion. But, recursion is just one problem of many for flow analysis. ...
For instance, pushdown analysis still gets tripped up by the spurious cross-flow problem; at calls to (id f) and (id g) in the previous example, it thinks (id g) could be f or g. ...
This material is based on research sponsored by DARPA under the programs Automated Program Analysis for Cybersecurity (FA8750-12-2-0106) and Clean-Slate Resilient Adaptive Hosts (CRASH). The U.S. ...
doi:10.1145/2364527.2364576
dblp:conf/icfp/EarlSMH12
fatcat:hctwkf7zvfflndfqubhzicf22u
Introspective pushdown analysis of higher-order programs
2012
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For this example, pushdown analysis eliminates spurious return-flow from the use of recursion. But, recursion is just one problem of many for flow analysis. ...
For instance, pushdown analysis still gets tripped up by the spurious cross-flow problem; at calls to (id f) and (id g) in the previous example, it thinks (id g) could be f or g. ...
This material is based on research sponsored by DARPA under the programs Automated Program Analysis for Cybersecurity (FA8750-12-2-0106) and Clean-Slate Resilient Adaptive Hosts (CRASH). The U.S. ...
doi:10.1145/2398856.2364576
fatcat:qdytyxzcjvfkddabcfzj4xmnq4
Stack-Summarizing Control-Flow Analysis of Higher-Order Programs
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
To make the direct product computable, we develop "stack summaries," a method for tracking stack properties at each control state in a pushdown analysis of higher-order programs. ...
The central contribution of this work is a direct product of abstract garbage collection with context-free analysis. ...
Comparison to pushdown control-flow analysis The abstract semantics of pushdown control-flow analysis are similar to those of the abstract semantics for classical control-flow analysis ( Figure 2) . ...
arXiv:1009.1560v1
fatcat:yp23cahyavhw7bhk5vctlb352q
Introspective Pushdown Analysis of Higher-Order Programs
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection skirt just inside the boundaries of soundness and decidability. ...
and precise product of pushdown analysis and abstract garbage collection. ...
This material is based on research sponsored by DARPA under the programs Automated Program Analysis for Cybersecurity (FA8750-12-2-0106) and Clean-Slate Resilient Adaptive Hosts (CRASH). The U.S. ...
arXiv:1207.1813v1
fatcat:4osxzawcajg6rhnh7cgefwdsme
Pushdown flow analysis with abstract garbage collection
2014
Journal of functional programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We show fully precise and approximate solutions to the feasible paths problem for pushdown garbage-collecting control-flow analysis. ...
Pushdown flow analysis grants unbounded yet computable polyvariance to the analysis of return-flow in higher-order programs. ...
Fig. 8 . 8 An ε-closure graph-powered iteration function for pushdown garbage-collecting control-flow analysis.
Fig. 9 . 9 Approximate pushdown garbage-collecting control-flow analysis. ...
doi:10.1017/s0956796814000100
fatcat:wrkxdigcibdfdoy6i3axm6blhq
Pushdown Exception-Flow Analysis of Object-Oriented Programs
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
The recent development of pushdown control-flow analysis for the λ-calculus hints at a way to improve analysis of exceptions: a pushdown stack can precisely match catches to throws in the same way it matches ...
This work generalizes pushdown control-flow analysis to object-oriented programs and to exceptions. ...
Pushdown analysis for the λ-calculus Vardoulakis and Shivers's CFA2 [30] is the precursor to the pushdown control-flow analysis [9] . ...
arXiv:1302.2692v1
fatcat:fikdd6274bd67nfncjvkh6g7rm
Pruning, Pushdown Exception-Flow Analysis
2014
2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Other Versions
First, from the angle of pruning control-flows (both normal and exceptional), we derive a pushdown framework for an object-oriented language with full-featured exceptions. ...
We evaluate our pruned, pushdown exception-flow analysis, comparing it with an established analysis on large scale standard Java benchmarks. ...
Pushdown control-flow analysis models the program stack (precisely) with the pushdown stack, for the purpose of pruning control-flows. ...
doi:10.1109/scam.2014.44
dblp:conf/scam/LiangSMKH14
fatcat:xvaepwgj7rhvdfpmmg4lqzndb4
Conditional weighted pushdown systems and applications
2010
Proceedings of the ACM SIGPLAN 2010 workshop on Partial evaluation and program manipulation - PEPM '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Reps et al. recently extended pushdown systems into weighted pushdown systems, which serve as a generalized framework for solving certain kinds of meet-overall-path problems in program analysis. ...
As an example, we lift a stacking-based pointsto analysis for Java designed in the framework of weighted pushdown systems to a more precise counterpart in the framework of conditional weighted pushdown ...
The authors would like to thank anonymous reviewers for their valuable comments. ...
doi:10.1145/1706356.1706382
dblp:conf/pepm/LiO10
fatcat:nekp6nimcbaz3ftdzfcde2cgna
Pushdown flow analysis of first-class control
2011
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
(γ, q)
Pushdown analyses model call/return faithfully. Fewer spurious control and data flows. ...
(k) h(v ) o/w ( (q e) γ , return mismatch causes spurious flow of data ⇒ commonly called functions pollute the analysis. ...
doi:10.1145/2034574.2034785
fatcat:rkqmhtmsjfblxeyzj7oewacqlq
Pushdown flow analysis of first-class control
2011
Proceeding of the 16th ACM SIGPLAN international conference on Functional programming - ICFP '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
(γ, q)
Pushdown analyses model call/return faithfully. Fewer spurious control and data flows. ...
(k) h(v ) o/w ( (q e) γ , return mismatch causes spurious flow of data ⇒ commonly called functions pollute the analysis. ...
doi:10.1145/2034773.2034785
dblp:conf/icfp/VardoulakisS11
fatcat:rhvf4yil7fer7j3m4hchk7w7zu
Analysing Mu-Calculus Properties of Pushdown Systems
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We provide a tool (PDSolver) implementing an algorithm for computing the winning regions of a pushdown parity game and its adaptation to the direct computation of modal µ-calculus properties over pushdown ...
We also extend the algorithm to allow backwards, as well as forwards, modalities and allow the user to restrict the control flow graph to configurations reachable from a designated initial state. ...
We thank Vijay D'Silva for recommending Steffen [3] , Oege De Moor for suggesting DaCapo, and Georg Weissenbacher for his comments. ...
doi:10.1007/978-3-642-16164-3_14
fatcat:twj6zlwgazd6bo47t5onb6zpue
An Ahead-of-time Yet Context-Sensitive Points-to Analysis for Java
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work, we propose an ahead-of-time yet context-sensitive points-to analysis for Java as all-in-one weighted pushdown model checking. ...
Due to the lack of control flow structure and the explicit stack-based design, program analysis on bytecode is not an easy matter. ...
A points-to analysis for C is shown by formulating pointer assignments as productions of context-free grammars. ...
doi:10.1016/j.entcs.2009.11.013
fatcat:vudbzyax7rbz3aw4ohrs7j2r3q
« Previous
Showing results 1 — 15 out of 1,158 results