ACM/IEEE Symposium on Logic in Computer Science

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Authors on this page:

• Salvatore La Torre
• Grégory Lafitte
• Gregory Lafitte
• Claude Laflamme
• Ambroise Lafont
• Yves Lafont
• Ugo Dal Lago
• Ori Lahav
• J. Laird
• James Laird
• Jim Laird
• Laks V. S. Lakshmanan
• François Lamarche
• Joachim Lambek
• Robby Lampert
• Leslie Lamport
• Ivan Lanese
• Cosimo Laneve
• Martin Lange
• Sophie Laplante
• Dominique Larchey-Wendling
• Benoit Larose
• François Laroussinie
• Kim G. Larsen
• Kim Larsen
• Slawomir Lasota
• Sławomir Lasota
• Richard Lassaigne
• Soren B. Lassen
• Jean-Louis Lassez
• Marc Lasson
• Louis Latour
• Bastian Laubner
• Olivier Laurent
• Alexander Lauser
• Clemens Lautemann
• Ranko Lazic
• Dai Tri Man Le
• Jean-Marie Le Bars
• Antonia Lechner
• Jeremy Ledent
• Peter Lee
• Seunghwan H. Lee
• Axel Legay
• Karoliina Lehtinen
• Chin-Laung Lei
• Graham E. Leigh
• Hans Leiß
• Alexander Leitsch
• Daniel Leivant
• Tuomo Lempiäinen
• Kjell Lemström
• Ondrej Lengál
• Sergueï Lenglet
• Maurizio Lenzerini
• Giacomo Lenzi
• Jérôme Leroux
• Pierre Lescanne
• Simon Leßenich
• Thomas Leventis
• Leonid A. Levin
• Jeremy R. Levitt
• Paul Blain Levy
• Jean-Jacques Lévy
• Gabriel Lewertowski
• Harry R. Lewis
• Nathan Lhote
• Xin Li
• Jian-Qi Li
• Yangjia Li
• Chuck Liang
• Hongjin Liang
• Leonid Libkin
• Daniel R. Licata
• Yossi Lichtenstein
• Orna Lichtenstein
• Moritz Lichter
• André Lieutier
• Vladimir Lifschitz
• Anthony Widjaja Lin
• Shang-Wei Lin
• Patrick Lincoln
• Steven Lindell
• Bert Lindenhovius
• Jiamou Liu
• Yongmei Liu
• Ralph Loader
• Kamal Lodaya
• Christof Löding
• Alexey Loginov
• Peter Lohmann
• Markus Lohrey
• Veronika Loitzenbauer
• Daniel Lokshtanov
• David E. Long
• Giuseppe Longo
• Sarah M. Loos
• Katja Losemann
• Cynthia Loten
• Donald W. Loveland
• Étienne Lozes
• Eliezer L. Lozinskii
• Yuan Lu
• Robert S. Lubarsky
• Thomas Lukasiewicz
• Peter LeFanu Lumsdaine
• Zhaohui Luo
• Haifeng Luo
• Kerkko Luosto
• Carsten Lutz
• Inês Lynce
• James F. Lynch
• Christopher Lynch
• Nancy A. Lynch

Salvatore La Torre

• Paper: Rajeev Alur Salvatore La Torre
  Deterministic Generators and Games for LTL Fragments (LICS 2001) More Information...
• Paper: Marco Faella Salvatore La Torre Aniello Murano
  Dense Real-time Games (LICS 2002) More Information...
• Paper: Salvatore La Torre Parthasarathy Madhusudan Gennaro Parlato
  A Robust Class of Context-Sensitive Languages (LICS 2007) More Information...

Grégory Lafitte

• Paper: Julien Cervelle Grégory Lafitte
  On shift-invariant maximal filters and hormonal cellular automata (LICS 2017) More Information...

Gregory Lafitte

• Short Presentation: Fabien Givors Gregory Lafitte
  Holes Punched Computabilities (LICS 2011) More Information...

Claude Laflamme

• Paper: Kevin J. Compton Claude Laflamme
  An algebra and a logic for NC¹ (LICS 1988) More Information...

Ambroise Lafont

• Paper: Peio Borthelle Tom Hirschowitz Ambroise Lafont
  A Cellular Howe Theorem (LICS 2020) More Information...

Yves Lafont

• Paper: Yves Lafont Thomas Streicher
  Games semantics for linear logic (LICS 1991) More Information...

Ugo Dal Lago

• Paper: Ugo Dal Lago Francesco Gavazzo Paul Blain Levy
  Effectful applicative bisimilarity: Monads, relators, and Howe's method (LICS 2017) More Information...
• Paper: Ugo Dal Lago Naohiko Hoshino
  The Geometry of Bayesian Programming (LICS 2019) More Information...
• Paper: Naoki Kobayashi Ugo Dal Lago Charles Grellois
  On the Termination Problem for Probabilistic Higher-Order Recursive Programs (LICS 2019) More Information...
• Paper: Martin Avanzini Ugo Dal Lago Alexis Ghyselen
  Type-Based Complexity Analysis of Probabilistic Functional Programs (LICS 2019) More Information...

