797 search results - page 47 / 160 » Eliminating Proofs from Programs |
116
click to vote
ICFP
2005
ACM
16 years 20 days ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
112
Voted
AAAI
2007
15 years 3 months ago
2007
A mathematical programming formulation is proposed to eliminate irrelevant and redundant features for collaborative computer aided diagnosis which requires to detect multiple clin...
172
click to vote
PLPV
2011
ACM
14 years 3 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
113
click to vote
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
92
Voted
PRL
2006
15 years 19 days ago
2006
To recover depth from images, the human visual system uses many monocular depth cues, which vision research has only begun to explore. Because a given image can have many possible...