Proceedings of the 21th IEEE Symposium on Logic in Computer Science
LICS, 2006.

@proceedings{LICS-2006,
	address       = "Seattle, Washington, USA",
	ee            = "http://www.computer.org/csdl/proceedings/lics/2006/2631/00/index.html",
	isbn          = "0-7695-2631-4",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 21th IEEE Symposium on Logic in Computer Science}",
	year          = 2006,
}

Contents (43 items)

13 ×#logic
5 ×#bound
4 ×#first-order
4 ×#on the
4 ×#proving
4 ×#semantics
3 ×#automaton
3 ×#model checking
3 ×#normalisation
3 ×#problem

LICS-2006-Bryant #infinity #using #verification

Formal Verification of Infinite State Systems Using Boolean Methods (REB), pp. 3–4.

LICS-2006-BojanczykMSSD #logic #word

Two-Variable Logic on Words with Data (MB, AM, TS, LS, CD), pp. 7–16.

LICS-2006-DemriL #automaton #ltl #quantifier

LTL with the Freeze Quantifier and Register Automata (SD, RL), pp. 17–26.

LICS-2006-PanV #parametricity

Fixed-Parameter Hierarchies inside PSPACE (GP, MYV), pp. 27–36.

LICS-2006-Otto #bound #first-order #logic #monad #problem

The Boundedness Problem for Monadic Universal First-Order Logic (MO), pp. 37–48.

LICS-2006-FioreS #calculus #congruence #process #semantics

A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics (MPF, SS), pp. 49–58.

LICS-2006-PalamidessiSVV #on the #persistent #π-calculus

On the Expressiveness of Linearity vs Persistence in the Asychronous π-Calculus (CP, VAS, FDV, BV), pp. 59–68.

LICS-2006-BonchiKM #semantics

Saturated Semantics for Reactive Systems (FB, BK, UM), pp. 69–80.

LICS-2006-Ong #higher-order #model checking #on the #recursion

On Model-Checking Trees Generated by Higher-Order Recursion Schemes (CHLO), pp. 81–90.

LICS-2006-KuskeL #automaton #logic #monad

Monadic Chain Logic Over Iterations and Applications to Pushdown Systems (DK, ML), pp. 91–100.

LICS-2006-KahlonG #approach #ltl #model checking #thread

An Automata-Theoretic Approach for Model Checking Threads for LTL Propert (VK, AG), pp. 101–110.

LICS-2006-TerauchiA #on the #polymorphism #recursion

On Typability for Rank-2 Intersection Types with Polymorphic Recursion (TT, AA), pp. 111–122.

LICS-2006-Blass #adaptation #logic

Adapting Logics (AB), p. 123.

LICS-2006-BarthM #linear #logic #using

Managing Digital Rights using Linear Logic (AB, JCM), pp. 127–136.

LICS-2006-ParkinsonBC #hoare #logic

Variables as Resource in Hoare Logics (MJP, RB, CC), pp. 137–146.

LICS-2006-HaymanW #concurrent #independence #logic

Independence and Concurrent Separation Logic (JH, GW), pp. 147–156.

LICS-2006-Leivant #logic #proving #reasoning #source code

Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic (DL), pp. 157–168.

LICS-2006-Lago #complexity #linear #logic #semantics

Context Semantics, Linear Logic and Computational Complexity (UDL), pp. 169–178.

LICS-2006-LaurentF #bound #clique #complexity #semantics

Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity (OL, LTdF), pp. 179–188.

LICS-2006-MacielP #bound #composition #proving

Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives (AM, TP), pp. 189–200.

LICS-2006-LaroseLT #constraints #first-order #problem

A Characterisation of First-Order Constraint Satisfaction Problems (BL, CL, CT), pp. 201–210.

LICS-2006-ChaubardPS #composition #first-order

First Order Formulas with Modular Predicates (LC, JÉP, HS), pp. 211–220.

LICS-2006-KissV #congruence #on the

On Tractability and Congruence Distributivity (EWK, MV), pp. 221–230.

LICS-2006-SchroderP #bound #logic

PSPACE Bounds for Rank-1 Modal Logics (LS, DP), pp. 231–242.

LICS-2006-Kupferman

Avoiding Determinization (OK), pp. 243–254.

LICS-2006-Piterman #automaton #nondeterminism

From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata (NP), pp. 255–264.

LICS-2006-KupfermanV #logic

Memoryful Branching-Time Logic (OK, MYV), pp. 265–274.

LICS-2006-PitermanP #game studies #performance

Faster Solutions of Rabin and Streett Games (NP, AP), pp. 275–284.

LICS-2006-BojanczykC #bound

Bounds in w-Regularity (MB, TC), pp. 285–296.

LICS-2006-Lassen #bisimulation #normalisation #λ-calculus #μ-calculus

Head Normal Form Bisimulation for Pairs and the λμ-Calculus (SBL), pp. 297–306.

LICS-2006-CoquandS #normalisation #proving #using

A Proof of Strong Normalisation using Domain Theory (TC, AS), pp. 307–316.

LICS-2006-ManzonettoS #algebra #λ-calculus

Boolean Algebras for λ Calculus (GM, AS), pp. 317–326.

LICS-2006-TatsutaD #difference #normalisation

Normalisation is Insensible to λ-Term Identity or Difference (MT, MDC), pp. 327–338.

LICS-2006-Dawson #assessment #logic

Shaken Foundations or Groundbreaking Realignment? A Centennial Assessment of Kurt Gödel’s Impact on Logic, Mathematics, and Computer Science (JWD), pp. 339–341.

LICS-2006-Gordon #implementation #protocol #security

Provable Implementations of Security Protocols (ADG), pp. 345–346.

LICS-2006-BrazdilBFK #game studies #probability

Stochastic Games with Branching-Time Winning Objectives (TB, VB, VF, AK), pp. 349–358.

LICS-2006-Kozen #induction #probability #process #proving

Coinductive Proof Principles for Stochastic Processes (DK), pp. 359–366.

LICS-2006-BouyerBC #hybrid

Control in o-minimal Hybrid Systems (PB, TB, FC), pp. 367–378.

LICS-2006-BallK #abstraction #framework #multi

An Abstraction-Refinement Framework for Multi-Agent Systems (TB, OK), pp. 379–388.

LICS-2006-VaraccaV #logic #model checking

Temporal Logics and Model Checking for Fairly Correct Systems (DV, HV), pp. 389–398.

LICS-2006-ShohamG #abstraction #precise

3-Valued Abstraction: More Precision at Less Cost (SS, OG), pp. 399–410.

LICS-2006-DawarGKS #approximate #first-order #optimisation #problem

Approximation Schemes for First-Order Definable Optimisation Problems (AD, MG, SK, NS), pp. 411–420.

LICS-2006-FischerMR #approximate #equivalence #satisfiability

Approximate Satisfiability and Equivalence (EF, FM, MdR), pp. 421–430.