LICS A*

40 papers

YearTitle / Authors
200015th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000
2000A Complete Axiomatization of Interval Temporal Logic with Infinite Time.
Ben C. Moszkowski
2000A Decision Procedure for Term Algebras with Queues.
Tatiana Rybina, Andrei Voronkov
2000A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering.
Konstantin Korovin, Andrei Voronkov
2000A General Notion of Realizability.
Lars Birkedal
2000A Modality for Recursion.
Hiroshi Nakano
2000A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping.
Alexandre Miquel
2000A Static Calculus of Dependencies for the lambda-Cube.
Frédéric Prost
2000A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation.
Klaus Aehlig, Helmut Schwichtenberg
2000A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names.
Alan Jeffrey, Julian Rathke
2000Approximate Pattern Matching is Expressible in Transitive Closure Logic.
Kjell Lemström, Lauri Hella
2000Approximating Labeled Markov Processes.
Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
2000Assigning Types to Processes.
Nobuko Yoshida, Matthew Hennessy
2000Automatic Structures.
Achim Blumensath, Erich Grädel
2000Back and Forth between Guarded and Modal Logics.
Erich Grädel, Colin Hirsch, Martin Otto
2000Better is Better than Well: On Efficient Verification of Infinite-State Systems.
Parosh Aziz Abdulla, Aletta Nylén
2000Complete Axioms for Categorical Fixed-Point Operators.
Alex K. Simpson, Gordon D. Plotkin
2000Computational Complexity of Some Problems Involving Congruences on Algebras.
Clifford Bergman, Giora Slutzki
2000Concurrent Omega-Regular Games.
Luca de Alfaro, Thomas A. Henzinger
2000Definability and Compression.
Foto N. Afrati, Hans Leiß, Michel de Rougemont
2000Dominator Trees and Fast Verification of Proof Nets.
Andrzej S. Murawski, C.-H. Luke Ong
2000Efficient and Flexible Matching of Recursive Types.
Jens Palsberg, Tian Zhao
2000From the Church-Turing Thesis to the First-Order Algorithm Theorem.
Saul Kripke
2000Game Semantics and Subtyping.
Juliusz Chroboczek
2000How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent Calculi.
Andrei Voronkov
2000Imperative Programming with Dependent Types.
Hongwei Xi
2000Logic, Complexity, and Games.
Ronald Fagin
2000Models for Name-Passing Processes: Interleaving and Causal.
Gian Luca Cattani, Peter Sewell
2000More Past Glories.
Mark Reynolds
2000On First-Order Topological Queries.
Martin Grohe, Luc Segoufin
2000Paramodulation with Built-in Abelian Groups.
Guillem Godoy, Robert Nieuwenhuis
2000Precongruence Formats for Decorated Trace Preorders.
Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek
2000Probabilistic Game Semantics.
Vincent Danos, Russell Harmer
2000Resource-Bounded Continuity and Sequentiality for Type-Two Functionals.
Samuel R. Buss, Bruce M. Kapron
2000Satisfiability Testing: Recent Developments and Challenge Problems.
Bart Selman
2000Some Strategies for Proving Theorems with a Model Checker.
Kenneth L. McMillan
2000The Curry-Howard Correspondence in Set Theory.
Jean-Louis Krivine
2000The Role of Decidability in First Order Separations over Classes of Finite Structures.
Steven Lindell, Scott Weinstein
2000View-Based Query Processing and Constraint Satisfaction.
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi
2000Virtual Symmetry Reduction.
E. Allen Emerson, John Havlicek, Richard J. Trefler