797 search results - page 57 / 160 » Eliminating Proofs from Programs |
128
Voted
FM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...
115
click to vote
SI3D
2006
ACM
15 years 6 months ago
2006
ACM
We present an effective method for automatically selecting the appropriate scale of shape features that are depicted when rendering a 3D mesh in the style of a line drawing. The m...
106
click to vote
POPL
2010
ACM
15 years 27 days ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
104
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
111
click to vote
PLDI
2003
ACM
15 years 6 months ago
2003
ACM
Speculative execution, such as control speculation and data speculation, is an effective way to improve program performance. Using edge/path profile information or simple heuristi...