797 search results - page 123 / 160 » Eliminating Proofs from Programs |
AOSD
2009
ACM
14 years 4 months ago
2009
ACM
Many aspects for runtime monitoring are history-based: they contain pieces of advice that execute conditionally, based on the observed execution history. History-based aspects are...
ISCA
2008
IEEE
14 years 4 months ago
2008
IEEE
Writing shared-memory parallel programs is error-prone. Among the concurrency errors that programmers often face are atomicity violations, which are especially challenging. They h...
IFIP
2004
Springer
14 years 3 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
COCO
1994
Springer
14 years 2 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
CGO
2005
IEEE
14 years 3 months ago
2005
IEEE
Data speculative optimization refers to code transformations that allow load and store instructions to be moved across potentially dependent memory operations. Existing research w...