Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science
LICS, 2008.

@proceedings{LICS-2008,
	address       = "Pittsburgh, Pennsylvania, USA",
	ee            = "http://www.computer.org/csdl/proceedings/lics/2008/3183/00/index.html",
	isbn          = "978-0-7695-3183-0",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science}",
	year          = 2008,
}

Contents (43 items)

6 ×#logic
5 ×#on the
4 ×#complexity
4 ×#higher-order
4 ×#proving
3 ×#algebra
3 ×#automaton
3 ×#axiom
3 ×#calculus
3 ×#problem

LICS-2008-ChadhaSV #complexity #finite #monitoring #on the

On the Expressiveness and Complexity of Randomization in Finite State Monitors (RC, APS, MV), pp. 18–29.

LICS-2008-GacekMN #recursion

Combining Generic Judgments with Recursive Definitions (AG, DM, GN), pp. 33–44.

LICS-2008-UrbanCB

Mechanizing the Metatheory of LF (CU, JC, SB), pp. 45–56.

LICS-2008-Fiore #higher-order #syntax

Second-Order and Dependently-Sorted Abstract Syntax (MPF), pp. 57–68.

LICS-2008-SchurmannS #logic

Structural Logical Relations (CS, JS), pp. 69–80.

LICS-2008-Tatsuta

Types for Hereditary Permutators (MT), pp. 83–92.

LICS-2008-GasconGS

Context Matching for Compressed Terms (AG, GG, MSS), pp. 93–102.

LICS-2008-Kozen #algebra #testing

Nonlocal Flow of Control and Kleene Algebra with Tests (DK), pp. 105–117.

LICS-2008-SprengerB #abstraction

Cryptographically-Sound Protocol-Model Abstractions (CS, DAB), pp. 115–129.

LICS-2008-PlotkinP #algebra #logic

A Logic for Algebraic Effects (GDP, MP), pp. 118–129.

LICS-2008-Beffara #algebra #calculus #process

An Algebraic Process Calculus (EB), pp. 130–141.

LICS-2008-LanesePSS #calculus #decidability #higher-order #on the #process

On the Expressiveness and Decidability of Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 145–155.

LICS-2008-ChenF #axiom #equivalence #on the

On the Axiomatizability of Impossible Futures: Preorder versus Equivalence (TC, WF), pp. 156–165.

LICS-2008-Staton #category theory #logic #semantics

General Structural Operational Semantics through Categorical Logic (SS), pp. 166–177.

LICS-2008-Kahlon #abstraction #analysis #approach #concurrent #data flow #source code

Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs (VK), pp. 181–192.

LICS-2008-CarayolHMOS #automaton #game studies #higher-order

Winning Regions of Higher-Order Pushdown Games (AC, MH, AM, CHLO, OS), pp. 193–204.

LICS-2008-ChambartS #complexity #recursion

The Ordinal Recursive Complexity of Lossy Channel Systems (PC, PS), pp. 205–216.

LICS-2008-BaierBBBG #automaton #infinity #model checking

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (CB, NB, PB, TB, MG), pp. 217–226.

LICS-2008-CiabattoniGT #axiom #logic

From Axioms to Analytic Rules in Nonclassical Logics (AC, NG, KT), pp. 229–240.

LICS-2008-LicataZH

Focusing on Binding and Computation (DRL, NZ, RH), pp. 241–252.

LICS-2008-Burel #deduction #first-order #representation #type system #using

A First-Order Representation of Pure Type Systems Using Superdeduction (GB), pp. 253–263.

LICS-2008-Grohe #logic

The Quest for a Logic Capturing PTIME (MG), pp. 267–271.

LICS-2008-Riis #calculus #complexity #on the #polynomial #proving

On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity (SR), pp. 272–283.

LICS-2008-AehligB #complexity #on the

On the Computational Complexity of Cut-Reduction (KA, AB), pp. 284–293.

LICS-2008-DalmauL #datalog #symmetry

Maltsev + Datalog --> Symmetric Datalog (VD, BL), pp. 297–306.

LICS-2008-CarvalhoDK #constraints #problem

Caterpillar Duality for Constraint Satisfaction Problems (CC, VD, AAK), pp. 307–316.

LICS-2008-ChenMM #constraints #problem #quantifier

Quantified Constraints and Containment Problems (HC, FRM, BM), pp. 317–328.

LICS-2008-Pottier #anti #higher-order

Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule (FP), pp. 331–340.

LICS-2008-LassenL #bisimulation #morphism #normalisation #parametricity #polymorphism

Typed Normal Form Bisimulation for Parametric Polymorphism (SBL, PBL), pp. 341–352.

LICS-2008-Murawski #game studies #nondeterminism #reachability #semantics #source code

Reachability Games and Game Semantics: Comparing Nondeterministic Programs (ASM), pp. 353–363.

LICS-2008-Edalat

Weak Topology and a Differentiable Operator for Lipschitz Maps (AE), pp. 364–375.

LICS-2008-Lynch #logic #modelling

A Logical Characterization of Individual-Based Models (JFL), pp. 379–390.

LICS-2008-BrazdilFKK #probability #problem #satisfiability

The Satisfiability Problem for Probabilistic CTL (TB, VF, JK, AK), pp. 391–402.

LICS-2008-Moschovakis #axiom #bound

The Axiomatic Derivation of Absolute Lower Bounds (YNM), p. 405.

LICS-2008-Grohe08a

Definable Tree Decompositions (MG), pp. 406–417.

LICS-2008-Duris #theorem

Hypergraph Acyclicity and Extension Preservation Theorems (DD), pp. 418–427.

LICS-2008-HjorthKMN #automation

From Automatic Structures to Borel Structures (GH, BK, AM, AN), pp. 431–441.

LICS-2008-BojanczykSS

Piecewise Testable Tree Languages (MB, LS, HS), pp. 442–451.

LICS-2008-HagueMOS #automaton #recursion

Collapsible Pushdown Automata and Recursion Schemes (MH, ASM, CHLO, OS), pp. 452–461.

LICS-2008-Falco #difference #geometry #interactive

The Geometry of Interaction of Differential Interaction Nets (MdF), pp. 465–475.

LICS-2008-NauroisM #correctness #multi #proving

Correctness of Multiplicative Additive Proof Structures is NL-Complete (PJdN, VM), pp. 476–485.

LICS-2008-LaurentM #proving

Cut Elimination for Monomial MALL Proof Nets (OL, RM), pp. 486–497.

LICS-2008-DelandeM #approach #proving

A Neutral Approach to Proof and Refutation in MALL (OD, DM), pp. 498–508.