Sciweavers

4719 search results - page 534 / 944
» Newtonian program analysis
Sort
View
PLDI
2006
ACM
16 years 25 days ago
A framework for unrestricted whole-program optimization
Procedures have long been the basic units of compilation in conventional optimization frameworks. However, procedures are typically formed to serve software engineering rather tha...
Spyridon Triantafyllis, Matthew J. Bridges, Easwar...
ISSTA
2004
ACM
16 years 9 days ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
PLDI
2004
ACM
16 years 9 days ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
OOPSLA
2004
Springer
16 years 7 days ago
Transparent proxies for java futures
A proxy object is a surrogate or placeholder that controls access to another target object. Proxies can be used to support distributed programming, lazy or parallel evaluation, ac...
Polyvios Pratikakis, Jaime Spacco, Michael W. Hick...
ICSE
2010
IEEE-ACM
15 years 11 months ago
From behaviour preservation to behaviour modification: constraint-based mutant generation
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...
Friedrich Steimann, Andreas Thies