Pointer-induced aliasing: a problem taxonomy

Landi, William; Ryder, Barbara G.

doi:10.1145/99583.99599

Cited by 158 publications

(138 citation statements)

References 14 publications

Supporting

Mentioning

135

Contrasting

Order By: Relevance

“…Our lower bound results follow the tradition set by earlier complexity results due to Landi and Ryder [17] and Muth and Debray [18].…”

Section: Related Worksupporting

confidence: 85%

Typestate Verification: Abstraction Techniques and Complexity Results

Field¹,

Goyal²,

Ramalingam³

et al. 2003

Static Analysis

View full text Add to dashboard Cite

Abstract. We consider the problem of typestate verification for shallow programs; i.e., programs where pointers from program variables to heap-allocated objects are allowed, but where heap-allocated objects may not themselves contain pointers. We prove a number of results relating the complexity of verification to the nature of the finite state machine used to specify the property. Some properties are shown to be intractable, but others which appear to be quite similar admit polynomial-time verification algorithms. While there has been much progress on many aspects of automated program verification, we are not aware of any previous work relating the difficulty of typestate verification to properties of the finite state automaton. Our results serve to provide insight into the inherent complexity of important classes of verification problems. In addition, the program abstractions used for the polynomial-time verification algorithms may be of independent interest.

show abstract

“…Our lower bound results follow the tradition set by earlier complexity results due to Landi and Ryder [17] and Muth and Debray [18].…”

Section: Related Worksupporting

confidence: 85%

Typestate Verification: Abstraction Techniques and Complexity Results

Field¹,

Goyal²,

Ramalingam³

et al. 2003

Static Analysis

View full text Add to dashboard Cite

show abstract

“…For example, imprecise points-to sets can be computed in near linear time, while the computation of flow-and context-sensitive points-to sets is NP-hard [72].…”

Section: Anatomy Of a Source Code Analysismentioning

confidence: 99%

“…The remainder of this section considers points-to analysis as a representative example of a source-code analysis [72,23,116,100]. Points-to analysis was chosen as it is a challenging problem that is an essential precursor to many other source-code analyses.…”

Section: Anatomy Of a Source Code Analysismentioning

confidence: 99%

Source Code Analysis: A Road Map

Binkley

2007

Future of Software Engineering (FOSE '07)

141

View full text Add to dashboard Cite

“…A rich suite of approaches aiming at providing a satisfactory balance between scalability and precision has already been developed in this regard. Examples include: (i) intraprocedural frameworks [16,15] that handle isolated functions only, and their inter-procedural counterparts [15,22,11] that consider the interactions between function calls; (ii) type-based techniques [8]; (iii) flow-based techniques [4,6] that establish aliases depending on the control-flow information of a procedure; (iv) context-(in)sensitive approaches [9,29] that depend on whether the calling context of a function is taken into account or not; (v) field-(in)sensitive approaches [20,1] that depend on whether the individual fields of objects in a program are traced or not. More details on such classifications can be found in [25], for instance.…”

Section: Introductionmentioning

confidence: 99%

Expression-Based Aliasing for OO–languages

Caltais

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. Alias analysis has been an interesting research topic in verification and optimization of programs. The undecidability of determining whether two expressions in a program may reference to the same object is the main source of the challenges raised in alias analysis. In this paper we propose an extension of a previously introduced alias calculus based on program expressions, to the setting of unbounded program executions such as infinite loops and recursive calls. Moreover, we devise a corresponding executable specification in the K-framework. An important property of our extension is that, in a non-concurrent setting, the corresponding alias expressions can be over-approximated in terms of a notion of regular expressions. This further enables us to show that the associated K-machinery implements an algorithm that always stops and provides a sound over-approximation of the "may aliasing" information, where soundness stands for the lack of false negatives. As a case study, we analyze the integration and further applications of the alias calculus in SCOOP. The latter is an object-oriented programming model for concurrency, recently formalized in Maude; K definitions can be compiled into Maude for execution.

show abstract

Pointer-induced aliasing: a problem taxonomy

Cited by 158 publications

References 14 publications

Typestate Verification: Abstraction Techniques and Complexity Results

Typestate Verification: Abstraction Techniques and Complexity Results

Source Code Analysis: A Road Map

Expression-Based Aliasing for OO–languages

Contact Info

Product

Resources

About