Sciweavers

114 search results - page 8 / 23
» Dynamic Dependency Analysis of Ordinary Programs
Sort
View
ASWEC
2005
IEEE
14 years 1 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...
IWPC
2007
IEEE
14 years 1 months ago
Tracking Objects to Detect Feature Dependencies
The domain-specific ontology of a software system includes a set of features and their relationships. While the problem of locating features in object-oriented programs has been ...
Adrian Lienhard, Orla Greevy, Oscar Nierstrasz
ECOOP
2000
Springer
13 years 12 months ago
Optimizing Java Programs in the Presence of Exceptions
The support for precise exceptions in Java, combined with frequent checks for runtime exceptions, leads to severe limitations on the compiler’s ability to perform program optimiz...
Manish Gupta, Jong-Deok Choi, Michael Hind
JSS
2006
85views more  JSS 2006»
13 years 7 months ago
Effects of context on program slicing
Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in comp...
Jens Krinke
EUROSYS
2007
ACM
14 years 4 months ago
Sealing OS processes to improve dependability and safety
In most modern operating systems, a process is a -protected abstraction for isolating code and data. This protection, however, is selective. Many common mechanisms—dynamic code ...
Galen C. Hunt, Mark Aiken, Manuel Fähndrich, ...