Ori Lahav

• Paper: Ori Lahav
  From Frame Properties to Hypersequent Rules in Modal Logics (LICS 2013) More Information...

J. Laird

• Paper: J. Laird
  Fixed Points In Quantitative Semantics (LICS 2016) More Information...

James Laird

• Paper: James Laird
  Full abstraction for functional languages with control (LICS 1997) More Information...
• Paper: James Laird
  A Fully Abstract Game Semantics of Local Exceptions (LICS 2001) More Information...
• Paper: James Laird
  Game Semantics for a Polymorphic Programming Language (LICS 2010) More Information...
• Paper: Martin Churchill James Laird Guy McCusker
  Imperative Programs as Proofs via Game Semantics (LICS 2011) More Information...
• Paper: James Laird Giulio Manzonetto Guy McCusker Michele Pagani
  Weighted Relational Models of Typed Lambda-Calculi (LICS 2013) More Information...
• Short Presentation: James Laird
  Semantics of Closures: Deconstructing Local State (LICS 2013) More Information...

Jim Laird

• Paper: Valentin Blot Jim Laird
  Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types (LICS 2018) More Information...

Laks V. S. Lakshmanan

• Paper: Laks V. S. Lakshmanan Karima Ashraf Jiawei Han
  Homomorphic tree embeddings and their applications to recursive program optimization (LICS 1993) More Information...

François Lamarche

• Paper: François Lamarche
  Games Semantics for Full Propositional Linear Logic (LICS 1995) More Information...
• Paper: François Lamarche Lutz Straßburger
  Constructing Free Boolean Categories (LICS 2005) More Information...

Joachim Lambek

• Invited Paper: Joachim Lambek
  Programs, grammars and arguments: a personal view of some connections between computation, language and logic (LICS 1993) More Information...

Robby Lampert

• Paper: Benjamin Aminof Orna Kupferman Robby Lampert
  Rigorous Approximated Determinization of Weighted Automata (LICS 2011) More Information...

Leslie Lamport

• Paper: Martín Abadi Leslie Lamport
  The existence of refinement mappings (LICS 1988) More Information...

Ivan Lanese

• Paper: Ivan Lanese Jorge A. Perez Davide Sangiorgi Alan Schmitt
  On the Expressiveness and Decidability of Higher-Order Process Calculi (LICS 2008) More Information...

Cosimo Laneve

• Paper: Andrea Asperti Vincent Danos Cosimo Laneve Laurent Regnier
  Paths in the lambda-calculus. Three years of communications without understanding (LICS 1994) More Information...
• Paper: Cosimo Laneve Antonio Vitale
  The Expressive Power of Synchronizations (LICS 2010) More Information...

Martin Lange

• Paper: Martin Lange Colin Stirling
  Focus Games for Satisfiability and Completeness of Temporal Logic (LICS 2001) More Information...

Sophie Laplante

• Paper: Sophie Laplante Richard Lassaigne Frédéric Magniez Sylvain Peyronnet Michel de Rougemont
  Probabilistic abstraction for model checking: An approach based on property testing (LICS 2002) More Information...

Dominique Larchey-Wendling

• Paper: Dominique Larchey-Wendling Didier Galmiche
  The Undecidability of Boolean BI through Phase Semantics (LICS 2010) More Information...

Benoit Larose

• Paper: Víctor Dalmau Andrei A. Krokhin Benoit Larose
  First-Order Definable Retraction Problems for Posets and Reflexive Graphs (LICS 2004) More Information...
• Paper: Benoit Larose Cynthia Loten Claude Tardif
  A Characterisation of First-Order Constraint Satisfaction Problems (LICS 2006) More Information...
• Paper: László Egri Benoit Larose Pascal Tesson
  Symmetric Datalog and Constraint Satisfaction Problems in Logspace (LICS 2007) More Information...
• Paper: Víctor Dalmau Benoit Larose
  Maltsev + Datalog --> Symmetric Datalog (LICS 2008) More Information...
• Paper: Víctor Dalmau László Egri Pavol Hell Benoit Larose Arash Rafiey
  Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (LICS 2015) More Information...

François Laroussinie

• Paper: François Laroussinie Nicolas Markey Philippe Schnoebelen
  Temporal Logic with Forgettable Past (LICS 2002) More Information...

Kim G. Larsen

• Paper: Kim G. Larsen Bent Thomsen
  A modal process logic (LICS 1988) More Information...
• Paper: Kim G. Larsen Liu Xinxin
  Equation solving using modal transition systems (LICS 1990) More Information...
• Paper: Bengt Jonsson Kim G. Larsen
  Specification and refinement of probabilistic processes (LICS 1991) More Information...
• Paper: Dexter Kozen Kim G. Larsen Radu Mardare Prakash Panangaden
  Stone Duality for Markov Processes (LICS 2013) More Information...
• Paper: Robert Furber Dexter Kozen Kim G. Larsen Radu Mardare Prakash Panangaden
  Unrestricted stone duality for Markov processes (LICS 2017) More Information...

