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

• Stephen A. Cook
  Complexity Classes, Propositional Proof Systems, and Formal Theories
• Georg Gottlob
  Monadic Queries over Tree-Structured Data
• Maurizio Lenzerini
  Description Logics: Foundations for Class-based Knowledge Representation
• John C. Reynolds
  A Logic for Shared Mutable Data Structures
• Natarajan Shankar
  Little Engines of Proof

Invited Papers

• Diego Calvanese Giuseppe De Giacomo Maurizio Lenzerini
  Description Logics: Foundations for Class-based Knowledge RepresentationMore Information...
• Stephen A. Cook
  Complexity Classes, Propositional Proof Systems, and Formal TheoriesMore Information...
• Georg Gottlob Christoph Koch
  Monadic Queries over Tree-Structured DataMore Information...
• John C. Reynolds
  A Logic for Shared Mutable Data StructuresMore Information...
• Natarajan Shankar
  Little Engines of ProofMore Information...

Presented Papers

Entries are ordered by surname of first author

• Amal J. Ahmed Andrew W. Appel Roberto Virga
  A Stratified Semantics of General References Embeddable in Higher-Order LogicMore Information...
• Albert Atserias
  Unsatisfiable Random Formulas are Hard to CertifyMore Information...
• Michael Benedikt Leonid Libkin
  Tree Extension Algebras: Logics, Automata, and Query LanguagesMore Information...
• Edmund M. Clarke Somesh Jha Yuan Lu Helmut Veith
  Tree-like Counterexamples in Model CheckingMore Information...
• Josée Desharnais Vineet Gupta Radha Jagadeesan Prakash Panangaden
  The Metric Analogue of Weak Bisimulation for Probabilistic ProcessesMore Information...
• Catalin Dima
  Computing reachability relations in timed automataMore Information...
• Abbas Edalat André Lieutier
  Domain Theory and Differential Caluculus (Functions of one variable)More Information...
• Marco Faella Salvatore La Torre Aniello Murano
  Dense Real-time GamesMore Information...
• Marcelo P. Fiore Roberto Di Cosmo Vincent Balat
  Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum TypesMore Information...
• Markus Frick Martin Grohe
  The complexity of first-order and monadic second-order logic revisitedMore Information...
• Alain Frisch Giuseppe Castagna Véronique Benzaken
  Semantic subtypingMore Information...
• Nadeem A. Hamid Zhong Shao Valery Trifonov Stefan Monnier Zhaozhong Ni
  A Syntactic Approach to Foundational Proof-Carrying CodeMore Information...
• William Hesse Neil Immerman
  Complete problems for Dynamic Complexity ClassesMore Information...
• Daniel Hirschkoff Étienne Lozes Davide Sangiorgi
  Separability, expressiveness, and decidability in the Ambient LogicMore Information...
• Ian M. Hodkinson Frank Wolter Michael Zakharyaschev
  Decidable and undecidable fragments of first-order branching temporal logicsMore Information...
• Martin Hyland Andrea Schalk
  Games on Graphs and Sequentially Realizable FunctionalsMore Information...
• Hajime Ishihara Bakhadyr Khoussainov Sasha Rubin
  Some Results on Automatic StructuresMore Information...
• Alan Jeffrey Julian Rathke
  A fully abstract may testing semantics for concurrent objectsMore Information...
• Stephan Kreutzer
  Expressive Equivalence of Least and Inflationary Fixed-Point LogicMore Information...
• Sophie Laplante Richard Lassaigne Frédéric Magniez Sylvain Peyronnet Michel de Rougemont
  Probabilistic abstraction for model checking: An approach based on property testingMore Information...
• François Laroussinie Nicolas Markey Philippe Schnoebelen
  Temporal Logic with Forgettable PastMore Information...
• Olivier Laurent
  Polarized gamesMore Information...
• Jean-Marie Le Bars
  The 0-1 law fails for frame satisfiability of propositional modal logicMore Information...
• Daniel Leivant
  Calibrating computational feasibility by abstraction rankMore Information...
• Christopher Lynch Barbara Morawska
  Automatic DecidabilityMore Information...
• Mikkel Nygaard Glynn Winskel
  Linearity in Process LanguagesMore Information...
• C.-H. Luke Ong
  Observational equivalence of 3rd-order Idealized Algol is decidableMore Information...
• Martin Otto
  Modal and guarded characterisation theorems over finite transition systemsMore Information...
• Jens Palsberg Tian Zhao
  Efficient Type Inference for Record Concatenation and SubtypingMore Information...
• Thomas W. Reps Alexey Loginov Shmuel Sagiv
  Semantic Minimization of 3-Valued Propositional FormulaeMore Information...
• Bernhard Reus Thomas Streicher
  Semantics and Logic of Object CalculiMore Information...
• Alex K. Simpson
  Computational Adequacy for Recursive Types in Models of Intuitionistic Set TheoryMore Information...
• Michael Soltys Stephen A. Cook
  The Proof Complexity of Linear AlgebraMore Information...
• Richard Statman
  On the lambda Y calculusMore Information...
• Ashish Tiwari
  Deciding Confluence of Certain Term Rewriting Systems in Polynomial TimeMore Information...
• Daniele Varacca
  The powerdomain of indexed valuationsMore Information...

Short Presentations

Entries are ordered by surname of first author

• Emmanuel Beffara Sergei G. Vorobyov
  Is Randomized Gurvich-Karzanov-Khachiyan's Algorithm for Parity Games Polynomial?More Information...
• Henrik Björklund Sergei G. Vorobyov
  Two Adversary Lower Bounds for Parity GamesMore Information...
• Emanuele Covino Giovanni Pani
  Time-Space Computational Complexity of Imperative Programming LanguagesMore Information...
• Claudia Faggian
  Ludics Dynamics: Designs and Interactive ObservabilityMore Information...
• Jonathan Ford Ian A. Mason Natarajan Shankar
  Lessons Learned from Formal Developments in PVSMore Information...
• Jens C. Godskesen Thomas Hildebrandt Vladimiro Sassone
  An Overview of MR, a Calculus of Mobile ResourcesMore Information...
• Sylvain Soliman
  CLP Implementation of a Phase Model CheckerMore Information...

Organizers