Sciweavers

7796 search results - page 1284 / 1560
» On Generalized Schur Numbers
Sort
View
ICFP
2009
ACM
15 years 11 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
PLDI
2009
ACM
15 years 11 months ago
Efficiently and precisely locating memory leaks and bloat
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
POPL
2009
ACM
15 years 11 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
197
Voted
POPL
2009
ACM
15 years 11 months ago
State-dependent representation independence
Mitchell's notion of representation independence is a particularly useful application of Reynolds' relational parametricity -- two different implementations of an abstra...
Amal Ahmed, Derek Dreyer, Andreas Rossberg
72
Voted
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
15 years 11 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
« Prev « First page 1284 / 1560 Last » Next »