Last edited by Goltihn
Thursday, April 23, 2020 | History

2 edition of Symbolic context-sensitive pointer analysis. found in the catalog.

Symbolic context-sensitive pointer analysis.

Silvian Calman

Symbolic context-sensitive pointer analysis.

  • 215 Want to read
  • 6 Currently reading

Published .
Written in English


About the Edition

Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have suggested the symbolic method, which uses Bryant"s Binary Decision Diagram as an alternative to capture the point-to relation, no speed advantage has been demonstrated for context-insensitive analysis, and results for context-sensitive analysis are only preliminary.We refine the concept of symbolic transfer function proposed earlier and establish a common framework for both context-insensitive and context-sensitive pointer analysis. With this framework, the transfer function of a procedure can abstract away the impact of its callers and callees, and represent its point-to information completely, compactly and canonically. In addition, we propose a symbolic representation of the invocation graph, which can otherwise be exponentially large. In contrast to the classical frameworks where context-sensitive point-to information of a procedure has to be obtained by the application of its transfer function exponentially many times, our method can obtain point-to information of all contexts in a single application. Our experimental evaluation on a wide range of C benchmarks indicates that our context-sensitive pointer analysis can be made almost as fast as its context-insensitive counterpart.

The Physical Object
Pagination70 leaves.
Number of Pages70
ID Numbers
Open LibraryOL19214849M
ISBN 100494021993

Compiler Design - CS Online Study Material, Lecturing Notes, Assignment, Reference, Wiki and important questions and answers => Symbolic Analysis Chapter Instruction Level Parallelism => Context-Insensitive Interprocedural Analysis => Context-Sensitive Pointer Analysis => Datalog Implementation by BDD's. Data Structure Analysis is a context-sensitive pointer analysis which identifies data structures on the heap and their important properties (such as type safety). Automatic Pool Allocation uses the results of Data Structure Analysis to segregate dynamically allocated objects on the heap, giving control over the layout of the data structure in.


Share this book
You might also like
Contes Et Nouvelles

Contes Et Nouvelles

Three distance learning programmes within the health sector in England, Sweden and Zimbabwe

Three distance learning programmes within the health sector in England, Sweden and Zimbabwe

Occupational employment forecasts 1996

Occupational employment forecasts 1996

Solution to CAPE pure mathematics Unit 2

Solution to CAPE pure mathematics Unit 2

Dictionary of anonymous and pseudonymous English literature

Dictionary of anonymous and pseudonymous English literature

Walter Reuther

Walter Reuther

Our national passion

Our national passion

Project @arl

Project @arl

Houghton Mifflin Student Resource Book

Houghton Mifflin Student Resource Book

Indicators of the well-being of Mississippi children

Indicators of the well-being of Mississippi children

Ancient Mediterranean

Ancient Mediterranean

Wharfedale: picture guide

Wharfedale: picture guide

India of Rajahs

India of Rajahs

Astronomy

Astronomy

Symbolic context-sensitive pointer analysis. by Silvian Calman Download PDF EPUB FB2

Context sensitive symbolic pointer analysis Article in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 24(4) - May with 19 Reads How we measure 'reads'. Context Sensitive Symbolic context-sensitive pointer analysis.

book Pointer Analysis Jianwen Zhu, Member, IEEE, and Silvian Calman, Student Member, IEEE Abstract—One Symbolic context-sensitive pointer analysis. book the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile Symbolic context-sensitive pointer analysis.

book. The. Pointer Analysis Flow- Context- Sensitive Pointer AnalysisLevel by Level: Flow- and Context- Sensitive Analysis(Levpa) Recursion Problem in Flow- Context- Sensitive Analysis Future Work on Levpa Flow- Context- Sensitive Pointer Analysis Yulei Sui Supervisor: File Size: KB.

Semi-Sparse Flow-Sensitive Pointer Analysis Ben Hardekopf Calvin Lin The University of Texas at Austin {benh,lin}@ Abstract Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive.

Two major axes of pointer. for context-sensitive analysis. My first attempts were unsuccessful, but I persevered because I believed it could be made to work. And after many months of slow and methodical progress, I finally had a fully context-sensitive inclusion-based pointer analysis that could analyze very Symbolic context-sensitive pointer analysis.

book Java programs on the order Symbolic context-sensitive pointer analysis. book tens of minutes. Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers Maryam Emami Rakesh Ghiya Laurie J.

Hendren School of Computer Science McGill University, Montreal, Quebec Canada H3A 2A7 {emami,ghiya,hendren}@ ca. In addition, Zhu [51] uses BDDs Symbolic context-sensitive pointer analysis.

