Symposium on Logic in Computer Science

From Wikipedia, the free encyclopedia
For the article on the topic of logic in computer science, see logic in computer science.

The ACM–IEEE Symposium on Logic in Computer Science (LICS) is an annual academic conference on the theory and practice of computer science in relation to mathematical logic. Extended versions of selected papers of each year's conference appear in renowned international journals such as Logical Methods in Computer Science and ACM Transactions on Computational Logic.

History[]

LICS was originally sponsored solely by the IEEE, but as of the 2014 founding of the ACM Special Interest Group on Logic and Computation LICS has become the flagship conference of SIGLOG, under the joint sponsorship of ACM and IEEE.[1]

Since the first installment in 1988, the cover page of the conference proceedings has featured an artwork entitled Irrational Tiling by Logical Quantifiers, by Alvy Ray Smith.[2]

Since 1995, each year the Kleene award is given to the best student paper. In addition, since 2006, the LICS Test-of-Time Award is given annually to one among the twenty-year-old LICS papers that have best met the test of time.[3]

LICS Awards[]

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.

2006[]

  • , Nachum Dershowitz, , "Orderings for Equational Proofs"
  • E. Allen Emerson, , "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)"

2007[]

2008[]

2009[]

2010[]

  • Rajeev Alur, , David L. Dill, "Model-checking for real-time systems"
  • , Edmund Clarke, , David L. Dill, , "Symbolic model checking: 10^20 states and beyond"
  • , , "The theory of ground rewrite systems is decidable"
  • Peter Freyd, "Recursive types reduced to inductive types"

2011[]

  • , Pierre Wolper, "A partial approach to model checking"
  • , , "Logic programming in a fragment of intuitionistic linear logic"
  • Dexter Kozen, "A completeness theorem for Kleene algebras and the algebra of regular events"

2012[]

2013[]

2014[]

  • , Thomas Streicher, "The groupoid model refutes uniqueness of identity proofs"
  • , "A multiple-conclusion meta-logic"

2015[]

  • , "Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus"

2016[]

  • , , , , "General decidability theorems for infinite-state systems"
  • , Frank Pfenning, "A Linear Logical Framework"

2017[]

  • , , Abbas Edalat, Prakash Panangaden, "Bisimulation for Labelled Markov Processes"
  • , Gordon D. Plotkin, "Towards a Mathematical Operational Semantics"

2018[]

2019[]

  • , Gordon D. Plotkin, , "Abstract Syntax and Variable Binding"
  • , , "A New Approach to Abstract Syntax Involving Binders"

2020[]

  • , Thomas A. Henzinger, "Concurrent Omega-Regular Games"
  • , "A Modality for Recursion"

2021[]

  • , , David L. Dill, , "A Decision Procedure for an Extensional Theory of Arrays"
  • , "Dependent Types for Program Termination Verification"

Kleene award[]

At each conference the Kleene award, in honour of S.C. Kleene, is given for the best student paper.

See also[]

Notes[]

  1. ^ Panangaden, Prakash (July 2014), "Welcome to SIGLOG!", Chair's Letter, SIGLOG News, 1 (1): 2–3.
  2. ^ Irrational Tiling by Logical Quantifiers LICS cover by Alvy Ray Smith.
  3. ^ LICS awards website

External links[]

Retrieved from ""