Results 1 - 10 of 135

Fast and Accurate Flow-Insensitive Points-To Analysis

by Marc Shapiro, Susan Horwitz - IN SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES , 1997
"... In order to analyze a program that involves pointers, it is necessary to have (safe) information about what each pointer points to. There are many different approaches to computing points-to information. This paper addresses techniques for flow- and context-insensitive interprocedural analysis of st ..."
Abstract - Cited by 162 (3 self) - Add to MetaCart
In order to analyze a program that involves pointers, it is necessary to have (safe) information about what each pointer points to. There are many different approaches to computing points-to information. This paper addresses techniques for flow- and context-insensitive interprocedural analysis

Speeding up dataflow analysis using flow-insensitive pointer analysis

by Stephen Adams, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle, Westley Weimer - SAS (2002), LNCS 2477 , 2002
"... Abstract. In recent years, static analysis has increasingly been applied to the problem of program verification. Systems for program verification typically use precise and expensive interprocedural dataflow algorithms that are difficult to scale to large programs. An attractive way to scale these an ..."
Abstract - Cited by 10 (3 self) - Add to MetaCart
these analyses is to use a preprocessing step to reduce the number of dataflow facts propagated by the analysis and/or the number of statements to be processed, before the dataflow analysis is run. This paper describes an approach that achieves this effect. We first run a scalable, control-flow-insensitive

Dynamic vs. static flow-sensitive security analysis

by Alejandro Russo, Andrei Sabelfeld , 2010
"... This paper seeks to answer fundamental questions about trade-offs between static and dynamic security analysis. It has been previously shown that flow-sensitive static information-flow analysis is a natural generalization of flowinsensitive static analysis, which allows accepting more secure program ..."
Abstract - Cited by 63 (14 self) - Add to MetaCart
programs. It has been also shown that sound purely dynamic information-flow enforcement is more permissive than static analysis in the flow-insensitive case. We argue that the step from flow-insensitive to flow-sensitive is fundamentally limited for purely dynamic information-flow controls. We prove

Speeding UpDa263 wAna13E Using Flow-Insensitive PointerAna361 StephenAdam

by Thomc Ball Manuvir, Stephen Adams, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle, Westley Weimer - SAS (2002), LNCS 2477 , 2002
"... In recent years, static analysis has increasingly been applied to the problemof program verification. Systemsfs program verification typically use precise and expensive interprocedural dataflow algorithms that are di#cult to scale to large programs. An attractive way to scale these analyses is to us ..."
Abstract - Add to MetaCart
is to use a preprocessing step to reduce the numberof dataflowfDV) propagated by the analysis and/or the numberof statements to be processed, bef(E the dataflow analysis is run. This paper describes an approach that achieves this e#ect. We first run a scalable, control-flow-insensitive pointer analysis

Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects

by Jong-deok Choi, Michael Burke, Paul Carini , 1993
"... We present practical approximation methods for computing interprocedural aliases and side effects for a program written in a language that includes pointers, reference parameters and recursion. We present the following results: 1) An algorithm for flow-sensitive interprocedural alias analysis which ..."
Abstract - Cited by 231 (11 self) - Add to MetaCart
is more precise and efficient than the best interprocedural method known. 2) An extension of traditional flow-insensitive alias analysis which accommodates pointers and provides a framework for a family of algorithms which trade off precision for efficiency. 3) An algorithm which correctly computes side

Unification-based Pointer Analysis with Directional Assignments

by Manuvir Das , 2000
"... This paper describes a new algorithm for flow and context insensitive pointer analysis of C programs. Our studies show that the most common use of pointers in C programs is in passing the addresses of composite objects or updateable values as arguments to procedures. Therefore, we have designed a lo ..."
Abstract - Cited by 217 (7 self) - Add to MetaCart
This paper describes a new algorithm for flow and context insensitive pointer analysis of C programs. Our studies show that the most common use of pointers in C programs is in passing the addresses of composite objects or updateable values as arguments to procedures. Therefore, we have designed a

Flow Insensitive C++ Pointers and Polymorphism

by Analysis And Its, Paolo Tonella, Giuliano Antoniol, Roberto Fiutem, Via Alla Cascata, Ettore Merlo - In 19th International Conference on Software Engineering , 1997
"... Large software systems are difficult to understand and maintain. Code analysis tools can provide programmers with different views of the software which may help their understanding activity. To be applicable to real programs written in modern programming languages, these tools need to efficiently ha ..."
Abstract - Add to MetaCart
handle pointers. In the case of C++ analysis, object oriented peculiarities (like, e.g., polymorphism) have to be accounted for as well.

A Schema for Interprocedural Modification Side-Effect Analysis With Pointer Aliasing

by Barbara G. Ryder, William A. Landi, Philip A. Stocks, Sean Zhang, Rita Altucher , 2001
"... The first interprocedural modification side-effects analysis for C (MODC) that obtains better than worst-case precision on programs with general-purpose pointer usage is presented with empirical results. The analysis consists of an algorithm schema corresponding to a family of MODC algorithms with t ..."
Abstract - Cited by 139 (12 self) - Add to MetaCart
-effect information obtained are reported. The results show surprisingly that the precision of flow-sensitive side-effect analysis is not always prohibitive in cost, and that the precision of flow-insensitive analysis is substantially better than worst-case estimates

Flow Insensitive C++ Pointers and Polymorphism Analysis and its Application to Slicing

by Paolo Tonella, Giuliano Antoniol, Roberto Fiutem, Via Alla Cascata, Ettore Merlo - In 19th International Conference on Software Engineering , 1997
"... Large software systems are difficult to understand and maintain. Code analysis tools can provide programmers with different views of the software which may help their understanding activity. To be applicable to real programs written in modern programming languages, these tools need to efficiently ha ..."
Abstract - Cited by 39 (5 self) - Add to MetaCart
handle pointers. In the case of C++ analysis, object oriented peculiarities (like, e.g., polymorphism) have to be accounted for as well. We propose a flow insensitive, context insensitive points-to analysis capable of dealing with the features of the object oriented code. It is extremely promising

Points-To Analysis with Efficient Strong Updates

by Kwok-chiang Andrew Chung
"... This paper explores a sweet spot between flow-insensitive and flowsensitive subset-based points-to analysis. Flow-insensitive analysis is efficient: it has been applied to million-line programs and even its worst-case requirements are quadratic space and cubic time. Flowsensitive analysis is precise ..."
Abstract - Cited by 18 (0 self) - Add to MetaCart
This paper explores a sweet spot between flow-insensitive and flowsensitive subset-based points-to analysis. Flow-insensitive analysis is efficient: it has been applied to million-line programs and even its worst-case requirements are quadratic space and cubic time. Flowsensitive analysis
Results 1 - 10 of 135