book compute a flow-and context-sensitive pointer analysis for C programs. The analysis is fully symbolic (everything from the CFG to the pointer information is Author: Jianwen Zhu. context-sensitive pointer analysis for Java. The main novelty of our tech-nique is the constraint-based handling of virtual method calls and instan-tiation of method summaries.

Since our approach generates polymorphic method summaries, it can be context-sensitive without reanalyzing the same method multiple times. We have implemented this Cited by: 6. Abstract.

This paper presents a modular algorithm Symbolic context-sensitive pointer analysis. book efficiently computes parameterized pointer information, in which symbolic names are introduced to identify memory locations whose addresses may be passed into a procedure. Parameterized pointer information can be used by a client program analysis to compute parameterized summary information for a by: Efficient Context-Sensitive Pointer Analysis Robert P.

Wilson and Monica S. Lam Computer Systems Laboratory Stanford University, CA http: //suif. Stanford. edu for C Programs {bwilson, lam}@cs. Stanford.

edu Abstract This paper proposes an efficient technique for con~ext-sensitive pointer analysis that is applicable Symbolic context-sensitive pointer analysis. book real C pro-grams. Abstract. This paper describes a new bottom-up, subset-based, and context-sensitive pointer analysis for Java.

The main novelty of our technique is the constraint-based handling of virtual method calls and instantiation of method by: 6.

Pointer analysis is a crucial problem for C-based synthesis Contribution Boolean algebra as new Formalism for pointer analysis Efficient algorithms for fundamental symbolic pointer evaluation Validation of new concept Future work A scientific, comparative study of algorithm efficiency and scalability Towards better precision Towards faster speed.

This paper proposes an efficient technique for context-sensitive pointer analysis that is applicable to real C programs. For efficiency, we summarize the effects of procedures using partial transfer functions. A partial transfer function (PTF) describes the behavior of a procedure assuming that certain alias relationships hold when it is called.

J Cloning-Based Context-Sensitive Pointer Alias Analysis using BDDs 34 Context-sensitive pointer analysis • Compute call graph with context-insensitive pointer analysis. –Datalog rules for: •assignments, loads, stores •discover call targets, bind parameters •type. •!Understand how automated program analysis complements testing and manual inspection –!Most useful for properties that are difficult to test •!Understand fundamental approaches of a few representative techniques –!Lockset analysis, pointer analysis, symbolic testing, dynamic model extraction: A sample of.

A Context-Sensitive Pointer Analysis Phase in Open64 Compiler Tianwei Sheng, Wenguang Chen, Weimin Zheng Department of Computer Science and Technology Tsinghua University, China @, fcwg, [email protected] Abstract The precision of the pointer analysis plays an important role in compiler and other software.

A context-sensitive analyzer analyses f() (at least) twice in this program, because it is called from from call sites.

This makes it precise, as the effects of f() are quite different each time. A context-sensitive analysis can infer that a==1 and b is unchanged after the first call, and that both a and b. Book Covers 〈Principles of Compiler Design〉 (Addison-Wesley series in computer science and information processing) 2nd Edition, Buy at amazon 〈Compilers: Principles, Techniques, and Tools〉 First edition, Buy at amazon 〈Compilers: Principles, Techniques, and Tools〉 Second edition, by Alfred V.

Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman. cations on Sourceforge. Our context-sensitive pointer analysis can analyze even the largest of the programs in under 19 minutes. We also compare the precision of context-insensitive pointer analysis, context-sensitive pointer analysis and context-sensitive type analy-sis, and show the effects of merging versus cloning contexts.

Paper. static identification of operators manipulating the stack pointer. Thus, to develop a context-sensitive analysis using our framework one needs to know only how the stack is implemented. The main contributions of this paper are summarized below. – It introduces the problem of context-sensitive analysis of programs with non-atomic.

2 Context-Sensitive Relevancy Analysis Interprocedural Program Analysis by Weighted Pushdown Model Checking Definition 1. A pushdown system P =(Q,Γ,Δ,q 0,w 0) is a pushdown au-tomaton regardless of input, where Q is a finite set of states called control loca-tions, and Γ is a finiteset of stack alphabet, and Δ ⊆ Q×Γ×Q×Γ∗ is.

Pointer analysis is one of the key static analyses during compilation. The efficiency of several compiler optimizations and transformations depends directly on the scalability and precision of the underlying pointer analysis.

Recent advances still lack an efficient. Context-sensitive definition: behaving, responding, or interpreted differently depending on context | Meaning, pronunciation, translations and examples. Refers to a program feature that changes depending on what you are doing in the program.

For example, context-sensitive help provides documentation for the particular feature that you are in.

Compilers: Principles, Techniques and Tools, known to professors, students, and developers worldwide as the "Dragon Book," is available in a new edition. Every chapter has been completely revised to reflect developments in software engineering, programming languages, and computer architecture that have occurred sincewhen the last edition published.

efficient algorithm for computing context-sensitive results for a wide variety of context configurations. CCS Concepts •Theory of computation → Program analysis Keywords Pointeranalysis,context-sensitiveanalysis,static analysis 1. Introduction Pointer analysis is a fundamental static analysis that deter-mines the objects that pointers may File Size: KB.

• I think symbolic execution can be used in many other interesting ways • Next: Symbolic execution as Empirical studies tool Web application security checker Enhancement to abstraction-based static analysis Program synthesis tool • All of these take advantage of sym exec strengths, and try to avoid drawbacks 7File Size: KB.

Compilers: Principles, Techniques and Tools, known to professors, students, and developers worldwide as the "Dragon Book," is available in a new edition. Every chapter has been completely revised to reflect developments in software engineering, programming languages, and computer architecture that have occurred sincewhen the last edition Availability: Live.

In a similar paper, Livshits and Lam demonstrated how a context-sensitive pointer alias analysis together with string analysis can be realized for Java-based web applications [55]. Xie and Aiken introduced a static analysis algorithm based on so-called block and function summaries to detect vulnerabilities in PHP applications [ ].

A context-sensitive user interface is one which can automatically choose from a multiplicity of options based on the current or previous state(s) of the program operation. Context sensitivity is almost ubiquitous in current graphical user interfaces, usually in the form of context t sensitivity, when operating correctly, should be practically transparent to the user.

context-sensitive framework that supports several context abstractions (call site strings, object sensitivity and different algorithms implementations). Points-To SSA is context-sensitive analysis that supports few context abstractions as well.

It uses Static Single Assignment form for program representation. Completeness Refinement in Abstract Symbolic Trajectory Evaluation. Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer Analysis. Pages Static Analysis Book Subtitle 11th International Symposium, SASVerona, Italy, August, Proceedings.

Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks Hao Tang 1Xiaoyin Wang2 Lingming Zhang3 Bing Xie1 Lu Zhang1 Hong Mei 1Key Laboratory of High Confidence Software Technologies, Ministry of Education, Peking University, Beijing,China 2Department of Computer Science, University of Texas at San Antonio, TXUSA 3Department of Computer.

Abstract. Symbolic execution is a flexible and powerful, but computa-tionally expensive technique to detect dynamic behaviors of a program.

In this paper, we present a context-sensitive relevancy analysis algorithm based on weighted pushdown model checking, which pinpoints memory locations in the program where symbolic values can flow into.

Content Sensitive Analysis → Motivation → Attribute grammars Attributes Evaluation order → Ad hoc Syntax-directed translation. 2 CS 3 Context-Sensitive Analysis: Beyond Syntax There is a level of correctness that is deeper than grammar To generate code, we need to understand its meaning.

L7: Pointer Analysis. Pointer Analysis, Foundations and Trends in Programming Languages, Recent survey of pointer analysis. L8: Inter-Procedural Analysis. Undecidability of Context-Sensitive Data-Dependence Analysis, ACM TOPLAS, Proof of undecidability of tracking calls/returns and reads/writes simultaneously.

L Type Systems. A context-sensitive (Type-1) grammar allows multiple symbols of context on the left hand side of a production, but the same context must appear on the right hand side of the production (hence the name "context-sensitive").

[1] Context-sensitive grammars are equivalent to linear-bounded Turing machines. Precise interprocedural analysis is crucial for defect detection faced with the problem of procedure call. Procedure summary is an effective and classical technique to handle this problem.

However, there is no general recipe to construct and instantiate procedure summaries with context-sensitivity. This paper addresses the above challenge by introducing a unified symbolic procedure summary. Site Analysis: Informing Context-Sensitive and Sustainable Site Planning and Design - Kindle edition by LaGro, James A.

Download it once and read it on your Kindle device, PC, phones or tablets. Use features like bookmarks, note taking and highlighting while reading Site Analysis: Informing Context-Sensitive and Sustainable Site Planning and Design/5(6).

Context-sensitive is an adjective meaning "depending on context" or "depending on circumstances". It may refer to: Context-sensitive meaning, where meaning depends on context (language use). Context-sensitive grammar, a formal grammar in which the left-hand sides and right-hand sides of any production rules may be surrounded by a context of terminal and nonterminal symbols.

The complement of a context-sensitive language pdf itself context-sensitive a result known as the Immerman–Szelepcsényi theorem. Membership of a string in a language defined by an arbitrary context-sensitive grammar, or by an arbitrary deterministic context-sensitive grammar, is a .Experimental results show that context-sensitive, flow-insensitive analysis on programs with billions of different calling paths can be performed, and benchmarks as large as GCC (KLOC) can be completed in seconds.

The subject of this talk can be of interest to researchers in CAD, compiler, software engineering and security. Biography.This book constitutes ebook refereed proceedings of the 26th International Symposium on Static Analysis, SASheld in Porto, Portugal, in October The 20 regular papers presented in this book were carefully reviewed and selected from 50 submissions.