Proceedings of the 17th IEEE Symposium on Logic in Computer Science
LICS, 2002.

@proceedings{LICS-2002,
	address       = "Copenhagen, Denmark",
	ee            = "http://www.computer.org/csdl/proceedings/lics/2002/1483/00/index.html",
	isbn          = "0-7695-1483-9",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 17th IEEE Symposium on Logic in Computer Science}",
	year          = 2002,
}

Contents (41 items)

10 ×#logic
5 ×#semantics
4 ×#complexity
4 ×#decidability
3 ×#calculus
3 ×#game studies
3 ×#proving
2 ×#abstraction
2 ×#algebra
2 ×#approach

LICS-2002-Shankar #proving

Little Engines of Proof (NS), p. 3–?.

LICS-2002-LynchM #automation #decidability

Automatic Decidability (CL, BM), p. 7–?.

LICS-2002-ClarkeJLV #model checking

Tree-Like Counterexamples in Model Checking (EMC, SJ, YL, HV), pp. 19–29.

LICS-2002-LaplanteLMPR #abstraction #approach #model checking #probability #testing

Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing (SL, RL, FM, SP, MdR), pp. 30–39.

LICS-2002-RepsLS #semantics

Semantic Minimization of 3-Valued Propositional Formulae (TWR, AL, SS), p. 40–?.

LICS-2002-Reynolds #data type #logic

Separation Logic: A Logic for Shared Mutable Data Structures (JCR), pp. 55–74.

LICS-2002-AhmedAV #semantics

A Stratified Semantics of General References A Stratified Semantics of General References (AJA, AWA, RV), p. 75–?.

LICS-2002-HamidSTMN #approach

A Syntactic Approach to Foundational Proof-Carrying Code (NAH, ZS, VT, SM, ZN), pp. 89–100.

LICS-2002-JeffreyR #concurrent #semantics #testing

A Fully Abstract May Testing Semantics for Concurrent Objects (AJ, JR), pp. 101–112.

LICS-2002-ReusS #calculus #logic #semantics

Semantics and Logic of Object Calculi (BR, TS), p. 113–?.

LICS-2002-PalsbergZ #performance #type inference #type system

Efficient Type Inference for Record Concatenation and Subtyping (JP, TZ), pp. 125–136.

LICS-2002-FrischCB #semantics #type system

Semantic Subtyping (AF, GC, VB), pp. 137–146.

LICS-2002-FioreCB #morphism #λ-calculus

Remarks on Isomorphisms in Typed λ Calculi with Empty and Sum Types (MPF, RDC, VB), p. 147–?.

LICS-2002-Statman #calculus #on the

On The λ Y Calculus (RS), pp. 159–166.

LICS-2002-FaellaTM #game studies #realtime

Dense Real-Time Games (MF, SLT, AM), pp. 167–176.

LICS-2002-Dima #automaton #reachability

Computing Reachability Relations in Timed Automata (CD), p. 177–?.

LICS-2002-GottlobK #monad #query

Monadic Queries over Tree-Structured Data (GG, CK), pp. 189–202.

LICS-2002-BenediktL #algebra #automaton #logic #query

Tree Extension Algebras: Logics, Automata, and Query Languages (MB, LL), p. 203–?.

LICS-2002-FrickG #complexity #first-order #higher-order #logic #monad #revisited

The Complexity of First-Order and Monadic Second-Order Logic Revisited (MF, MG), pp. 215–224.

LICS-2002-Bars #logic #satisfiability

The 0-1 law fails for frame satisfiability of propositional modal logic (JMLB), pp. 225–234.

LICS-2002-IshiharaKR #automation

Some Results on Automatic Structures (HI, BK, SR), p. 235–?.

LICS-2002-Ong #algol #decidability #equivalence

Observational Equivalence of 3rd-Order Idealized Algol is Decidable (CHLO), pp. 245–256.

LICS-2002-HylandS #game studies #graph

Games on Graphs and Sequentially Realizable Functionals (MH, AS), pp. 257–264.

LICS-2002-Laurent #game studies

Polarized Games (OL), p. 265–?.

LICS-2002-EdalatL #calculus #difference

Domain Theory and Differential Calculus (Functions of one Variable) (AE, AL), pp. 277–286.

LICS-2002-Simpson #modelling #recursion #set

Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory (AKS), pp. 287–298.

LICS-2002-Varacca

The Powerdomain of Indexed Valuations (DV), p. 299–?.

LICS-2002-Cook #complexity #proving

Complexity Classes, Propositional Proof Systems, and Formal Theories (SAC), p. 311.

LICS-2002-HesseI #complexity #problem

Complete Problems for Dynamic Complexity Classes (WH, NI), p. 313–?.

LICS-2002-Atserias #random #satisfiability

Unsatisfiable Random Formulas Are Hard to Certify (AA), pp. 325–334.

LICS-2002-SoltysC #algebra #complexity #linear #proving

The Proof Complexity of Linear Algebra (MS, SAC), pp. 335–344.

LICS-2002-Leivant #abstraction #rank

Calibrating Computational Feasibility by Abstraction Rank (DL), p. 345–?.

LICS-2002-CalvaneseGL #information management #logic #representation

Description Logics: Foundations for Class-based Knowledge Representation (DC, GDG, ML), pp. 359–370.

LICS-2002-Otto #finite #theorem

Modal and Guarded Characterisation Theorems over Finite Transition Systems (MO), p. 371–?.

LICS-2002-LaroussinieMS #logic

Temporal Logic with Forgettable Past (FL, NM, PS), pp. 383–392.

LICS-2002-HodkinsonWZ #branch #decidability #first-order #logic

Decidable and Undecidable Fragments of First-Order Branching Temporal Logics (IMH, FW, MZ), pp. 393–402.

LICS-2002-Kreutzer #equivalence #fixpoint #logic

Expressive Equivalence of Least and Inflationary Fixed-Point Logic (SK), p. 403–?.

LICS-2002-DesharnaisJGP #bisimulation #metric #probability #process

The Metric Analogue of Weak Bisimulation for Probabilistic Processes (JD, RJ, VG, PP), pp. 413–422.

LICS-2002-HirschkoffLS #decidability #logic

Separability, Expressiveness, and Decidability in the Ambient Logic (DH, ÉL, DS), pp. 423–432.

LICS-2002-NygaardW #process

Linearity in Process Languages (MN, GW), p. 433–?.

LICS-2002-Tiwari #confluence #polynomial #term rewriting

Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time (AT), p. 447–?.