Kim Larsen

• Short Presentation: Kim Larsen Radu Mardare Prakash Panangaden
  A Metric Analogue of Stone Duality for Markov Processes (LICS 2012) More Information...

Slawomir Lasota

• Paper: Lorenzo Clemente Slawomir Lasota
  Timed Pushdown Automata Revisited (LICS 2015) More Information...
• Paper: Wojciech Czerwiński Slawomir Lasota
  Regular separability of one counter automata (LICS 2017) More Information...
• Paper: Lorenzo Clemente Slawomir Lasota Ranko Lazic Filip Mazowiecki
  Timed pushdown automata and branching vector addition systems (LICS 2017) More Information...

Sławomir Lasota

• Paper: Mikołaj Bojańczyk Sławomir Lasota
  An Extension of Data Automata that Captures XPath (LICS 2010) More Information...
• Paper: Mikołaj Bojańczyk Bartek Klin Sławomir Lasota
  Automata with Group Actions (LICS 2011) More Information...
• Paper: Mikołaj Bojańczyk Bartek Klin Sławomir Lasota Szymon Toruńczyk
  Turing Machines with Atoms (LICS 2013) More Information...
• Paper: Bartek Klin Sławomir Lasota Joanna Ochremiak Szymon Toruńczyk
  Turing machines with atoms, constraint satisfaction problems, and descriptive complexity (LICS 2014) More Information...

Richard Lassaigne

• Paper: Sophie Laplante Richard Lassaigne Frédéric Magniez Sylvain Peyronnet Michel de Rougemont
  Probabilistic abstraction for model checking: An approach based on property testing (LICS 2002) More Information...

Soren B. Lassen

• Paper: Soren B. Lassen
  Eager Normal Form Bisimulation (LICS 2005) More Information...
• Paper: Soren B. Lassen
  Head normal form bisimulation for pairs and the lambda-mu calculus (LICS 2006) More Information...
• Paper: Soren B. Lassen Paul Blain Levy
  Typed Normal Form Bisimulation for Parametric Polymorphism (LICS 2008) More Information...

Jean-Louis Lassez

• Paper: Jean-Louis Lassez Ken McAloon
  A constraint sequent calculus (LICS 1990) More Information...

Marc Lasson

• Short Presentation: Marc Lasson Chantal Keller
  Parametricity in an Impredicative Sort (LICS 2012) More Information...

Louis Latour

• Paper: Louis Latour
  From Automata to Formulas: Convex Integer Polyhedra (LICS 2004) More Information...

Bastian Laubner

• Paper: Anuj Dawar Martin Grohe Bjarki Holm Bastian Laubner
  Logics with Rank Operators (LICS 2009) More Information...
• Paper: Bastian Laubner
  Capturing Polynomial Time on Interval Graphs (LICS 2010) More Information...

Olivier Laurent

• Paper: Olivier Laurent
  Polarized games (LICS 2002) More Information...
• Paper: Olivier Laurent Laurent Regnier
  About Translations of Classical Logic into Polarized Linear Logic (LICS 2003) More Information...
• Paper: Olivier Laurent Lorenzo Tortora de Falco
  Obsessional cliques: a semantic characterization of bounded time complexity (LICS 2006) More Information...
• Paper: Olivier Laurent Roberto Maieli
  Cut Elimination for Monomial MALL Proof Nets (LICS 2008) More Information...
• Paper: Olivier Laurent
  Around Classical and Intuitionistic Linear Logics (LICS 2018) More Information...

Alexander Lauser

• Paper: Manfred Kufleitner Alexander Lauser
  Languages of Dot-Depth One over Infinite Words (LICS 2011) More Information...

Clemens Lautemann

• Paper: David A. Mix Barrington Neil Immerman Clemens Lautemann Nicole Schweikardt Denis Thérien
  The Crane Beach Conjecture (LICS 2001) More Information...

Ranko Lazic

• Paper: Stéphane Demri Ranko Lazic
  LTL with the Freeze Quantifier and Register Automata (LICS 2006) More Information...
• Paper: Marcin Jurdzinski Ranko Lazic
  Alternation-free modal mu-calculus for data trees (LICS 2007) More Information...
• Paper: Ranko Lazic Sylvain Schmitz
  Non-elementary complexities for branching VASS, MELL, and extensions (LICS 2014) More Information...
• Paper: Ranko Lazic Sylvain Schmitz
  The Complexity of Coverability in ν-Petri Nets (LICS 2016) More Information...
• Paper: Matthias Englert Ranko Lazic Patrick Totzke
  Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete (LICS 2016) More Information...
• Paper: Lorenzo Clemente Slawomir Lasota Ranko Lazic Filip Mazowiecki
  Timed pushdown automata and branching vector addition systems (LICS 2017) More Information...
• Paper: Marcin Jurdzinski Ranko Lazic
  Succinct progress measures for solving parity games (LICS 2017) More Information...
• Paper: Thomas Colcombet Marcin Jurdzinski Ranko Lazic Sylvain Schmitz
  Perfect half space games (LICS 2017) More Information...
