797 search results - page 94 / 160 » Eliminating Proofs from Programs |
157
click to vote
ISCA
2007
IEEE
16 years 12 days ago
2007
IEEE
Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, prog...
257
Voted
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
166
click to vote
CIE
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
176
click to vote
ECOOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Component software means reuse and separate marketing of pre-manufactured binary components. This requires components from different vendors to be composed very late, pos...
190
click to vote
ESOP
2006
Springer
15 years 9 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...