Sciweavers

319 search results - page 9 / 64
» Precise Dynamic Slicing Algorithms
Sort
View
SIGSOFT
1994
ACM
13 years 11 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
TSP
2008
69views more  TSP 2008»
13 years 7 months ago
Nonminimum Phase Identification Based on Higher Order Spectrum Slices
A new family of methods, named phase estimation using polyspectrum slices (PEP), for the reconstruction of the Fourier phase of a complex linear time invariant (LTI) system excited...
Amar Kachenoura, Laurent Albera, Jean-Jacques Bell...
PLDI
2012
ACM
11 years 9 months ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
ASAP
2000
IEEE
121views Hardware» more  ASAP 2000»
13 years 11 months ago
A Hardware Algorithm for Variable-Precision Logarithm
This paper presents an e cient hardware algorithm for variable-precision logarithm. The algorithm uses an iterative te chnique that employs table lookups and polynomial approximat...
Javier Hormigo, Julio Villalba, Michael J. Schulte
ICSE
2003
IEEE-ACM
14 years 7 months ago
Whole Program Path-Based Dynamic Impact Analysis
Impact analysis, determining when a change in one part of a program affects other parts of the program, is timeconsuming and problematic. Impact analysis is rarely used to predict...
James Law, Gregg Rothermel