• Paper: Laure Daviaud Marcin Jurdzinski Ranko Lazic
  A pseudo-quasi-polynomial algorithm for mean-payoff parity games (LICS 2018) More Information...

Dai Tri Man Le

• Paper: Dai Tri Man Le Stephen A. Cook
  Formalizing Randomized Matching Algorithms (LICS 2011) More Information...

Jean-Marie Le Bars

• Paper: Jean-Marie Le Bars
  Fragments of Existential Second-Order Logic without 0-1 Laws (LICS 1998) More Information...
• Paper: Jean-Marie Le Bars
  The 0-1 law fails for frame satisfiability of propositional modal logic (LICS 2002) More Information...

Antonia Lechner

• Paper: Antonia Lechner Joël Ouaknine James Worrell
  On the Complexity of Linear Arithmetic with Divisibility (LICS 2015) More Information...

Jeremy Ledent

• Paper: Martin Hofmann Jeremy Ledent
  A cartesian-closed category for higher-order model checking (LICS 2017) More Information...

Peter Lee

• Paper: George C. Necula Peter Lee
  Efficient Representation and Validation of Proofs (LICS 1998) More Information...

Seunghwan H. Lee

• Short Presentation: Seunghwan H. Lee
  Problems in nesting logics to higher order (LICS 2005) More Information...

Axel Legay

• Short Presentation: Uli Fahrenberg Axel Legay
  History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps (LICS 2013) More Information...
• Paper: Dror Fried Axel Legay Joël Ouaknine Moshe Y. Vardi
  Sequential Relational Decomposition (LICS 2018) More Information...

Karoliina Lehtinen

• Paper: Karoliina Lehtinen
  A modal μ perspective on solving parity games in quasi-polynomial time (LICS 2018) More Information...
• Paper: Karoliina Lehtinen Martin Zimmermann
  Good-for-games ω-Pushdown Automata (LICS 2020) More Information...

Chin-Laung Lei

• Paper: E. Allen Emerson Chin-Laung Lei
  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) (LICS 1986) More Information...

Graham E. Leigh

• Paper: Bahareh Afshari Graham E. Leigh
  Cut-free completeness for modal mu-calculus (LICS 2017) More Information...

Hans Leiß

• Paper: Foto N. Afrati Hans Leiß Michel de Rougemont
  Definability and Compression (LICS 2000) More Information...

Alexander Leitsch

• Paper: Matthias Baaz Christian G. Fermüller Alexander Leitsch
  A non-elementary speed-up in proof length by structural clause form transformation (LICS 1994) More Information...
• Paper: Matthias Baaz Alexander Leitsch Giselle Reis
  A Note on the Complexity of Classical and Intuitionistic Proofs (LICS 2015) More Information...

Daniel Leivant

• Paper: Daniel Leivant
  Stratified polymorphism (LICS 1989) More Information...
• Paper: Daniel Leivant
  A foundational delineation of computational feasibility (LICS 1991) More Information...
• Paper: Daniel Leivant
  Calibrating computational feasibility by abstraction rank (LICS 2002) More Information...
• Paper: Daniel Leivant
  Proving Termination Assertions in Dynamic Logics (LICS 2004) More Information...
• Paper: Daniel Leivant
  Matching explicit and modal reasoning about programs: a proof theoretic delineation of dynamic logic (LICS 2006) More Information...
• Short Presentation: Daniel Leivant
  The Comprehension Cube, its Primitive Recursive Corner (LICS 2012) More Information...

Tuomo Lempiäinen

• Paper: Tuomo Lempiäinen
  Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing (LICS 2016) More Information...

Kjell Lemström

• Paper: Kjell Lemström Lauri Hella
  Approximate Pattern Matching is Expressible in Transitive Closure Logic (LICS 2000) More Information...

Ondrej Lengál

• Paper: Yu-Fang Chen Ondrej Lengál Tony Tan Zhilin Wu
  Register automata with linear arithmetic (LICS 2017) More Information...

Sergueï Lenglet

• Paper: Malgorzata Biernacka Dariusz Biernacki Sergueï Lenglet Piotr Polesiuk Damien Pous Alan Schmitt
  Fully abstract encodings of λ-calculus in HOcore through abstract machines (LICS 2017) More Information...

Maurizio Lenzerini

• Paper: Diego Calvanese Giuseppe De Giacomo Maurizio Lenzerini Moshe Y. Vardi
  View-Based Query Processing and Constraint Satisfaction (LICS 2000) More Information...
• Invited Paper: Diego Calvanese Giuseppe De Giacomo Maurizio Lenzerini
  Description Logics: Foundations for Class-based Knowledge Representation (LICS 2002) More Information...

Giacomo Lenzi

• Paper: Giacomo Lenzi André Arnold Jerzy Marcinkowski
  The Hierarchy inside Closed Monadic S1 Collapses on the Infinite Binary Tree (LICS 2001) More Information...
• Paper: David Janin Giacomo Lenzi
  Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy (LICS 2001) More Information...

Jérôme Leroux

