4725 search results - page 515 / 945 » Dependence-Based Program Analysis |
175
click to vote
ICLP
2005
Springer
16 years 11 days ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
173
click to vote
ECOOP
2004
Springer
16 years 7 days ago
2004
Springer
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...
200
click to vote
PEPM
2009
ACM
15 years 11 months ago
2009
ACM
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...
163
click to vote
WCRE
2000
IEEE
15 years 11 months ago
2000
IEEE
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 ...
181
click to vote
POS
1998
Springer
15 years 11 months ago
1998
Springer
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 ...