• L
  • LICS
  • 2002
  • 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02)
Advanced Search 
17th Annual IEEE Symposium on Logic in Computer Science (LICS'02)
Copenhagen, Denmark
July 22-July 25
ISBN: 0-7695-1483-9
Table of Contents
Introduction
FLoC Joint Invited Lecture
Session 1
Session 2
Edmund Clarke, Carnegie Mellon University
Somesh Jha, University of Wisconsin
Yuan Lu, Broadcom COM
Helmut Veith, Technische Universität Wien
pp. 19
Session 3
Session 4
Session 5
Semantic Subtyping (Abstract)
Alain Frisch, École Normale Supérieure
Giuseppe Castagna, École Normale Supérieure
Véronique Benzaken, Université Paris-Sud
pp. 137
Marcelo Fiore, University of Cambridge
Roberto Di Cosmo, Université Paris 7 and INRIA-Roquencourt
Vincent Balat, Université Paris 7
pp. 147
Session 6
Marco Faella, Università degli Studi di Salerno
Salvatore La Torre, Università degli Studi di Salerno and University of Pennsylvania
Aniello Murano, Università degli Studi di Salerno and Rice University
pp. 167
Session 7
Georg Gottlob, Technische Universität Wien
Christoph Koch, Technische Universität Wien
pp. 189
Session 8
Hajime Ishihara, Japan Advanced Institute of Science and Technology
Bakhadyr Khoussainov, University of Auckland
Sasha Rubin, University of Auckland
pp. 235
Session 9
Session 10
Daniele Varacca, University of Aarhus and University of Cambridge
pp. 299
Session 11
William Hesse, University of Massachusetts at Amherst
Neil Immerman, University of Massachusetts at Amherst
pp. 313
Session 12
Short Presentations
Lessons Learned from Formal Developments in PVS
CLP Implementation of a Phase Model Checker
An Overview of MR, a Calculus of Mobile Resources
Ludics Dynamics: Designs and Interactive Observability
Session 14
Diego Calvanese, Università di Roma "La Sapienza"
Giuseppe De Giacomo, Università di Roma "La Sapienza"
Maurizio Lenzerini, Università di Roma "La Sapienza"
pp. 359
Session 15
François Laroussinie, ENS de Cachan & CNRS UMR
Nicolas Markey, ENS de Cachan & CNRS UMR and Université Orléans & CNRS
Philippe Schnoebelen, ENS de Cachan & CNRS UMR
pp. 383
Session 16
Session 17
Two Adversary Lower Bounds for Parity Games
Is Randomized Gurvich-Karzanov-Khachiyan's Algorithm for Parity Games Polynomial?
Time-Space Computational Complexity of Imperative Programming Languages
Author Index
Usage of this product signifies your acceptance of the Terms of Use.