• Paper: Jérôme Leroux
  A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams (LICS 2005) More Information...
• Paper: Jérôme Leroux
  The General Vector Addition System Reachability Problem by Presburger Inductive Invariants (LICS 2009) More Information...
• Paper: Jérôme Leroux
  Presburger Vector Addition Systems (LICS 2013) More Information...
• Paper: Jérôme Leroux Vincent Penelle Grégoire Sutre
  On the Context-Freeness Problem for Vector Addition Systems (LICS 2013) More Information...
• Paper: Jérôme Leroux M. Praveen Grégoire Sutre
  Hyper-Ackermannian bounds for pushdown vector addition systems (LICS 2014) More Information...
• Paper: Jérôme Leroux Sylvain Schmitz
  Demystifying Reachability in Vector Addition Systems (LICS 2015) More Information...
• Paper: Piotr Hofman Jérôme Leroux Patrick Totzke
  Linear combinations of unordered data vectors (LICS 2017) More Information...
• Paper: Jérôme Leroux Sylvain Schmitz
  Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension (LICS 2019) More Information...
• Paper: Antonín Kucera Jérôme Leroux Dominik Velan
  Efficient Analysis of VASS Termination Complexity (LICS 2020) More Information...

Pierre Lescanne

• Paper: Claude Kirchner Pierre Lescanne
  Solving Disequations (LICS 1987) More Information...
• Paper: Max Dauchet Sophie Tison Thierry Heuillard Pierre Lescanne
  Decidability of the Confluence of Ground Term Rewriting Systems (LICS 1987) More Information...
• Paper: Pierre Lescanne
  Well rewrite orderings (LICS 1990) More Information...

Simon Leßenich

• Paper: Felix Canavoi Erich Grädel Simon Leßenich Wied Pakusa
  Defining Winning Strategies in Fixed-Point Logic (LICS 2015) More Information...

Thomas Leventis

• Paper: Thomas Leventis
  Probabilistic Böhm Trees and Probabilistic Separation (LICS 2018) More Information...

Leonid A. Levin

• Invited Paper: Leonid A. Levin
  Turing's Password: What Internet Cannot Leak (LICS 2012) More Information...

Jeremy R. Levitt

• Paper: Aaron Stump Clark W. Barrett David L. Dill Jeremy R. Levitt
  A Decision Procedure for an Extensional Theory of Arrays (LICS 2001) More Information...

Paul Blain Levy

• Paper: Soren B. Lassen Paul Blain Levy
  Typed Normal Form Bisimulation for Parametric Polymorphism (LICS 2008) More Information...
• Paper: Jiri Adamek Stefan Milius Nathan Bowler Paul Blain Levy
  Coproducts of Monads on Set (LICS 2012) More Information...
• Paper: Paul Blain Levy Sam Staton
  Transition systems over games (LICS 2014) More Information...
• Paper: Ohad Kammar Paul Blain Levy Sean K. Moss Sam Staton
  A monad for full ground reference cells (LICS 2017) More Information...
• Paper: Ugo Dal Lago Francesco Gavazzo Paul Blain Levy
  Effectful applicative bisimilarity: Monads, relators, and Howe's method (LICS 2017) More Information...

Jean-Jacques Lévy

• Paper: Georges Gonthier Jean-Jacques Lévy Paul-André Melliès
  An abstract standardisation theorem (LICS 1992) More Information...
• Paper: Georges Gonthier Martín Abadi Jean-Jacques Lévy
  Linear logic without boxes (LICS 1992) More Information...
• Paper: Andrea Asperti Jean-Jacques Lévy
  The Cost of Usage in the Lambda-Calculus (LICS 2013) More Information...

Gabriel Lewertowski

• Paper: Guilhem Jaber Gabriel Lewertowski Pierre-Marie Pédrot Matthieu Sozeau Nicolas Tabareau
  The Definitional Side of the Forcing (LICS 2016) More Information...

Harry R. Lewis

• Paper: Harry R. Lewis
  A logic of concrete time intervals (LICS 1990) More Information...

Nathan Lhote

• Paper: Emmanuel Filiot Olivier Gauwin Nathan Lhote
  First-order definability of rational transductions: An algebraic approach (LICS 2016) More Information...
• Paper: Emmanuel Filiot Ismaël Jecker Nathan Lhote Guillermo A. Pérez Jean-François Raskin
  On delay and regret determinization of max-plus automata (LICS 2017) More Information...
• Paper: Luc Dartois Emmanuel Filiot Nathan Lhote
  Logics for Word Transductions with Synthesis (LICS 2018) More Information...
• Paper: Nathan Lhote
  Pebble Minimization of Polyregular Functions (LICS 2020) More Information...

Xin Li

• Paper: Naoki Kobayashi Xin Li
  Automata-Based Abstraction Refinement for μHORS Model Checking (LICS 2015) More Information...

Jian-Qi Li

• Short Presentation: Jian-Qi Li
  A Computability Path Ordering for Polymorphic Terms (LICS 2010) More Information...

Yangjia Li

