Proceedings of the 19th IEEE Symposium on Logic in Computer Science
LICS, 2004.

@proceedings{LICS-2004,
	address       = "Turku, Finland",
	ee            = "http://www.computer.org/csdl/proceedings/lics/2004/2192/00/index.html",
	isbn          = "0-7695-2192-4",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 19th IEEE Symposium on Logic in Computer Science}",
	year          = 2004,
}

Contents (46 items)

5 ×#automaton
5 ×#game studies
4 ×#logic
4 ×#model checking
4 ×#problem
3 ×#abstraction
3 ×#calculus
3 ×#graph
3 ×#on the
3 ×#proving

LICS-2004-WohrleT #infinity #model checking

Model Checking Synchronized Products of Infinite Transition Systems (SW, WT), pp. 2–11.

LICS-2004-EsparzaKM #automaton #model checking #probability

Model Checking Probabilistic Pushdown Automata (JE, AK, RM), pp. 12–21.

LICS-2004-BaldamusPV #π-calculus

Sπ Calculus Translated to ?--Calculus Preserving May-Tests (MB, JP, BV), pp. 22–31.

LICS-2004-PodelskiR #invariant

Transition Invariants (AP, AR), pp. 32–41.

LICS-2004-KhoussainovNRS #automation

Automatic Structures: Richness and Limitations (BK, AN, SR, FS), pp. 44–53.

LICS-2004-OuaknineW #automaton #decidability #on the #problem

On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap (JO, JW), pp. 54–63.

LICS-2004-GrooteGS #automaton

Vector Addition Tree Automata (PdG, BG, SS), pp. 64–73.

LICS-2004-Yannakakis #game studies #testing

Testing, Optimizaton, and Games (MY), pp. 78–88.

LICS-2004-Leivant #logic #proving #termination

Proving Termination Assertions in Dynamic Logics (DL), pp. 89–98.

LICS-2004-SeshiaB #bound #quantifier #using

Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (SAS, REB), pp. 100–109.

LICS-2004-Klaedtke #automaton #on the

On the Automata Size for Presburger Arithmetic (FK), pp. 110–119.

LICS-2004-Latour #automaton #integer

From Automata to Formulas: Convex Integer Polyhedra (LL), pp. 120–129.

LICS-2004-Razborov #proving

Feasible Proofs and Computations: Partnership and Fusion (AAR), pp. 134–138.

LICS-2004-GabbayC #calculus #logic

A Sequent Calculus for Nominal Logic (MG, JC), pp. 139–148.

LICS-2004-AbramskyGMOS #abstraction #calculus #game studies

Nominal Games and Full Abstraction for the Nu-Calculus (SA, DRG, ASM, CHLO, IDBS), pp. 150–159.

LICS-2004-ChatterjeeHJ #game studies

Games with Secure Equilibria (KC, TAH, MJ), pp. 160–169.

LICS-2004-AlfaroGJ #abstraction #game studies #nondeterminism #precise

Three-Valued Abstractions of Games: Uncertainty, but with Precision (LdA, PG, RJ), pp. 170–179.

LICS-2004-Terui #proving

Proof Nets and Boolean Circuits (KT), pp. 182–191.

LICS-2004-AkamaBHK

An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles (YA, SB, SH, UK), pp. 192–201.

LICS-2004-IntrigilaS #calculus

The ω-Rule is Π⁰₂-Hard in the λβ-Calculus (BI, RS), pp. 202–210.

LICS-2004-FuhrmannP #geometry #interactive #logic #on the

On the Geometry of Interaction for Classical Logic (CF, DJP), pp. 211–220.

LICS-2004-Huth #lts

Beyond Image-Finiteness: Labelled Transition Systems as a Stone Space (MH), pp. 222–231.

LICS-2004-DalmauKL #first-order #graph #problem #reflexive

First-Order Definable Retraction Problems for Posets and Reflexive Graph (VD, AAK, BL), pp. 232–241.

LICS-2004-DunphyR #parametricity

Parametric Limits (BPD, USR), pp. 242–251.

LICS-2004-Harper #self

Self-Adjusting Computation (RH), pp. 254–255.

LICS-2004-CookT

The Strength of Replacement in Weak Arithmetic (SAC, NT), pp. 256–264.

LICS-2004-BaillotT #polynomial #λ-calculus

Light Types for Polynomial Time Computation in λ-Calculus (PB, KT), pp. 266–275.

LICS-2004-BucciarelliS #graph #λ-calculus

The Sensible Graph Theories of λ Calculus (AB, AS), pp. 276–285.

LICS-2004-VIICHP #distributed #symmetry #λ-calculus

A Symmetric Modal λ Calculus for Distributed Computing (TMV, KC, RH, FP), pp. 286–295.

LICS-2004-Sangiorgi #bisimulation #named

Bisimulation: From The Origins to Today (DS), pp. 298–302.

LICS-2004-MousaviRG #congruence

Congruence for SOS with Data (MRM, MAR, JFG), pp. 303–312.

LICS-2004-NaumannB #imperative #invariant #reasoning #towards

Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State (DAN, MB), pp. 313–323.

LICS-2004-Berger #induction

A Computational Interpretation of Open Induction (UB), p. 326.

LICS-2004-DamsN #abstraction #branch #finite #model checking

The Existence of Finite Abstractions for Branching Time Model Checking (DD, KSN), pp. 335–344.

LICS-2004-AbdullaDM #multi #network

Multi-Clock Timed Networks (PAA, JD, PM), pp. 345–354.

LICS-2004-Walukiewicz #game studies

A Landscape with Games in the Backgroun (IW), pp. 356–366.

LICS-2004-NordhJ #algebra #approach #complexity

An Algebraic Approach to the Complexity of Propositional Circumscription (GN, PJ), pp. 367–376.

LICS-2004-NguyenC #higher-order

VTC circ: A Second-Order Theory for TCcirc (PN, SAC), pp. 378–387.

LICS-2004-FlumG #model checking #problem

Model-Checking Problems as a Basis for Parameterized Intractability (JF, MG), pp. 388–397.

LICS-2004-CookK #higher-order

A Second-Order Theory for NL (SAC, AK), pp. 398–407.

LICS-2004-Abramsky #quantum

High-Level Methods for Quantum Computation and Information (SA), pp. 410–414.

LICS-2004-AbramskyC #category theory #protocol #quantum #semantics

A Categorical Semantics of Quantum Protocols (SA, BC), pp. 415–425.

LICS-2004-Marcial-RomeroE #semantics

Semantics of a Sequential Language for Exact Real-Number Computation (JRMR, MHE), pp. 426–435.

LICS-2004-GroheS #first-order #linear #logic

The Succinctness of First-Order Logic on Linear Orders (MG, NS), pp. 438–447.

LICS-2004-Bulatov #constraints #graph #problem #relational

A Graph of a Relational Structure and Constraint Satisfaction Problems (AAB), pp. 448–457.

LICS-2004-Luosto #linear #order

Equicardinality on Linear Orders (KL), pp. 458–465.