Lics

IEEE Symposium on Logic in Computer Science

On this page:

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

Invited Speakers

• Albert Atserias
  A Why-on-Earth Tutorial on Finite Model Theory (tutorial)
• Naoki Kobayashi
  Higher-Order Model Checking: From Theory to Practice
• Andrei Krokhin
  The Complexity of Evaluating First-Order Sentences over a Fixed Structure
• Prakash Panangaden
  The Meaning of Semantics (tutorial)
• Toniann Pitassi
  Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results
• Ashish Tiwari
  Logic in Software, Dynamical and Biological Systems

Invited Papers

• Albert Atserias
  A Why-on-Earth Tutorial on Finite Model TheoryMore Information...
• Naoki Kobayashi
  Higher-Order Model Checking: From Theory to PracticeMore Information...
• Andrei A. Krokhin
  The Complexity of Evaluating First-Order Sentences over a Fixed StructureMore Information...
• Prakash Panangaden
  The Meaning of SemanticsMore Information...
• Toniann Pitassi
  Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent ResultsMore Information...
• Ashish Tiwari
  Logic in Software, Dynamical and Biological SystemsMore Information...

Presented Papers

Entries are ordered by surname of first author

• Parosh A. Abdulla Richard Mayr
  Computing Optimal Coverability Costs in Priced Timed Petri NetsMore Information...
• Nathanael Leedom Ackerman Cameron E. Freer Daniel M. Roy
  Noncomputable Conditional DistributionsMore Information...
• Benjamin Aminof Orna Kupferman Robby Lampert
  Rigorous Approximated Determinization of Weighted AutomataMore Information...
• Bruno Barras Jean-Pierre Jouannaud Pierre-Yves Strub Qian Wang
  CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order TheoryMore Information...
• Libor Barto
  The Dichotomy for Conservative Constraint Satisfaction Problems RevisitedMore Information...
• Michael Benedikt Gabriele Puppis Cristian Riveros
  Regular Repair of SpecificationsMore Information...
• Lars Birkedal Rasmus E. Møgelberg Jan Schwinghammer Kristian Støvring
  First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees More Information...
• Manuel Bodirsky Michael Pinsker Todor Tsankov
  Decidability of DefinabilityMore Information...
• Mikołaj Bojańczyk Bartek Klin Sławomir Lasota
  Automata with Group ActionsMore Information...
• Udi Boker Krishnendu Chatterjee Thomas A. Henzinger Orna Kupferman
  Temporal Specifications with Accumulative ValuesMore Information...
• Tomáš Brázdil Václav Brozek Krishnendu Chatterjee Vojtech Forejt Antonín Kučera
  Two Views on Multiple Mean-Payoff Objectives in Markov Decision ProcessesMore Information...
• Davide Bresolin Angelo Montanari Pietro Sala Guido Sciavicco
  What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBLMore Information...
• Arnaud Carayol Axel Haddad Olivier Serre
  Qualitative Tree LanguagesMore Information...
• Yijia Chen Jörg Flum
  Listings and LogicsMore Information...
• Martin Churchill James Laird Guy McCusker
  Imperative Programs as Proofs via Game SemanticsMore Information...
• Pierre Clairambault
  Isomorphisms of Types in the Presence of Higher-Order ReferencesMore Information...
• Ugo Dal Lago Marco Gaboardi
  Linear Dependent Types and Relative CompletenessMore Information...
• Thomas Ehrhard Michele Pagani Christine Tasson
  The Computational Meaning of Probabilistic Coherence SpacesMore Information...
• Diego Figueira Santiago Figueira Sylvain Schmitz Philippe Schnoebelen
  Ackermannian and Primitive-Recursive Bounds with Dickson's LemmaMore Information...
• Diego Figueira
  A Decidable Two-Way Logic on Data WordsMore Information...
• Stefan Göller Anthony Widjaja Lin
  The Complexity of Verifying Ground Tree Rewrite SystemsMore Information...
• Sergey Goncharov Lutz Schröder
  Powermonads and Tensors of Unranked EffectsMore Information...
• Jean Goubault-Larrecq Daniele Varacca
  Continuous Random VariablesMore Information...
• Ichiro Hasuo Naohiko Hoshino
  Semantics of Higher-Order Quantum Computation via Geometry of InteractionMore Information...
• Willem Heijltjes
  Proof Nets for Additive Linear Logic with UnitsMore Information...
• Christian Herrmann Martin Ziegler
  Computational Complexity of Quantum SatisfiabilityMore Information...
• Chung-Kil Hur Derek Dreyer Viktor Vafeiadis
  Separation Logic in the Presence of Garbage CollectionMore Information...
• Juha Kontinen Antti Kuusisto Peter Lohmann Jonni Virtema
  Complexity of Two-Variable Dependence Logic and IF-LogicMore Information...
• Neelakantan R. Krishnaswami Nick Benton
  Ultrametric Semantics of Reactive ProgramsMore Information...
• Manfred Kufleitner Alexander Lauser
  Languages of Dot-Depth One over Infinite WordsMore Information...
• Dai Tri Man Le Stephen A. Cook
  Formalizing Randomized Matching AlgorithmsMore Information...
• Florent R. Madelaine Barnaby Martin
  A Tetrachotomy for Positive First-Order Logic without EqualityMore Information...
• Jerzy Marcinkowski Jakub Michaliszyn
  The Ultimate Undecidability Result for the Halpern-Shoham LogicMore Information...
• Jean-Yves Marion
  A Type System for Complexity Flow AnalysisMore Information...
• Alexandre Miquel
  Forcing as a Program TransformationMore Information...
• Andrzej S. Murawski Nikos Tzevelekos
  Game Semantics for Good General ReferencesMore Information...
• Silvain Rideau Glynn Winskel
  Concurrent StrategiesMore Information...

Short Presentations

Entries are ordered by surname of first author

• Nathanael Leedom Ackerman Cameron E. Freer Daniel M. Roy
  #P-complete conditional distributionsMore Information...
• Yang Cai Ting Zhang
  Can Nondeterminism Help Complementation?More Information...
• Fabien Givors Gregory Lafitte
  Holes Punched ComputabilitiesMore Information...
• Charles Jordan Thomas Zeugmann
  Recent Progress in the Classification for TestabilityMore Information...
• Eric Jui-Yi Kao Michael Genesereth
  Achieving cut, deduction, and other properties with a variation on quasi-classical logicMore Information...
• Andrzej S. Murawski Nikos Tzevelekos
  Algorithmic nominal game semanticsMore Information...
• Sam Sanders
  Computing the InfiniteMore Information...
• Kohei Suenaga Ichiro Hasuo
  Programming with Infinitesi- mals: A WHILE-Language for Hybrid System ModelingMore Information...
• Guo-Qiang Zhang Xiangnan Zhou Robert Fraser Licong Cui
  Concatenation and Kleene Star on Deterministic Finite AutomataMore Information...

Organizers