• Short Presentation: Yangjia Li Nengkun Yu Mingsheng Ying
  Termination of Nondeterministic Quantum Programs (LICS 2012) More Information...

Chuck Liang

• Paper: Chuck Liang Dale A. Miller
  A Unified Sequent Calculus for Focused Proofs (LICS 2009) More Information...
• Paper: Chuck Liang Dale A. Miller
  Unifying Classical and Intuitionistic Logics for Computational Control (LICS 2013) More Information...
• Paper: Chuck Liang
  Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics (LICS 2016) More Information...

Hongjin Liang

• Paper: Hongjin Liang Xinyu Feng Zhong Shao
  Compositional verification of termination-preserving refinement of concurrent programs (LICS 2014) More Information...

Leonid Libkin

• Paper: Michael Benedikt Leonid Libkin
  On the Structure of Queries in Constraint Query Languages (LICS 1996) More Information...
• Paper: Leonid Libkin
  On the Forms of Locality over Finite Models (LICS 1997) More Information...
• Paper: Leonid Libkin
  On Counting Logics and Local Properties (LICS 1998) More Information...
• Paper: Lauri Hella Leonid Libkin Juha Nurmonen Limsoon Wong
  Logics with Aggregate Operators (LICS 1999) More Information...
• Paper: Leonid Libkin
  Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries (LICS 1999) More Information...
• Paper: Michael Benedikt Leonid Libkin Thomas Schwentick Luc Segoufin
  A Model-Theoretic Approach to Regular String Relations (LICS 2001) More Information...
• Paper: Michael Benedikt Leonid Libkin
  Tree Extension Algebras: Logics, Automata, and Query Languages (LICS 2002) More Information...
• Paper: Leonid Libkin Frank Neven
  Logical Definability and Query Languages over Unranked Trees (LICS 2003) More Information...
• Short Presentation: Marcelo Arenas Pablo Barceló Leonid Libkin
  Game-based Notions of Locality (LICS 2003) More Information...
• Paper: Pablo Barceló Leonid Libkin
  Temporal Logics over Unranked Trees (LICS 2005) More Information...
• Paper: Rajeev Alur Marcelo Arenas Pablo Barceló Kousha Etessami Neil Immerman Leonid Libkin
  First-Order and Temporal Logics for Nested Words (LICS 2007) More Information...
• Paper: Pablo Barceló Diego Figueira Leonid Libkin
  Graph Logics with Rational Relations and the Generalized Intersection Problem (LICS 2012) More Information...
• Short Presentation: Pablo Barceló Leonid Libkin Miguel Romero
  Approximations of Conjunctive Queries (LICS 2012) More Information...
• Paper: Diego Figueira Leonid Libkin
  Pattern logics and auxiliary relations (LICS 2014) More Information...
• Paper: Diego Figueira Leonid Libkin
  Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (LICS 2015) More Information...

Daniel R. Licata

• Paper: Daniel R. Licata Noam Zeilberger Robert Harper
  Focusing on Binding and Computation (LICS 2008) More Information...
• Paper: Daniel R. Licata Michael Shulman
  Calculating the Fundamental Group of the Circle in Homotopy Type Theory (LICS 2013) More Information...
• Paper: Daniel R. Licata Eric Finster
  Eilenberg-MacLane spaces in homotopy type theory (LICS 2014) More Information...
• Paper: Daniel R. Licata Guillaume Brunerie
  A Cubical Approach to Synthetic Homotopy Theory (LICS 2015) More Information...
• Paper: Kuen-Bang Hou (Favonia) Eric Finster Daniel R. Licata Peter LeFanu Lumsdaine
  A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory (LICS 2016) More Information...
• Paper: Matthew Z. Weaver Daniel R. Licata
  A Constructive Model of Directed Univalence in Bicubical Sets (LICS 2020) More Information...

Yossi Lichtenstein

• Paper: Rob Gerth Michael Codish Yossi Lichtenstein Ehud Y. Shapiro
  Fully abstract denotational semantics for flat Concurrent Prolog (LICS 1988) More Information...

Orna Lichtenstein

• Paper: Eyal Harel Orna Lichtenstein Amir Pnueli
  Explicit clock temporal logic (LICS 1990) More Information...

Moritz Lichter

• Paper: Moritz Lichter Ilia Ponomarenko Pascal Schweitzer
  Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm (LICS 2019) More Information...

André Lieutier

• Paper: Abbas Edalat André Lieutier
  Domain Theory and Differential Caluculus (Functions of one variable) (LICS 2002) More Information...
• Paper: Mohammad-Javad Davari Abbas Edalat André Lieutier
  The convex hull of finitely generable subsets and its predicate transformer (LICS 2019) More Information...

Vladimir Lifschitz

• Invited Paper: Vladimir Lifschitz
  The mathematics of nonmonotonic reasoning (LICS 1989) More Information...

Anthony Widjaja Lin

• Paper: Stefan Göller Anthony Widjaja Lin
  The Complexity of Verifying Ground Tree Rewrite Systems (LICS 2011) More Information...

Shang-Wei Lin

