Sciweavers

4722 search results - page 527 / 945
» Representation-independent program analysis
Sort
View
ECOOP
2004
Springer
16 years 4 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
PEPM
2009
ACM
15 years 11 months ago
Clone detection and removal for Erlang/OTP within a refactoring environment
A well-known bad code smell in refactoring and software maintenance is duplicated code, or code clones. A code clone is a code fragment that is identical or similar to another. Un...
Huiqing Li, Simon Thompson
WCRE
2000
IEEE
15 years 11 months ago
Exploring Legacy Systems using Types
We show how hypertext-based program understanding tools eve new levels of abstraction by using inferred type information for cases where the subject software system is written in ...
Arie van Deursen, Leon Moonen
POS
1998
Springer
15 years 11 months ago
Optimizing the Read and Write Barriers for Orthogonal Persistence
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
Antony L. Hosking, Nathaniel Nystrom, Quintin I. C...
ICS
1997
Tsinghua U.
15 years 11 months ago
Iteration Space Slicing and Its Application to Communication Optimization
Program slicing is an analysis that answers questions such as \Which statements might a ect the computation of variable v at statement s?" or \Which statements depend on the ...
William Pugh, Evan Rosser