Relevant context inference

Chatterjee, Ramkrishna; Ryder, Barbara G.; Landi, William

doi:10.1145/292540.292554

Cited by 171 publications

(169 citation statements)

References 26 publications

Supporting

Mentioning

168

Contrasting

Unclassified

Order By: Relevance

“…Because the receiver could have been created anywhere in the program, a sound algorithm must either analyze the whole program [1,6,17,21,34], or make very conservative assumptions about the receiver type (e.g., Class Hierarchy Analysis [9]). Additionally, due to the large sizes of common libraries, whole-program analysis of even trivial programs is expensive [7,27,28]. Practical programs generally have many library dependencies, and in many cases, the whole program may not even be available for static analysis.…”

Section: Introductionmentioning

confidence: 99%

Application-Only Call Graph Construction

Ali

Lhoták

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Since call graphs are an essential starting point for all interprocedural analyses, many tools and frameworks have been developed to generate the call graph of a given program. The majority of these tools focus on generating the call graph of the whole program (i.e., both the application and the libraries that the application depends on). A popular compromise to the excessive cost of building a call graph for the whole program is to ignore all the effects of the library code and any calls the library makes back into the application. This results in potential unsoundness in the generated call graph and therefore in any analysis that uses it. In this paper, we present Cgc, a tool that generates a sound call graph for the application part of a program without analyzing the code of the library.

show abstract

Section: Introductionmentioning

confidence: 99%

Application-Only Call Graph Construction

Ali

Lhoták

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…However, we share with those analyses the concern of a precision adapted to the "client analysis" needs (eg. [5] and [12]). In our approach, the pointer analysis is merged with the logico-numerical analysis, which enhances the precision of both analyses.…”

Section: Related Workmentioning

confidence: 99%

Precise Interprocedural Analysis in the Presence of Pointers to the Stack

Sotin

Jeannet

2011

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. In a language with procedures calls and pointers as parameters, an instruction can modify memory locations anywhere in the call-stack. The presence of such side effects breaks most generic interprocedural analysis methods, which assume that only the top of the stack may be modified. We present a method that addresses this issue, based on the definition of an equivalent local semantics in which writing through pointers has a local effect on the stack. Our second contribution in this context is an adequate representation of summary functions that models the effect of a procedure, not only on the values of its scalar and pointer variables, but also on the values contained in pointed memory locations. Our implementation in the interprocedural analyser PInterproc results in a verification tool that infers relational properties on the value of Boolean, numerical and pointer variables.

show abstract

“…If so, we update e 1 and e 2 to the next two events of E to continue the concretization process (lines [34][35]. In case e 2 is the last event of E, the concretization of E has been accomplished on the executed path PP.…”

Section: Scenario 1 -The Target Event E 2 Is Discovered (Line 20) Thmentioning

confidence: 99%