Kleene Award
 | The topic of this article may not meet Wikipedia's general notability guideline. (August 2020) |
 | This article relies largely or entirely on a single source. (January 2020) |
The Kleene Award [1] is awarded at the annual IEEE Symposium on Logic in Computer Science (LICS) to the author(s) of the best student paper(s). A paper qualifies as a student paper if each author is a student at the date of the submission. Also eligible are authors who have graduated only recently, provided the submitted paper is based on work carried out when he or she still was a student. The award decision is made by the Program Committee.
The award is named after Stephen Cole Kleene, who did pioneering work in the field of logic as related to computer science.
Past recipients[]
Past recipients of the Kleene award are tabulated below.[1]
| Year | Recipient | Paper |
|---|---|---|
| 1995 | "Decidability of Linear Affine Logic" | |
| 1996 | "Counting Modulo Quantifiers on Finite Linearly Ordered Trees" | |
| 1996 | "Games and Full Abstraction for FPC" | |
| 1997 | "Unique Fixpoint Induction for Value-Passing Processes" | |
| 1998 | "Fragments of Existential Second-Order Logic without 0-1 Laws" | |
| 2000 | "A General Notion of Realizability" | |
| 2001 | "Light Affine Lambda Calculus and Polytime Strong Normalization" | |
| 2001 | "Definitions by Rewriting in the Calculus of Constructions" | |
| 2002 | "Unsatisfiable Random Formulas are Hard to Certify" | |
| 2003 | Benjamin Rossman | "Successor-Invariance in the Finite" |
| 2004 | "On the Automata Size for Presburger Arithmetic" | |
| 2005 | Benjamin Rossman | "Existential Positive Types and Preservation under Homomorphisims" |
| 2006 | "Context Semantics, Linear Logic and Computational Complexity" | |
| 2007 | "Full abstraction for nominal general references" | |
| 2008 | "Hypergraph Acyclicity and Extension Preservation Theorems" | |
| 2009 | Oliver Friedmann | "An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it" |
| 2010 | "Parikh Images of Grammars: Complexity and Applications" | |
| 2011 | "Proof Nets for Additive Linear Logic with Units" | |
| 2012 | "Lower Bounds for Existential Pebble Games and k-Consistency Tests" | |
| 2013 | "From Frame Properties to Hypersequent Rules in Modal Logics" | |
| 2014 | "Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives" | |
| 2014 | "On the characterization of models of H" | |
| 2015 | "Distributed Graph Automata" | |
| 2016 | "Winning Cores in Parity Games" | |
| 2017 | "Constructive completeness for the linear-time mu-calculus" | |
| 2018 | "A sequent calculus with dependent types for classical arithmetic" | |
| 2019 | "A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics" | |
| 2020 | "Successor-Invariant First-Order Logic on Classes of Bounded Degree" |
See also[]
Notes[]
- ^ a b "LICS - Archive". lics.siglog.org.
External links[]
Categories:
- Computer science awards