• Paper: Ross Horne Ki Yung Ahn Shang-Wei Lin Alwen Tiu
  Quasi-Open Bisimilarity with Mismatch is Intuitionistic (LICS 2018) More Information...

Patrick Lincoln

• Paper: Patrick Lincoln Andre Scedrov Natarajan Shankar
  Linearizing intuitionistic implication (LICS 1991) More Information...
• Paper: Patrick Lincoln John C. Mitchell
  Operational aspects of linear lambda calculus (LICS 1992) More Information...
• Paper: Patrick Lincoln Natarajan Shankar
  Proof search in first-order linear logic and other cut-free sequent calculi (LICS 1994) More Information...
• Paper: Patrick Lincoln Natarajan Shankar Andre Scedrov
  Decision Problems For Second-Order Linear Logic (LICS 1995) More Information...

Steven Lindell

• Paper: Steven Lindell Scott Weinstein
  The Role of Decidability in First Order Separations over Classes of Finite Structures (LICS 2000) More Information...
• Short Presentation: Steven Lindell Iliano Cervesato
  The Dolev-Yaho Intruder is the Most Powerful Attacker (LICS 2001) More Information...
• Short Presentation: Steven Lindell
  Finite Visit Sequential Deterministic Tree Automata (LICS 2001) More Information...
• Short Presentation: Steven Lindell
  Linear-time algorithms for Monadic Logic (LICS 2003) More Information...

Bert Lindenhovius

• Paper: Chris Heunen Bert Lindenhovius
  Domains of Commutative C-Subalgebras (LICS 2015) More Information...
• Paper: Bert Lindenhovius Michael Mislove Vladimir Zamdzhiev
  Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams (LICS 2018) More Information...

Jiamou Liu

• Paper: Dietrich Kuske Jiamou Liu Markus Lohrey
  The Isomorphism Problem On Classes of Automatic Structures (LICS 2010) More Information...

Yongmei Liu

• Short Presentation: Murray Patterson Yongmei Liu Eugenia Ternovska Arvind Gupta
  Grounding for Model Expansion in k-Guarded Formulas (LICS 2006) More Information...

Ralph Loader

• Paper: Ralph Loader
  Linear logic, totality and full completeness (LICS 1994) More Information...

Kamal Lodaya

• Paper: Andreas Krebs Kamal Lodaya Paritosh K. Pandya Howard Straubing
  Two-variable Logic with a Between Relation (LICS 2016) More Information...

Christof Löding

• Paper: Thomas Colcombet Christof Löding
  Regular Cost Functions over Finite Trees (LICS 2010) More Information...
• Paper: Arnaud Carayol Christof Löding Olivier Serre
  Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings (LICS 2016) More Information...

Alexey Loginov

• Paper: Thomas W. Reps Alexey Loginov Shmuel Sagiv
  Semantic Minimization of 3-Valued Propositional Formulae (LICS 2002) More Information...

Peter Lohmann

• Paper: Juha Kontinen Antti Kuusisto Peter Lohmann Jonni Virtema
  Complexity of Two-Variable Dependence Logic and IF-Logic (LICS 2011) More Information...

Markus Lohrey

• Paper: Markus Lohrey
  Model-Checking Hierarchical Structures (LICS 2005) More Information...
• Paper: Dietrich Kuske Markus Lohrey
  Monadic chain logic over iterations and applications to pushdown systems (LICS 2006) More Information...
• Paper: Dietrich Kuske Jiamou Liu Markus Lohrey
  The Isomorphism Problem On Classes of Automatic Structures (LICS 2010) More Information...
• Paper: Stefan Göller Jean Christoph Jung Markus Lohrey
  The Complexity of Decomposing Modal and First-Order Theories (LICS 2012) More Information...
• Paper: Christoph Haase Stefan Kiefer Markus Lohrey
  Computing quantiles in Markov chains with multi-dimensional costs (LICS 2017) More Information...

Veronika Loitzenbauer

• Paper: Krishnendu Chatterjee Monika Henzinger Veronika Loitzenbauer
  Improved Algorithms for One-Pair and k-Pair Streett Objectives (LICS 2015) More Information...
• Paper: Krishnendu Chatterjee Wolfgang Dvorák Monika Henzinger Veronika Loitzenbauer
  Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction (LICS 2016) More Information...

Daniel Lokshtanov

• Paper: Jakub Gajarský Petr Hlinený Jan Obdrzálek Daniel Lokshtanov M. S. Ramanujan
  A New Perspective on FO Model Checking of Dense Graph Classes (LICS 2016) More Information...

David E. Long

• Paper: Soumitra Bose Edmund M. Clarke David E. Long Spiro Michaylov
  PARTHENON: a parallel theorem prover for non-Horn clauses (LICS 1989) More Information...
• Paper: Edmund M. Clarke David E. Long Kenneth L. McMillan
  Compositional model checking (LICS 1989) More Information...
• Paper: Patrice Godefroid David E. Long
  Symbolic Protocol Verification with Queue BDDs (LICS 1996) More Information...

Giuseppe Longo

