Sciweavers

319 search results - page 12 / 64
» Precise Dynamic Slicing Algorithms
Sort
View
LICS
2009
IEEE
14 years 2 months ago
Clipping: A Semantics-Directed Syntactic Approximation
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
Dan R. Ghica, Adam Bakewell
ECOOP
2004
Springer
14 years 23 days ago
Demand-Driven Type Inference with Subgoal Pruning: Trading Precision for Scalability
After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, th...
S. Alexander Spoon, Olin Shivers
PLDI
2012
ACM
11 years 9 months ago
Fast and precise hybrid type inference for JavaScript
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
Brian Hackett, Shu-yu Guo
ICSE
2009
IEEE-ACM
14 years 8 months ago
Modular string-sensitive permission analysis with demand-driven precision
In modern software systems, programs are obtained by dynamically assembling components. This has made it necessary to subject component providers to access-control restrictions. W...
Emmanuel Geay, Marco Pistoia, Takaaki Tateishi, Ba...
PLDI
2009
ACM
14 years 8 months ago
Efficiently and precisely locating memory leaks and bloat
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
Gene Novark, Emery D. Berger, Benjamin G. Zorn