Sciweavers

128 search results - page 2 / 26
» Fast Interprocedural Class Analysis
Sort
View
CC
2006
Springer
108views System Software» more  CC 2006»
15 years 1 months ago
Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
Teck Bok Tok, Samuel Z. Guyer, Calvin Lin
CC
2010
Springer
150views System Software» more  CC 2010»
15 years 4 months ago
Practical Extensions to the IFDS Algorithm
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
Nomair A. Naeem, Ondrej Lhoták, Jonathan Ro...
CC
2000
Springer
135views System Software» more  CC 2000»
15 years 2 months ago
Fast Escape Analysis and Stack Allocation for Object-Based Programs
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the life...
David Gay, Bjarne Steensgaard
SCAM
2005
IEEE
15 years 3 months ago
A Fast Analysis for Thread-Local Garbage Collection with Dynamic Class Loading
Long-running, heavily multi-threaded, Java server applications make stringent demands of garbage collector (GC) performance. Synchronisation of all application threads before garb...
Richard E. Jones, Andy C. King
FSTTCS
2007
Springer
15 years 4 months ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd