Lics

IEEE Symposium on Logic in Computer Science

On this page:

• Invited Speakers
• Invited Papers
• Presented Papers
• Organizers

Invited Speakers

• Thomas A. Henzinger
  The theory of hybrid automata
• Gérard Huet
  Design of a Proof Assistant
• André Joyal
  Lattices, Categories and Communication
• Robin Milner
  Calculi for Interactions
• Dana S. Scott
  Some reflections on logic and logicians

Invited Papers

• Thomas A. Henzinger
  The theory of hybrid automataMore Information...
• Gérard Huet
  Design of a Proof AssistantMore Information...
• André Joyal
  Lattices, Categories and CommunicationMore Information...
• Robin Milner
  Calculi for InteractionsMore Information...

Presented Papers

Entries are ordered by surname of first author

• Martín Abadi Marcelo P. Fiore
  Syntactic Considerations on Recursive TypesMore Information...
• Parosh A. Abdulla Karlis Cerans Bengt Jonsson Yih-Kuen Tsay
  General decidability theorems for infinite-state systemsMore Information...
• Thorsten Altenkirch Martin Hofmann Thomas Streicher
  Reduction-free normalisation for a polymorphic systemMore Information...
• Rajeev Alur Thomas A. Henzinger
  Reactive ModulesMore Information...
• Rajeev Alur Kenneth L. McMillan Doron A. Peled
  Model-checking of correctness conditions for concurrent objectsMore Information...
• David Aspinall Adriana B. Compagnoni
  Subtyping Dependent TypesMore Information...
• David A. Basin Harald Ganzinger
  Complexity Analysis Based on Ordered ResolutionMore Information...
• Michael Benedikt Leonid Libkin
  On the Structure of Queries in Constraint Query LanguagesMore Information...
• Nick Benton Philip Wadler
  Linear Logic, Monads and the Lambda CalculusMore Information...
• Inge Bethke Jan Willem Klop Roel C. de Vrijer
  Completing Partial Combinatory Algebras with Unique Head-Normal FormsMore Information...
• Girish Bhat Rance Cleaveland
  Efficient model checking via the equational mu-calculusMore Information...
• Stephen D. Brookes
  The Essence of Parallel AlgolMore Information...
• Gian Luca Cattani Vladimiro Sassone
  Higher Dimensional Transition SystemsMore Information...
• Iliano Cervesato Frank Pfenning
  A Linear Logical FrameworkMore Information...
• Vincent Danos Hugo Herbelin Laurent Regnier
  Game semantics and abstract machinesMore Information...
• Rowan Davies
  A temporal-logic approach to binding-time analysisMore Information...
• Anatoli Degtyarev Yuri Matiyasevich Andrei Voronkov
  Simultaneous Rigid E-Unification and Related Algorithmic ProblemsMore Information...
• Anatoli Degtyarev Andrei Voronkov
  Decidability Problems for the Prenex Fragment of Intuitionistic LogicMore Information...
• Abbas Edalat
  The Scott Topology Induces the Weak TopologyMore Information...
• Abbas Edalat Martín H. Escardó
  Integration in Real PCFMore Information...
• Kousha Etessami Thomas Wilke
  An Until Hierarchy for Temporal LogicMore Information...
• Marcelo P. Fiore Eugenio Moggi Davide Sangiorgi
  A Fully-Abstract Model for the pi-calculus (Extended Abstract)More Information...
• Patrice Godefroid David E. Long
  Symbolic Protocol Verification with Queue BDDsMore Information...
• Gerd G. Hillebrand Paris C. Kanellakis
  On the Expressive Power of Simply Typed and Let-Polymorphic Lambda CalculiMore Information...
• Tirza Hirst David Harel
  More about recursive structures: descriptive complexity and zero-one lawsMore Information...
• Phokion G. Kolaitis Moshe Y. Vardi
  On the expressive power of variable-confined logicsMore Information...
• Orna Kupferman Shmuel Safra Moshe Y. Vardi
  Relating word and tree automataMore Information...
• Jerzy Marcinkowski
  DATALOG SIRUPs uniform boundedness is undecidableMore Information...
• Victor W. Marek Anil Nerode Jeffrey B. Remmel
  On the Complexity of AbductionMore Information...
• Yuri Matiyasevich Géraud Sénizergues
  Decision Problems for Semi-Thue Systems with a Few RulesMore Information...
• David A. McAllester Robert Givan Carl Witty Dexter C. Kozen
  Tarskian Set ConstraintsMore Information...
• Gregory L. McColm
  Zero-one laws for Gilbert random graphsMore Information...
• Guy McCusker
  Games and Full Abstraction for FPCMore Information...
• J. Antonio Medina Neil Immerman
  A generalization of Fagin's theoremMore Information...
• César A. Munoz
  Confluence and Preservation of Strong Normalisation in an Explicit Substitutions CalculusMore Information...
• Paliath Narendran
  Solving linear equations over polynomial semiringsMore Information...
• Vaidhyanathan Natarajan Rance Cleaveland
  An Algebraic Theory of Process EfficiencyMore Information...
• Robert Nieuwenhuis
  Basic Paramodulation and Decidable TheoriesMore Information...
• Juha Nurmonen
  Counting Modulo Quantifiers on Finite Linearly Ordered TreesMore Information...
• C.-H. Luke Ong
  A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizationsMore Information...
• Andrew M. Pitts
  Reasoning about local variables with operationally-based logical relationsMore Information...
• Shekhar Pradhan
  Semantics of Normal Logic Programs and Contested InformationMore Information...
• Ramaswamys Ramanujam
  Locally linear time temporal logicMore Information...
• Helmut Seidl
  A Modal Mu-Calculus for Durational Transition SystemsMore Information...
• Peter Selinger
  Order-Incompleteness and Finite Lambda Models, Extended AbstractMore Information...
• Ian D. B. Stark
  A Fully Abstract Domain Model for the pi-CalculusMore Information...
• Jerzy Tiuryn Pawel Urzyczyn
  The Subtyping Problem for Second-Order Types is UndecidableMore Information...
• Bernard Willems Pierre Wolper
  Partial-Order Methods for Model Checking: From Linear Time to Branching TimeMore Information...

Organizers