Lics

IEEE Symposium on Logic in Computer Science

On this page:

• Link to Web Page
• Invited Speakers
• Invited Papers
• Presented Papers
• Organizers

Invited Speakers

• Luca Cardelli
  A Theory of Objects
• Hubert Comon-Lundh
  Applications of Tree Automata in Rewriting and Lambda Calculus
• Anita Feferman
  The Saga of Alfred Tarski: From Warszawa to Berkeley
• David A. McAllester
  Methods of Automated Complexity for Inference Rules
• Leszek Pacholski
  Set Constraints

Invited Papers

• Hubert Comon-Lundh
  Applications of Tree Automata in Rewriting and Lambda CalculusMore Information...
• Anita Feferman
  The Saga of Alfred Tarski: From Warszawa to BerkeleyMore Information...
• David A. McAllester
  Methods of Automated Complexity for Inference RulesMore Information...
• Leszek Pacholski
  Set ConstraintsMore Information...

Presented Papers

Entries are ordered by surname of first author

• Henrik R. Andersen Henrik Hulgaard
  Boolean Expression DiagramsMore Information...
• Eugene Asarin Paul Caspi Oded Maler
  A Kleene theorem for timed automataMore Information...
• Franz Baader
  Combination of Compatible Reduction Orderings that are Total on Ground TermsMore Information...
• Patrick Baillot Vincent Danos Thomas Ehrhard Laurent Regnier
  Believe it or not, AJM's games model is a model of classical linear logicMore Information...
• Richard Blute Josée Desharnais Abbas Edalat Prakash Panangaden
  Bisimulation for Labelled Markov ProcessesMore Information...
• Adel Bouhoula Jean-Pierre Jouannaud
  Automata-driven automated inductionMore Information...
• Iliano Cervesato Frank Pfenning
  Linear higher-order pre-unificationMore Information...
• Witold Charatonik Andreas Podelski
  Set constraints with intersectionMore Information...
• Hubert Comon-Lundh Florent Jacquemard
  Ground Reducibility is EXPTIME-completeMore Information...
• Mariangiola Dezani-Ciancaglini Jerzy Tiuryn Pawel Urzyczyn
  Discrimination by Parallel ObserversMore Information...
• Roberto Di Cosmo Delia Kesner
  Strong Normalization of Explicit Substitutions via Cut Elimination in Proof NetsMore Information...
• Stefan Dziembowski Marcin Jurdzinski Igor Walukiewicz
  How much memory is needed to win infinite games?More Information...
• Martín H. Escardó Thomas Streicher
  Induction and recursion on the partial real line via biquotients of bifree algebrasMore Information...
• Kousha Etessami Moshe Y. Vardi Thomas Wilke
  First-Order Logic with Two Variables and Unary Temporal LogicMore Information...
• Marcelo P. Fiore Gordon D. Plotkin A. John Power
  Complete Cuboidal Sets in Axiomatic Domain TheoryMore Information...
• Jean Goubault-Larrecq
  Ramified Higher-Order UnificationMore Information...
• Erich Grädel Martin Otto Eric Rosen
  Two-variable logic with counting is decidableMore Information...
• Martin Grohe
  Large finite structures with few L^k-typesMore Information...
• Nevin Heintze David A. McAllester
  On the Cubic Bottleneck in Subtyping and Flow AnalysisMore Information...
• Fritz Henglein Jakob Rehof
  The complexity of subtype entailment for simple typesMore Information...
• Martin Hofmann Thomas Streicher
  Continuation models are universal for lambda-mu-calculusMore Information...
• Dominic J. D. Hughes
  Games and Definability for System FMore Information...
• Michael Huth Marta Z. Kwiatkowska
  Quantitative Analysis and Model CheckingMore Information...
• David Janin
  Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete latticesMore Information...
• Max I. Kanovich Takayasu Ito
  Temporal Linear Logic Specifications for Concurrent ProcessesMore Information...
• Naoki Kobayashi
  A Partially Deadlock-free Typed Process CalculusMore Information...
• Dexter C. Kozen
  On the Complexity of Reasoning in Kleene AlgebraMore Information...
• James Laird
  Full abstraction for functional languages with controlMore Information...
• Leonid Libkin
  On the Forms of Locality over Finite ModelsMore Information...
• Oliver Matz Wolfgang Thomas
  The Monadic Quantifier Alternation Hierarchy over Graphs is InfiniteMore Information...
• Raymond C. McDowell Dale A. Miller
  A Logic for Reasoning with Higher-Order Abstract SyntaxMore Information...
• Leszek Pacholski Wieslaw Szwast Lidia Tendera
  Complexity of Two-Variable Logic with CountingMore Information...
• Peter J. Potts Abbas Edalat Martín H. Escardó
  Semantics of Exact Real ArithmeticMore Information...
• Julian Rathke
  Unique Fixpoint Induction for Value-Passing ProcessesMore Information...
• Jon G. Riecke Anders Sandholm
  A Relational Account of Call-by-Value SequentiallyMore Information...
• P. S. Thiagarajan Igor Walukiewicz
  An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz TracesMore Information...
• Daniele Turi Gordon D. Plotkin
  Towards a Mathematical Operational SemanticsMore Information...
• Sergei G. Vorobyov
  The "Hardest" Natural Decidable TheoryMore Information...
• Guo-Qiang Zhang William C. Rounds
  Complexity of Power Default ReasoningMore Information...

Organizers