LICS 2002 Accepted Papers

4 On the lambda Y calculus Richard Statman
6 The Proof Complexity of Linear Algebra Michael Soltys and Stephen Cook
10 Modal and guarded characterisation theorems over finite transition systems Martin Otto
11 Decidable and undecidable fragments of first-order branching temporal logics Ian Hodkinson Frank Wolter Michael Zakharyaschev
15 Calibrating computational feasibility by abstraction rank Daniel Leivant
18 Games on Graphs and Sequentially Realizable Functionals Martin Hyland, Andrea Schalk
20 Semantic Minimization of 3-Valued Propositional Formulae Thomas Reps, Alexey Loginov, and Mooly Sagiv
22 Efficient Type Inference for Record Concatenation and Subtyping Jens Palsberg and Tian Zhao
25 Polarized games Olivier LAURENT
35 The 0-1 law fails for frame satisfiability of propositional modal logic Le Bars Jean-Marie
37 The powerdomain of indexed valuations Daniele Varacca
43 On Isomorphism Invariants of Some Automatic Structures Hajime Ishihara, Bakhadyr Khoussainov, and Sasha Rubin
53 Expressive Equivalence of Least and Inflationary Fixed-Point Logic Stephan Kreutzer
55 Linearity in Distributed Computation Mikkel Nygaard Hansen Glynn Winskel
65 A fully abstract may testing semantics for concurrent objects Alan Jeffrey and Julian Rathke
66 Unsatisfiable Random Formulas are Hard to Certify Albert Atserias
69 Semantic subtyping Alain Frisch Giuseppe Castagna Véronique Benzaken
74 The complexity of first-order and monadic second-order logic revisited Markus Frick and Martin Grohe
84 Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types Marcelo Fiore, Roberto Di Cosmo, and Vincent Balat
85 Semantics and Logic of Object Calculi Bernhard Reus and Thomas Streicher
87 Probabilistic abstraction for model checking: An approach based on property testing Sophie Laplante, Richard Lassaigne, Frederic Magniez, Sylvain Peyronnet, Michel de Rougemont
89 Dense Real-time Games Marco Faella, Salvatore La Torre, and Aniello Murano
91 Separability, expressiveness, and decidability in the Ambient Logic Daniel Hirschkoff, Etienne Lozes, Davide Sangiorgi
95 A Syntactic Approach to Foundational Proof-Carrying Code Nadeem A. Hamid, Zhong Shao, Valery Trifonov, Stefan Monnier, Zhaozhong Ni
97 Tree Extension Algebras: Logics, Automata, and Query Languages Michael Benedikt, Leonid Libkin
98 The Metric Analogue of Weak Bisimulation for Probabilistic Processes Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
99 Computing reachability relations in timed automata Catalin Dima
104 Observational equivalence of 3rd-order Idealized Algol is decidable C.-H. L. Ong
110 Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory Alex Simpson
111 Temporal Logic with Forgettable Past F. Laroussinie N. Markey Ph. Schnoebelen
120 DomainTheory and Differential Caluculus (Functions of one variable) Abbas Edalat and Andre Lieutier
123 A Stratified Semantics of General References Embeddable in Higher-Order Logic Amal J. Ahmed, Andrew W. Appel, Roberto Virga
124 Tree-like Counterexamples in Model Checking Edmund Clarke, Somesh Jha, Yuan Lu, Helmut Veith
125 Automatic Decidability Christopher Lynch and Barbara Morawska
129 Polynomial time Algorithms for Deciding Confluence of Certain Term Rewrite Systems Ashish Tiwari
130 Complete problems for Dynamic Complexity Classes William Hesse and Neil Immerman

Server START Conference Manager
Update Time 15 Mar 2002 at 15:30:31
Start Conference Manager
Conference Systems