• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 169
Next 10 →

Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers

by Michael Burke, Paul Carini, Jong-deok Choi, Michael Hind
"... . Data-flow analysis algorithms can be classified into two categories: flow-sensitive and flow-insensitive. To improve efficiency, flowinsensitive interprocedural analyses do not make use of the intraprocedural control flow information associated with individual procedures. Since pointer-induced al ..."
Abstract - Cited by 72 (17 self) - Add to MetaCart
. Data-flow analysis algorithms can be classified into two categories: flow-sensitive and flow-insensitive. To improve efficiency, flowinsensitive interprocedural analyses do not make use of the intraprocedural control flow information associated with individual procedures. Since pointer

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

Efficient Flow-Insensitive Alias Analysis in the Presence of Pointers

by Michael Burke, Paul R. Carini, Jong-deok Choi, Michael Hind , 1994
"... Data-flow analysis computes information about the potential behavior of a program in terms of the definitions and uses of data objects. Data-flow analysis for programs written in languages such as FORTRAN has been well developed. However, due to the presence of pointers, data-flow analysis has been ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
less successful for languages such as C, C++, LISP, and Fortran 90. Data-flow analysis algorithms can be classified into two categories: flow-sensitive and flowinsensitive. To improve efficiency, flow-insensitive interprocedural analyses do not make use of the intraprocedural control flow information

Escape analysis for Java

by Jong-deok Choi, Mannish Gupta, Mauricio Serrano, Vugranam C. Sreedhar, Sam Midkiff - OOPSLA , 1999
"... This paper presents a simple and efficient data flow algorithm for escape analysis of objects in Java programs to determine (i) if an object can be allocated on the stack; (ii) if an object is accessed only by a single thread duriing its lifetime, so that synchronization operations on that object ca ..."
Abstract - Cited by 300 (12 self) - Add to MetaCart
be used effectively in different calling contexts. We present an interprocedural al-gorithm that uses the above property to efficiently compute the connection graph and identify the non-escaping objects for methods and threads. The experimental results, from a proto-type implementation of our framework

Efficient computation of parameterized pointer information for interprocedural analyses

by Donglin Liang, Mary Jean Harrold - STATIC ANALYSIS SYMPOSIUM , 2001
"... This paper presents a modular algorithm that 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 com ..."
Abstract - Cited by 10 (2 self) - Add to MetaCart
This paper presents a modular algorithm that 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

Interprocedural Compilation of Fortran D

by Mary W. Hall, Seema Hiranandani, Ken Kennedy, Chau-Wen Tseng , 1996
"... Fortran D is a version of Fortran extended with data decomposition specifications. It is designed to provide a machine-independent programming model for data-parallel applications and has heavily influenced the design of High Performance Fortran (HPF). In previous work we described Fortran D compila ..."
Abstract - Cited by 20 (2 self) - Add to MetaCart
interprocedural compilation efficient. First, we collect summary information after edits to solve important data-flow problems in a separate interprocedural propagation phase. Second, for non-recursive programs we compile procedures in reverse topological order to propagate additional interprocedural information

SUMMARY

by Samsung Lim, Chris Rizos, Samsung Lim, Chris Rizos
"... Improved accuracy and reliability of the real-time user coordinates is expected if GNSS data is processed using the network-RTK technique. Some implementations of conventional network-RTK, e.g. Virtual Reference Station (VRS) techniques, require bi-directional communications via GSM/GPRS since the n ..."
Abstract - Add to MetaCart
the network server transmits network-corrections to a user, while the user receiver is required to transmit its (approximate) coordinate information to the server. The data transmission from the user is kept to a minimum because the server needs the user’s coordinate information only for “initialization

Generating Precise and Concise Procedure Summaries

by Greta Yorsh, Eran Yahav, Satish Chandra - POPL'08 , 2008
"... We present a framework for generating procedure summaries that are precise — applying the summary in a given context yields the same result as re-analyzing the procedure in that context, and concise — the summary exploits the commonalities in the ways the procedure manipulates abstract values, and d ..."
Abstract - Cited by 15 (0 self) - Add to MetaCart
, and does not contain superfluous context information. The use of a precise and concise procedure summary in modular analyses provides a way to capture infinitely many possible contexts in a finite way; in interprocedural analyses, it provides a compact representation of an explicit input-output summary

Fast Error Correction for Large Data Sets

by Michael Mitzenmacher, George Varghese
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Faster Alias Set Analysis Using Summaries

by Nomair A. Naeem
"... Abstract. Alias sets are an increasingly used abstraction in situations which require flow-sensitive tracking of objects through different points in time and the ability to perform strong updates on individual objects. The interprocedural and flow-sensitive nature of these analyses often make them d ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
and return value information to selectively replace flow-sensitive analysis of methods without affecting analysis precision. When efficiency is a bigger concern, we also use caller method summaries which provide conservative initial assumptions for pointer and aliasing relations at the start of a method
Next 10 →
Results 1 - 10 of 169
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University