85 search results - page 13 / 17 » Speculation for Parallelizing Runtime Checks |
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
IEEEPACT
2002
IEEE
14 years 6 days ago
2002
IEEE
This paper describes a technique for utilizing predication to support software pipelining on EPIC architectures in the presence of dynamic memory aliasing. The essential idea is t...
ECOOPW
1999
Springer
13 years 11 months ago
1999
Springer
This paper formalizes the folklore result that strongly-typed applets are more secure than untyped ones. We formulate and prove several security properties that all well-typed app...
CF
2004
ACM
14 years 22 days ago
2004
ACM
Although many defense mechanisms against buffer overflow attacks have been proposed, buffer overflow vulnerability in software is still one of the most prevalent vulnerabilities e...
DAGSTUHL
1990
13 years 8 months ago
1990
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...