Default Cover Image

Proceedings 17th Annual IEEE Symposium on Logic in Computer Science

July 22 2002 to July 25 2002

Copenhagen, Denmark

Table of Contents

Introduction
ForewordFreely available from IEEE.pp. ix
Introduction
Conference OrganisersFreely available from IEEE.pp. x
Introduction
Programme CommitteeFreely available from IEEE.pp. xi
Introduction
Additional ReviewersFreely available from IEEE.pp. xii
FLoC Joint Invited Lecture
Little Engines of ProofFull-text access may be available. Sign in or learn about subscription options.pp. 3
Session 1
Automatic DecidabilityFull-text access may be available. Sign in or learn about subscription options.pp. 7
Session 2
Tree-Like Counterexamples in Model CheckingFull-text access may be available. Sign in or learn about subscription options.pp. 19
Session 2
Semantic Minimization of 3-Valued Propositional FormulaeFull-text access may be available. Sign in or learn about subscription options.pp. 40
Session 3
Separation Logic: A Logic for Shared Mutable Data StructuresFull-text access may be available. Sign in or learn about subscription options.pp. 55
Session 3
A Stratified Semantics of General References Embeddable in Higher-Order LogicFull-text access may be available. Sign in or learn about subscription options.pp. 75
Session 4
A Syntactic Approach to Foundational Proof-Carrying CodeFull-text access may be available. Sign in or learn about subscription options.pp. 89
Session 4
A Fully Abstract May Testing Semantics for Concurrent ObjectsFull-text access may be available. Sign in or learn about subscription options.pp. 101
Session 4
Semantics and Logic of Object CalculiFull-text access may be available. Sign in or learn about subscription options.pp. 113
Session 5
Efficient Type Inference for Record Concatenation and SubtypingFull-text access may be available. Sign in or learn about subscription options.pp. 125
Session 5
Semantic SubtypingFull-text access may be available. Sign in or learn about subscription options.pp. 137
Session 5
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum TypesFull-text access may be available. Sign in or learn about subscription options.pp. 147
Session 6
On The Lambda Y CalculusFull-text access may be available. Sign in or learn about subscription options.pp. 159
Session 6
Dense Real-Time GamesFull-text access may be available. Sign in or learn about subscription options.pp. 167
Session 6
Computing Reachability Relations in Timed AutomataFull-text access may be available. Sign in or learn about subscription options.pp. 177
Session 7
Monadic Queries over Tree-Structured DataFull-text access may be available. Sign in or learn about subscription options.pp. 189
Session 7
Tree Extension Algebras: Logics, Automata, and Query LanguagesFull-text access may be available. Sign in or learn about subscription options.pp. 203
Session 8
The Complexity of First-Order and Monadic Second-Order Logic RevisitedFull-text access may be available. Sign in or learn about subscription options.pp. 215
Session 8
The 0-1 law fails for frame satisfiability of propositional modal logicFull-text access may be available. Sign in or learn about subscription options.pp. 225
Session 8
Some Results on Automatic StructuresFull-text access may be available. Sign in or learn about subscription options.pp. 235
Session 9
Observational Equivalence of 3rd-Order Idealized Algol is DecidableFull-text access may be available. Sign in or learn about subscription options.pp. 245
Session 9
Games on Graphs and Sequentially Realizable Functionals Extended AbstractFull-text access may be available. Sign in or learn about subscription options.pp. 257
Session 9
Polarized GamesFull-text access may be available. Sign in or learn about subscription options.pp. 265
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
Session 10
Computational Adequacy for Recursive Types in Models of Intuitionistic Set TheoryFull-text access may be available. Sign in or learn about subscription options.pp. 287
Session 10
The Powerdomain of Indexed ValuationsFull-text access may be available. Sign in or learn about subscription options.pp. 299
Session 11
Complexity Classes, Propositional Proof Systems, and Formal TheoriesFull-text access may be available. Sign in or learn about subscription options.pp. 311
Session 11
Complete Problems for Dynamic Complexity ClassesFull-text access may be available. Sign in or learn about subscription options.pp. 313
Session 12
Unsatisfiable Random Formulas Are Hard to CertifyFull-text access may be available. Sign in or learn about subscription options.pp. 325
Session 12
The Proof Complexity of Linear AlgebraFull-text access may be available. Sign in or learn about subscription options.pp. 335
Session 12
Calibrating Computational Feasibility by Abstraction RankFull-text access may be available. Sign in or learn about subscription options.pp. 345
Session 14
Description Logics: Foundations for Class-based Knowledge RepresentationFull-text access may be available. Sign in or learn about subscription options.pp. 359
Session 14
Modal and Guarded Characterisation Theorems over Finite Transition SystemsFull-text access may be available. Sign in or learn about subscription options.pp. 371
Session 15
Temporal Logic with Forgettable PastFull-text access may be available. Sign in or learn about subscription options.pp. 383
Session 15
Decidable and Undecidable Fragments of First-Order Branching Temporal LogicsFull-text access may be available. Sign in or learn about subscription options.pp. 393
Session 15
Expressive Equivalence of Least and Inflationary Fixed-Point LogicFull-text access may be available. Sign in or learn about subscription options.pp. 403
Session 16
The Metric Analogue of Weak Bisimulation for Probabilistic ProcessesFull-text access may be available. Sign in or learn about subscription options.pp. 413
Session 16
Separability, Expressiveness, and Decidability in the Ambient LogicFull-text access may be available. Sign in or learn about subscription options.pp. 423
Session 16
Linearity in Process LanguagesFull-text access may be available. Sign in or learn about subscription options.pp. 433
Session 17
Deciding Confluence of Certain Term Rewriting Systems in Polynomial TimeFull-text access may be available. Sign in or learn about subscription options.pp. 447
Author Index
Author IndexFreely available from IEEE.pp. 461
Showing 47 out of 47