Symposium on Logic in Computer Science: Difference between revisions

Revision as of 14:52, 23 September 2020

Revision as of 18:40, 23 September 2020

Line 11:

== LICS Awards ==

{{cleanup section|date=September 2020|reason=dates in reverse chronological order, contrary to [[WP:DATELIST]].}}

=== Test-of-Time Award ===

Each year, since 2006, the LICS Test-of-Time Award recognizes those articles from LICS proceedings 20 years earlier, which have become influential.

==== 2020 ====

==== 20202006 ====

* [[Luca de Alfaro]], [[Thomas A. Henzinger]], "Concurent Omega-Regular Games"

*[[Leo Bachmair]], [[Nachum Dershowitz]], [[Jieh Hsiang]], "Orderings for Equational Proofs"

* [[Hiroshi Nakano (computer scientist)|Hiroshi Nakano]], "A Modality for Recursion"

*[[E. Allen Emerson]], [[Chin-Laung Lei]], "Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract)"

*[[Moshe Y. Vardi]], [[Pierre Wolper]], "An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report)"

==== 20192007 ====

*[[Samson Abramsky]], "Domain theory in Logical Form"

*[[Robert Harper]], [[Furio Honsell]], [[Gordon D. Plotkin]], "A Framework for Defining Logics"

==== 20132008 ====

* [[Marcelo P. Fiore]], [[Gordon D. Plotkin]], [[Daniele Turi]], "Abstract Syntax and Variable Binding"

* [[MurdochMartin GabbayAbadi]], [[AndrewLeslie M. PittsLamport]], "A New Approach toThe Abstractexistence Syntaxof Involvingrefinement Bindersmappings"

==== 20182009 ====

*[[Eugenio Moggi]], "Computational lambda-calculus and monads"

==== 20112010 ====

* [[Martín Abadi]], [[Cédric Fournet]], [[Georges Gonthier]], "Secure Implementation of Channel Abstractions"

* [[SamsonRajeev AbramskyAlur]], [[KoheiCostas HondaCourcoubetis]], [[GuyDavid McCuskerL. Dill]], "A Fully Abstract Game SemanticsModel-checking for Generalreal-time Referencessystems"

*[[Jerry R. Burch]], [[Edmund Clarke]], [[Kenneth L. McMillan]], [[David L. Dill]], [[James Hwang]], "Symbolic model checking: 10^20 states and beyond"

*[[Max Dauchet]], [[Sophie Tison]], "The theory of ground rewrite systems is decidable"

*[[Peter Freyd]], "Recursive types reduced to inductive types"

==== 20172011 ====

*[[Patrice Godefroid]], [[Pierre Wolper]], "A partial approach to model checking"

*[[Joshua Hodas]], [[Dale A. Miller]], "Logic programming in a fragment of intuitionistic linear logic"

*[[Dexter Kozen]], "A completeness theorem for Kleene algebras and the algebra of regular events"

==== 20092012 ====

* [[Richard Blute]], [[Josée Desharnais]], [[Abbas Edalat]], [[Prakash Panangaden]], "Bisimulation for Labelled Markov Processes"

*[[Thomas Henzinger]], [[Xavier Nicollin]], [[Joseph Sifakis]], [[Sergio Yovine]], "Symbolic model checking for real-time systems"

* [[Daniele Turi]], [[Gordon D. Plotkin]], "Towards a Mathematical Operational Semantics"

*[[Jean-Pierre Talpin]], [[Pierre Jouvelot]], "The type and effect discipline"

==== 20162013 ====

*[[Leo Bachmair]], [[Harald Ganzinger]], [[Uwe Waldmann]], "Set constraints are the monadic class"

*[[André Joyal]], [[Mogens Nielson]], [[Glynn Winskel]], "Bisimulation and open maps"

*[[Benjamin C. Pierce]], [[Davide Sangiorgi]], "Typing and subtyping for mobile processes"

==== 20072014 ====

* [[Parosh A. Abdulla]], [[Karlis Cerans]], [[Bengt Jonsson (computer scientist)|Bengt Jonsson]], [[Yih-Kuen Tsay]], "General decidability theorems for infinite-state systems"

*[[Martin Hofmann]], [[Thomas Streicher]], "The groupoid model refutes uniqueness of identity proofs"

