EAPLS Best Paper Awards
ETAPS best paper awards
- 2010
- Jyotirmoy Deshmukh, Ganesan Ramalingam, Venkatesh Prasad Ranganath and Kapil Vaswani: Logical Concurrency Control From Sequential Proofs (ESOP2010)
- 2009
- Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko: From Tests to Proofs, pp 262-276 of Lecture Notes in Computer Science 5505 (TACAS 2009)
- 2008
- Junghee Lim, Thomas W. Reps: A System for Generating Static Analyzers for Machine Instructions, pp 36-52 of LNCS 4959
- 2007
- Daniel Grund and Sebastian Hack: A Fast Cutting-Plane Algorithm for Optimal Coalescing, CC 2007, LNCS 4420, Springer Verlag, 111-115.
- 2006
- B. Rudiak-Gould, A. Mycroft, S. Peyton Jones: Haskell is Not Not ML, ESOP 2006, LNCS 3924, Springer Verlag, 38-53.
- 2005
- J. Condit and G.C. Necula: Data Slicing: Separating the Heap into Independent Regions, CC 2005, LNCS 3443, Springer Verlag,172-187.
- 2004
- G. Balakrishnan, T.W. Reps: Analyzing Memory Accesses in x86 Executables, CC 2004, LNCS 2985, Springer Verlag, 5-23.
- 2003
- P. Laud: Handling Encryption in an Analysis for Secure Information Flow, ESOP 2003, LNCS 2618, Springer Verlag, 159-173.
- 2002
- M. Kandemir, I. Kolcu, I Kadayif: Influence of Loop Optimizations on Energy Consumption of Multi-Bank Memory Systems, CC 2002, LNCS 2304, Springer Verlag, 276-292.
- 2001
- Masahito Hasegawa, Yoshihiko Kakutani: Axioms for Recursion in Call-by-Value, FoSSaCS 2001, LNCS 2030, Springer Verlag, 246-260.
- 2000
- P.A. Abdulla, P. Bjesse, N. Eén: Symbolic Reachability Analysis Based on SAT-Solvers, TACAS 2000, LNCS 1785, Springer Verlag, 411-425.
- 1999 (2 winners)
-
G. Delzanno, A. Podelski:
Model Checking in CLP,
TACAS 1999, LNCS 1579, Springer Verlag,223-239.
M. Norrish: Deterministic Expressions in C, ESOP 1999, LNCS 1576, Springer Verlag, 147-161.
- 1998
- A. Aiken, M. Fähndrich, Z. Su: Detecting Races in Relay Ladder Logic Programs, TACAS 1998, LNCS 1384, Springer Verlag, 184-200.
- 2000
- S.L. Peyton Jones, J.-M. Eber, J. Seward: Composing contracts: an adventure in financial engineering, functional pearl. ICFP 2000, 280-292.
- 1999
- S. Zdancewic, D. Grossman, J.G. Morrisett: Principals in Programming Languages: A Syntactic Proof Technique, ICFP 1999, 197-207.
- 1998
- P.-E. Moreau, H. Kirchner: A Compiler for Rewrite Programs in Associative-Commutative Theories, ALP 1998, LNCS 1490, Springer Verlag, 230-249.
