Join Us
Sign In
My Subscriptions
Magazines
Journals
Video Library
Conference Proceedings
Individual CSDL Subscriptions
Institutional CSDL Subscriptions
Resources
Career Center
Tech News
Resource Center
Press Room
Advertising
Librarian Resources
IEEE.org
Help
About Us
Career Center
Cart
Create Account
Sign In
Toggle navigation
My Subscriptions
Browse Content
Resources
All
Home
Proceedings
LICS
LICS 2002
Generate Citations
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science
July 22 2002 to July 25 2002
Copenhagen, Denmark
Table of Contents
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science
Freely available from IEEE.
Introduction
Foreword
Freely available from IEEE.
pp. ix
Introduction
Conference Organisers
Freely available from IEEE.
pp. x
Introduction
Programme Committee
Freely available from IEEE.
pp. xi
Introduction
Additional Reviewers
Freely available from IEEE.
pp. xii
FLoC Joint Invited Lecture
Little Engines of Proof
Full-text access may be available. Sign in or learn about subscription options.
pp. 3
by
Natarajan Shankar
Session 1
Automatic Decidability
Full-text access may be available. Sign in or learn about subscription options.
pp. 7
by
Christopher Lynch
,
Barbara Morawska
Session 2
Tree-Like Counterexamples in Model Checking
Full-text access may be available. Sign in or learn about subscription options.
pp. 19
by
Edmund Clarke
,
Somesh Jha
,
Yuan Lu
,
Helmut Veith
Session 2
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
Full-text access may be available. Sign in or learn about subscription options.
pp. 30
by
Sophie Laplante
,
Richard Lassaigne
,
Frédéric Magniez
,
Sylvain Peyronnet
,
Michel de Rougemont
Session 2
Semantic Minimization of 3-Valued Propositional Formulae
Full-text access may be available. Sign in or learn about subscription options.
pp. 40
by
Thomas Reps
,
Alexey Loginov
,
Mooly Sagiv
Session 3
Separation Logic: A Logic for Shared Mutable Data Structures
Full-text access may be available. Sign in or learn about subscription options.
pp. 55
by
John C. Reynolds
Session 3
A Stratified Semantics of General References Embeddable in Higher-Order Logic
Full-text access may be available. Sign in or learn about subscription options.
pp. 75
by
Amal J. Ahmed
,
Andrew W. Appel
,
Roberto Virga
Session 4
A Syntactic Approach to Foundational Proof-Carrying Code
Full-text access may be available. Sign in or learn about subscription options.
pp. 89
by
Nadeem A. Hamid
,
Zhong Shao
,
Valery Trifonov
,
Stefan Monnier
,
Zhaozhong Ni
Session 4
A Fully Abstract May Testing Semantics for Concurrent Objects
Full-text access may be available. Sign in or learn about subscription options.
pp. 101
by
Alan Jeffrey
,
Julian Rathke
Session 4
Semantics and Logic of Object Calculi
Full-text access may be available. Sign in or learn about subscription options.
pp. 113
by
Bernhard Reus
,
Thomas Streicher
Session 5
Efficient Type Inference for Record Concatenation and Subtyping
Full-text access may be available. Sign in or learn about subscription options.
pp. 125
by
Jens Palsberg
,
Tian Zhao
Session 5
Semantic Subtyping
Full-text access may be available. Sign in or learn about subscription options.
pp. 137
by
Alain Frisch
,
Giuseppe Castagna
,
Véronique Benzaken
Session 5
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types
Full-text access may be available. Sign in or learn about subscription options.
pp. 147
by
Marcelo Fiore
,
Roberto Di Cosmo
,
Vincent Balat
Session 6
On The Lambda Y Calculus
Full-text access may be available. Sign in or learn about subscription options.
pp. 159
by
Rick Statman
Session 6
Dense Real-Time Games
Full-text access may be available. Sign in or learn about subscription options.
pp. 167
by
Marco Faella
,
Salvatore La Torre
,
Aniello Murano
Session 6
Computing Reachability Relations in Timed Automata
Full-text access may be available. Sign in or learn about subscription options.
pp. 177
by
Cătălin Dima
Session 7
Monadic Queries over Tree-Structured Data
Full-text access may be available. Sign in or learn about subscription options.
pp. 189
by
Georg Gottlob
,
Christoph Koch
Session 7
Tree Extension Algebras: Logics, Automata, and Query Languages
Full-text access may be available. Sign in or learn about subscription options.
pp. 203
by
Michael Benedikt
,
Leonid Libkin
Session 8
The Complexity of First-Order and Monadic Second-Order Logic Revisited
Full-text access may be available. Sign in or learn about subscription options.
pp. 215
by
Markus Frick
,
Martin Grohe
Session 8
The 0-1 law fails for frame satisfiability of propositional modal logic
Full-text access may be available. Sign in or learn about subscription options.
pp. 225
by
Jean-Marie Le Bars
Session 8
Some Results on Automatic Structures
Full-text access may be available. Sign in or learn about subscription options.
pp. 235
by
Hajime Ishihara
,
Bakhadyr Khoussainov
,
Sasha Rubin
Session 9
Observational Equivalence of 3rd-Order Idealized Algol is Decidable
Full-text access may be available. Sign in or learn about subscription options.
pp. 245
by
C.-H.L. Ong
Session 9
Games on Graphs and Sequentially Realizable Functionals Extended Abstract
Full-text access may be available. Sign in or learn about subscription options.
pp. 257
by
Martin Hyland
,
Andrea Schalk
Session 9
Polarized Games
Full-text access may be available. Sign in or learn about subscription options.
pp. 265
by
Olivier Laurent
Session 10
Domain Theory and Differential Calculus (Functions of one Variable)
Full-text access may be available. Sign in or learn about subscription options.
pp. 277
by
Abbas Edalat
,
André Lieutier
Session 10
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
Full-text access may be available. Sign in or learn about subscription options.
pp. 287
by
Alex Simpson
Session 10
The Powerdomain of Indexed Valuations
Full-text access may be available. Sign in or learn about subscription options.
pp. 299
by
Daniele Varacca
Session 11
Complexity Classes, Propositional Proof Systems, and Formal Theories
Full-text access may be available. Sign in or learn about subscription options.
pp. 311
by
Stephen A. Cook
Session 11
Complete Problems for Dynamic Complexity Classes
Full-text access may be available. Sign in or learn about subscription options.
pp. 313
by
William Hesse
,
Neil Immerman
Session 12
Unsatisfiable Random Formulas Are Hard to Certify
Full-text access may be available. Sign in or learn about subscription options.
pp. 325
by
Albert Atserias
Session 12
The Proof Complexity of Linear Algebra
Full-text access may be available. Sign in or learn about subscription options.
pp. 335
by
Michael Soltys
,
Stephen Cook
Session 12
Calibrating Computational Feasibility by Abstraction Rank
Full-text access may be available. Sign in or learn about subscription options.
pp. 345
by
Daniel Leivant
Session 14
Description Logics: Foundations for Class-based Knowledge Representation
Full-text access may be available. Sign in or learn about subscription options.
pp. 359
by
Diego Calvanese
,
Giuseppe De Giacomo
,
Maurizio Lenzerini
Session 14
Modal and Guarded Characterisation Theorems over Finite Transition Systems
Full-text access may be available. Sign in or learn about subscription options.
pp. 371
by
Martin Otto
Session 15
Temporal Logic with Forgettable Past
Full-text access may be available. Sign in or learn about subscription options.
pp. 383
by
François Laroussinie
,
Nicolas Markey
,
Philippe Schnoebelen
Session 15
Decidable and Undecidable Fragments of First-Order Branching Temporal Logics
Full-text access may be available. Sign in or learn about subscription options.
pp. 393
by
Ian Hodkinson
,
Frank Wolter
,
Michael Zakharyaschev
Session 15
Expressive Equivalence of Least and Inflationary Fixed-Point Logic
Full-text access may be available. Sign in or learn about subscription options.
pp. 403
by
Stephan Kreutzer
Session 16
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
Full-text access may be available. Sign in or learn about subscription options.
pp. 413
by
Josée Desharnais
,
Radha Jagadeesan
,
Vineet Gupta
,
Prakash Panangaden
Session 16
Separability, Expressiveness, and Decidability in the Ambient Logic
Full-text access may be available. Sign in or learn about subscription options.
pp. 423
by
Daniel Hirschkoff
,
Étienne Lozes
,
Davide Sangiorgi
Session 16
Linearity in Process Languages
Full-text access may be available. Sign in or learn about subscription options.
pp. 433
by
Mikkel Nygaard
,
Glynn Winskel
Session 17
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time
Full-text access may be available. Sign in or learn about subscription options.
pp. 447
by
Ashish Tiwari
Author Index
Author Index
Freely available from IEEE.
pp. 461
Showing 47 out of 47