22018 search results - page 4031 / 4404 » or 2004 |
192
click to vote
ICSE
2004
IEEE-ACM
16 years 7 months ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
190
click to vote
ICSE
2004
IEEE-ACM
16 years 7 months ago
2004
IEEE-ACM
One of the main objectives of developing component-based software systems is to enable efficient building of systems through the integration of components. All component models def...
187
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Among slide-presentation systems, the dominant application offers lly no abstraction capability. Slideshow, an extension of PLT Scheme, represents our effort over the last several...
163
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
214
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...