Sciweavers

23 search results - page 2 / 5
» Symbolic pointer analysis revisited
Sort
View
PPOPP
1999
ACM
13 years 10 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
SEFM
2005
IEEE
14 years 1 days ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier
IPPS
1996
IEEE
13 years 10 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
ENTCS
2010
125views more  ENTCS 2010»
13 years 3 months ago
Concrete Memory Models for Shape Analysis
This paper discusses four store-based concrete memory models. We characterize memory models by the class of pointers they support and whether they use numerical or symbolic offset...
Pascal Sotin, Bertrand Jeannet, Xavier Rival
SPIN
2009
Springer
14 years 1 months ago
Symbolic Analysis via Semantic Reinterpretation
Abstract. The paper presents a novel technique to create implementations of the basic primitives used in symbolic program analysis: forward symbolic evaluation, weakest liberal pre...
Junghee Lim, Akash Lal, Thomas W. Reps