* [[Iliano Cervesato]], [[Frank Pfenning]], "A Linear Logical Framework"

*[[Dale A. Miller]], "A multiple-conclusion meta-logic"

==== 2015 ====

Line 45 ⟶ 59:

* [[Igor Walukiewicz]], "Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus"

==== 20142016 ====

*[[Martin Hofmann]], [[Thomas Streicher]], "The groupoid model refutes uniqueness of identity proofs"

*[[Dale A. Miller]], "A multiple-conclusion meta-logic"

* [[Parosh A. Abdulla]], [[Karlis Cerans]], [[Bengt Jonsson (computer scientist)|Bengt Jonsson]], [[Yih-Kuen Tsay]], "General decidability theorems for infinite-state systems"

==== 2013 ====

* [[Iliano Cervesato]], [[Frank Pfenning]], "A Linear Logical Framework"

*[[Leo Bachmair]], [[Harald Ganzinger]], [[Uwe Waldmann]], "Set constraints are the monadic class"

*[[André Joyal]], [[Mogens Nielson]], [[Glynn Winskel]], "Bisimulation and open maps"

*[[Benjamin C. Pierce]], [[Davide Sangiorgi]], "Typing and subtyping for mobile processes"

==== 20122017 ====

*[[Thomas Henzinger]], [[Xavier Nicollin]], [[Joseph Sifakis]], [[Sergio Yovine]], "Symbolic model checking for real-time systems"

*[[Jean-Pierre Talpin]], [[Pierre Jouvelot]], "The type and effect discipline"

* [[Richard Blute]], [[Josée Desharnais]], [[Abbas Edalat]], [[Prakash Panangaden]], "Bisimulation for Labelled Markov Processes"

==== 2011 ====

* [[PatriceDaniele GodefroidTuri]], [[PierreGordon WolperD. Plotkin]], "A partialTowards approacha toMathematical modelOperational checkingSemantics"

*[[Joshua Hodas]], [[Dale A. Miller]], "Logic programming in a fragment of intuitionistic linear logic"

*[[Dexter Kozen]], "A completeness theorem for Kleene algebras and the algebra of regular events"

==== 20102018 ====

*[[Rajeev Alur]], [[Costas Courcoubetis]], [[David L. Dill]], "Model-checking for real-time systems"

*[[Jerry R. Burch]], [[Edmund Clarke]], [[Kenneth L. McMillan]], [[David L. Dill]], [[James Hwang]], "Symbolic model checking: 10^20 states and beyond"

*[[Max Dauchet]], [[Sophie Tison]], "The theory of ground rewrite systems is decidable"

*[[Peter Freyd]], "Recursive types reduced to inductive types"

* [[Martín Abadi]], [[Cédric Fournet]], [[Georges Gonthier]], "Secure Implementation of Channel Abstractions"

==== 2009 ====

* [[Samson Abramsky]], [[Kohei Honda]], [[Guy McCusker]], "A Fully Abstract Game Semantics for General References"

*[[Eugenio Moggi]], "Computational lambda-calculus and monads"

==== 20082019 ====

*[[Martin Abadi]], [[Leslie Lamport]], "The existence of refinement mappings"

* [[Marcelo P. Fiore]], [[Gordon D. Plotkin]], [[Daniele Turi]], "Abstract Syntax and Variable Binding"

==== 2007 ====

* [[Murdoch Gabbay]], [[Andrew M. Pitts]], "A New Approach to Abstract Syntax Involving Binders"

*[[Samson Abramsky]], "Domain theory in Logical Form"

*[[Robert Harper]], [[Furio Honsell]], [[Gordon D. Plotkin]], "A Framework for Defining Logics"

==== 20062020 ====

*[[Leo Bachmair]], [[Nachum Dershowitz]], [[Jieh Hsiang]], "Orderings for Equational Proofs"

* [[Luca de Alfaro]], [[Thomas A. Henzinger]], "Concurent Omega-Regular Games"

*[[E. Allen Emerson]], [[Chin-Laung Lei]], "Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract)"

* [[Hiroshi Nakano (computer scientist)|Hiroshi Nakano]], "A Modality for Recursion"

*[[Moshe Y. Vardi]], [[Pierre Wolper]], "An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report)"

=== Kleene award ===