Sciweavers

143 search results - page 14 / 29
» Data-Flow Analysis of Program Fragments
Sort
View
JUCS
2007
80views more  JUCS 2007»
13 years 9 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa
SAS
2007
Springer
103views Formal Methods» more  SAS 2007»
14 years 3 months ago
Footprint Analysis: A Shape Analysis That Discovers Preconditions
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
SSR
2001
134views more  SSR 2001»
13 years 11 months ago
Generation of visitor components that implement program transformations
The visitor pattern is appealing to developers of program-analysis tools because it separates the design of the data structures that represent a program from the design of softwar...
Kurt Stirewalt, Laura K. Dillon
IWPC
2009
IEEE
14 years 4 months ago
Variable granularity for improving precision of impact analysis
Impact analysis is a specialized process of program comprehension that investigates the nature and extent of a planned software change. Traditionally, impact analysis inspects dep...
Maksym Petrenko, Václav Rajlich
RTAS
1996
IEEE
14 years 1 months ago
Efficient worst case timing analysis of data caching
Recent progress in worst case timing analysis of programs has made it possible to perform accurate timing analysis of pipelined execution and instruction caching, which is necessa...
Sung-Kwan Kim, Sang Lyul Min, Rhan Ha