Sciweavers

7661 search results - page 1294 / 1533
» Languages and the Computing Profession
Sort
View
ICTAC
2004
Springer
16 years 19 days ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
IWMM
2004
Springer
98views Hardware» more  IWMM 2004»
16 years 19 days ago
Dynamic object sampling for pretenuring
Many state-of-the-art garbage collectors are generational, collecting the young nursery objects more frequently than old objects. These collectors perform well because young objec...
Maria Jump, Stephen M. Blackburn, Kathryn S. McKin...
ACMICEC
2003
ACM
118views ECommerce» more  ACMICEC 2003»
16 years 16 days ago
Visualization of EDI messages: facing the problems in the use of XML
Multi-organizational EDI message networks are complicated communication environments with various standards and technologies. The role of third party message exchange hubs has bec...
Reija Korhonen, Airi Salminen
PLDI
2003
ACM
16 years 16 days ago
Bug isolation via remote program sampling
We propose a low-overhead sampling infrastructure for gathering information from the executions experienced by a program’s user community. Several example applications illustrat...
Ben Liblit, Alexander Aiken, Alice X. Zheng, Micha...
PLDI
2003
ACM
16 years 16 days ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
« Prev « First page 1294 / 1533 Last » Next »