Logic in Computer Science (LICS 1997)

On this page:

• Invited Speakers
• Presented Papers
• Organisers

Invited Speakers

• Hubert Comon:
  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 Reif 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...
• P. Baillot V. Danos T. Ehrhard L. Regnier:
  Believe it or not, AJM's games model is a model of classical linear logicMore Information...
• Richard Blute Josee Desharnais Abbas Edalat Prakash Panangaden:
  Bisimulation for Labelled Markov ProcessesMore Information...
• A. Bouhoula J.-P. 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 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...
• S. Dziembowski M. Jurdzinski I. Walukiewicz:
  How much memory is needed to win infinite games?More Information...
• Martin Hotzel Escardo 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 Fiore Gordon Plotkin John Power:
  Complete Cuboidal Sets in Axiomatic Domain TheoryMore Information...
• Jean Goubault-Larrecq:
  Ramified Higher-Order UnificationMore Information...
• Erich Graedel 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 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 Kwiatkowska:
  Quantitative Analysis and Model CheckingMore Information...
• David Janin:
  Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete latticesMore Information...
• Max Kanovich Takayasu Ito:
  Temporal Linear Logic Specifications for Concurrent ProcessesMore Information...
• Naoki Kobayashi:
  A Partially Deadlock-free Typed Process CalculusMore Information...
• Dexter 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 McDowell Dale 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 John Potts Abbas Edalat Martin Escardo:
  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 I. Walukiewicz:
  An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz TracesMore Information...
• Daniele Turi Gordon Plotkin:
  Towards a Mathematical Operational SemanticsMore Information...
• Sergei Vorobyov:
  The "Hardest" Natural Decidable TheoryMore Information...
• Guo-Qiang Zhang William C. Rounds:
  Complexity of Power Default ReasoningMore Information...

Organizers

General Chair Moshe Y. Vardi (Rice University) Program Chair Glynn Winskel (University of Aarhus) Conference Chair Jerzy Tiuryn (Warsaw University) Publicity Chair Leonid Libkin (AT&T Bell Laboratories)

Program Committee: Jon Barwise (Indiana University); David Basin (Freiburg University); Steven Brookes (CMU); Pierre-Louis Curien (ENS, Paris); Anuj Dawar (Swansea University); Peter Dybjer (Chalmers University); Amy Felty (AT&T); Matthew Hennessy (Sussex University); Claude Kirchner (INRIA Lorraine); Jan Krajicek (Prague University); Pat Lincoln (SRI); Ken McMillan (Cadence Berkeley Labs); Damian Niwinski (Warsaw University); Jens Palsberg (Purdue University); Andrew Pitts (Cambridge University); Vaughan Pratt (Stanford University); Colin Stirling (Edinburgh University); Glynn Winskel (Aarhus University) (chair) Organizing Committee M. Abadi; S. Abramsky; S. Artemov; E. Boerger; A. Borodin; W. Brauer; A. Bundy; S. Buss; E. Clarke; R. Constable; A. Felty; U. Goltz; D. Howe; G. Huet; J.-P. Jouannaud; D. Kapur; C. Kirchner; P. Kolaitis; D. Kozen; T. Leighton; D. Leivant; A. R. Meyer; D. Miller; J. Mitchell; Y. Moschovakis; M. Okada; P. Panangaden; J. Remmel; J. Riecke; S. Ronchi della Rocca; A. Scedrov; D. Scott; J. Tiuryn; M. Y. Vardi