797 search results - page 71 / 160 » Eliminating Proofs from Programs |
82
Voted
FPL
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper focuses on a class of problem relating to the multiplication of a single number by several coefficients that, while not constant, are drawn from a finite set ...
108
click to vote
ICS
2010
Tsinghua U.
15 years 3 months ago
2010
Tsinghua U.
As the number of I/O-intensive MPI programs becomes increasingly large, many efforts have been made to improve I/O performance, on both software and architecture sides. On the sof...
177
click to vote
PADL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Purely functional arrays are notoriously difficult to implement and use efficiently due to the absence of destructive updates and the resultant frequent copying. Deforest...
197
click to vote
ECOOP
2009
Springer
16 years 1 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
215
Voted
POPL
2004
ACM
16 years 29 days ago
2004
ACM
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...