Search Sciweavers | Sciweavers

21

DLS
2010

204views Languages» more DLS 2010»

Alias analysis for optimization of dynamic languages

13 years 3 months ago

Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...

Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...

claim paper

Read More »

17

click to vote

FM
2009
Springer

104views Formal Methods» more FM 2009»

A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis

14 years 10 days ago

Download www2.in.tum.de

Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and aﬃne equalities which enables us t...

Helmut Seidl, Vesal Vojdani, Varmo Vene

claim paper

Read More »

16

click to vote

TAPSOFT
1997
Springer

133views Software Engineering» more TAPSOFT 1997»

On the Complexity of Function Pointer May-Alias Analysis

13 years 10 months ago

Download www.cs.arizona.edu

This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...

Robert Muth, Saumya K. Debray

claim paper

Read More »

13

click to vote

PLDI
2006
ACM

134views Programming Languages» more PLDI 2006»

SAFECode: enforcing alias analysis for weakly typed languages

13 years 11 months ago

Download llvm.cs.uiuc.edu

Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...

Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve

claim paper

Read More »

8

click to vote

TOPLAS
2008

67views more TOPLAS 2008»

On the complexity of partially-flow-sensitive alias analysis

13 years 5 months ago