Kleene Award

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]

YearRecipientPaper
1995Alexei P. Kopylov"Decidability of Linear Affine Logic"
1996Juha Nurmonen"Counting Modulo Quantifiers on Finite Linearly Ordered Trees"
1996Guy McCusker"Games and Full Abstraction for FPC"
1997Julian Rathke"Unique Fixpoint Induction for Value-Passing Processes"
1998Jean-Marie Le Bars"Fragments of Existential Second-Order Logic without 0-1 Laws"
2000Lars Birkedal"A General Notion of Realizability"
2001Kazushige Terui"Light Affine Lambda Calculus and Polytime Strong Normalization"
2001Frédéric Blanqui"Definitions by Rewriting in the Calculus of Constructions"
2002Albert Atserias"Unsatisfiable Random Formulas are Hard to Certify"
2003Benjamin Rossman"Successor-Invariance in the Finite"
2004Felix Klaedtke"On the Automata Size for Presburger Arithmetic"
2005Benjamin Rossman"Existential Positive Types and Preservation under Homomorphisims"
2006Ugo Dal Lago"Context Semantics, Linear Logic and Computational Complexity"
2007Nikos Tzevelekos"Full abstraction for nominal general references"
2008David Duris"Hypergraph Acyclicity and Extension Preservation Theorems"
2009Oliver Friedmann"An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it"
2010Anthony Widjaja To"Parikh Images of Grammars: Complexity and Applications"
2011Willem Heijltjes"Proof Nets for Additive Linear Logic with Units"
2012Christoph Berkholz"Lower Bounds for Existential Pebble Games and k-Consistency Tests"
2013Ori Lahav"From Frame Properties to Hypersequent Rules in Modal Logics"
2014Yaron Velner"Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives"
2014Flavien Breuvart"On the characterization of models of H"
2015Fabian Reiter"Distributed Graph Automata"
2016Steen Vester"Winning Cores in Parity Games"
2017Amina Doumane"Constructive completeness for the linear-time mu-calculus"
2018Étienne Miquey"A sequent calculus with dependent types for classical arithmetic"
2019Renaud Vilmart"A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics"
2020Julien Grange"Successor-Invariant First-Order Logic on Classes of Bounded Degree"

See also

Notes

  1. "LICS - Archive". lics.siglog.org.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.