EAPLS Best Paper Awards
ETAPS Best Paper Awards
- 2024
- Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann, Tobias Winkler: Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains (TACAS '24)
- 2023
- Daniel Lundén, Gizem Çaylak, Fredrik Ronquist, David Broman: Automatic Alignment in Higher-Order Probabilistic Programming Languages (ESOP '23) 2022
- David Dill, Wolfgang Grieskamp, Junkil Park, Shaz Qadeer, Meng Xu, Emma Zhong: Fast and Reliable Formal Verification of Smart Contracts with the Move Prover (TACAS '22)
- 2021
- Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche: General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond (TACAS '21)
- 2020
- Raffi Khatchadourian, Yiming Tang, Mehdi Bagherzadeh, Baishakhi Ray: An Empirical Study on the Use and Misuse of Java 8 Streams (FASE '20)
- Dylan McDermott, Alan Mycroft: Extended call-by-push-value: reasoning about effectful programs and evaluation order (ESOP '19)
- 2018
- Ilya Grishchenko, Matteo Maffei, and Clara Schneidewind: A Semantic Framework for the Security Analysis of Ethereum smart contracts (POST '18)
- 2017
- Ryan Culpepper, and Andrew Cobb: Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring (ESOP '17)
- 2016
- Daniel Huang, and Greg Morrisett: An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages (ESOP '16)
- 2015
- Pierre Neron, Andrew Tolmach, Eelco Visser, and Guido Wachsmuth: A Theory of Name Resolution (ESOP'15)
- 2014
- Justin Slepak, Olin Shivers, and Panagiotis Manolios: An array-oriented language with static rank polymorphism (ESOP'14)
- 2013
- Sooraj Bhat, Johannes Borgström. Andrew D. Gordon, and Claudio Russo: Deriving Probability Density Functionsfrom Probabilistic Functional Programs (TACAS'13)
- 2012
- Zhenyue Long, Georgei Calin, Rupak Majumdar and Roland Meyer: Language-Theoretic Abstraction Refinement (FASE'12)
- 2011
- Dominik Grewe and Michael O'Boyle: A Static Task Partitioning Approach for Heterogeneous Systems Using OpenCL (CC'11)
- 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.
2019
ECMFA Best Paper Award
2013
- Lars Patzina, Sven Patzina, Thorsten Piper, and Paul Manns: Model-based Generation of Run-time Monitors for AUTOSAR (ECMFA 2012)
- 2012
- Ferruccio Damiani, Luca Padovani, and Ina Schäfer: A Formal Foundation for Dynamic Delta-Oriented Software Product Lines (GPCE 2012)
- 2012
- Erwann Wernli, Mircea Lungu and Oscar Nierstrasz: Incremental Updates with First-class Contexts (Tools2012)
- 2011
- Matthias Diehn Ingesman and Erik Ernst: Lifted Java: A Minimal Calculation for translation polymorphism (Tools2011)
GPCE/SLE Best Paper Award
TOOLS Best Paper Award
- 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.