• Paper: Roberto M. Amadio Kim B. Bruce Giuseppe Longo
  The Finitary Projection Model for Second Order Lambda Calculus and Solutions to Higher Order Domain Equations (LICS 1986) More Information...
• Paper: Kim B. Bruce Giuseppe Longo
  A modest model of records, inheritance and bounded quantification (LICS 1988) More Information...
• Paper: Giuseppe Longo Kathleen Milsted Sergei Soloviev
  The genericity theorem and the notion of parametricity in the polymorphic λ-calculus (LICS 1993) More Information...
• Paper: Giuseppe Longo Kathleen Milsted Sergei Soloviev
  A logic of subtyping (LICS 1995) More Information...

Sarah M. Loos

• Paper: Sarah M. Loos André Platzer
  Differential Refinement Logic (LICS 2016) More Information...

Katja Losemann

• Paper: Katja Losemann Wim Martens
  MSO queries on trees: enumerating answers under updates (LICS 2014) More Information...

Cynthia Loten

• Paper: Benoit Larose Cynthia Loten Claude Tardif
  A Characterisation of First-Order Constraint Satisfaction Problems (LICS 2006) More Information...

Donald W. Loveland

• Paper: Gopalan Nadathur Donald W. Loveland
  Uniform proofs and disjunctive logic programming (LICS 1995) More Information...

Étienne Lozes

• Paper: Daniel Hirschkoff Étienne Lozes Davide Sangiorgi
  Separability, expressiveness, and decidability in the Ambient Logic (LICS 2002) More Information...

Eliezer L. Lozinskii

• Paper: Michael Kifer Eliezer L. Lozinskii
  RI: a logic for reasoning with inconsistency (LICS 1989) More Information...

Yuan Lu

• Paper: Edmund M. Clarke Somesh Jha Yuan Lu Helmut Veith
  Tree-like Counterexamples in Model Checking (LICS 2002) More Information...

Robert S. Lubarsky

• Paper: Robert S. Lubarsky
  μ-definable sets of integers (LICS 1989) More Information...
• Paper: Nathanael Leedom Ackerman Cameron E. Freer Robert S. Lubarsky
  Feedback Turing Computability, and Turing Computability as Feedback (LICS 2015) More Information...

Thomas Lukasiewicz

• Invited Paper: Andrea Calì Georg Gottlob Thomas Lukasiewicz Bruno Marnette Andreas Pieris
  Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications (LICS 2010) More Information...

Peter LeFanu Lumsdaine

• Paper: Kuen-Bang Hou (Favonia) Eric Finster Daniel R. Licata Peter LeFanu Lumsdaine
  A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory (LICS 2016) More Information...

Zhaohui Luo

• Paper: Zhaohui Luo
  ECC, an extended calculus of constructions (LICS 1989) More Information...

Haifeng Luo

• Paper: Yang Cai Ting Zhang Haifeng Luo
  An Improved Lower Bound for the Complementation of Rabin Automata (LICS 2009) More Information...

Kerkko Luosto

• Paper: Lauri Hella Phokion G. Kolaitis Kerkko Luosto
  How to define a linear order on finite models (LICS 1994) More Information...
• Paper: Kerkko Luosto
  Equicardinality on Linear Orders (LICS 2004) More Information...

Carsten Lutz

• Paper: Antti Kuusisto Carsten Lutz
  Weighted model counting beyond two-variable logic (LICS 2018) More Information...
• Paper: Pablo Barceló Cristina Feier Carsten Lutz Andreas Pieris
  When is Ontology-Mediated Querying Efficient? 1-13 Willem B (LICS 2019) More Information...

Inês Lynce

• Short Presentation: Inês Lynce João P. Marques-Silva
  Integrating Simplification Techniques in SAT Algorithms (LICS 2001) More Information...

James F. Lynch

• Paper: James F. Lynch
  Infinitary logics and very sparse random graphs (LICS 1993) More Information...
• Paper: James F. Lynch Jerzy Tyszkiewicz
  The Infinitary Logic of Sparse Random Graphs (LICS 1995) More Information...
• Paper: James F. Lynch
  Convergence Law for Random Graphs with Specified Degree Sequence (LICS 2003) More Information...
• Short Presentation: James F. Lynch
  A Proposal to Extend Abstract State Machines to Applications in Systems Biology (LICS 2003) More Information...
• Paper: James F. Lynch
  A Logical Characterization of Individual-Based Models (LICS 2008) More Information...

Christopher Lynch

• Paper: Christopher Lynch
  Paramodulation without Duplication (LICS 1995) More Information...
• Short Presentation: Christopher Lynch Christelle Scharff
  Basic Completion Modulo with Simplification (LICS 2001) More Information...
• Paper: Christopher Lynch Barbara Morawska
  Automatic Decidability (LICS 2002) More Information...

Nancy A. Lynch

• Paper: Kenneth J. Goldman Nancy A. Lynch
  Modelling shared state in a shared action model (LICS 1990) More Information...
• Invited Paper: Nancy A. Lynch
  Timed and Probabilistic I/O Automata (LICS 2013) More Information...