Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science
LICS, 2010.

@proceedings{LICS-2010,
	address       = "Edinburgh, Scotland, United Kingdom",
	ee            = "http://www.computer.org/csdl/proceedings/lics/2010/4114/00/index.html",
	isbn          = "978-0-7695-4114-3",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science}",
	year          = 2010,
}

Contents (46 items)

8 ×#logic
5 ×#on the
4 ×#automaton
3 ×#algebra
3 ×#calculus
3 ×#finite
3 ×#probability
3 ×#semantics
2 ×#automation
2 ×#bound

LICS-2010-BaranyGO #query

Querying the Guarded Fragment (VB, GG, MO), pp. 1–10.

LICS-2010-Otto

Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment (MO), pp. 11–20.

LICS-2010-SilesH #similarity #type system

Equality Is Typable in Semi-full Pure Type Systems (VS, HH), pp. 21–30.

LICS-2010-PopescuGO #normalisation #system f

Strong Normalization for System F by HOAS on Top of FOAS (AP, ELG, CJO), pp. 31–40.

LICS-2010-Laird #game studies #polymorphism #programming language #semantics

Game Semantics for a Polymorphic Programming Language (JL), pp. 41–49.

LICS-2010-Herbelin #logic #markov #principle

An Intuitionistic Logic that Proves Markov’s Principle (HH), pp. 50–56.

LICS-2010-Harel

Amir Pnueli: A Gentle Giant, Lord of the Phi’s and the Psi’s (DH), p. 57.

LICS-2010-Plotkin #tool support

Robin Milner, a Craftsman of Tools for the Mind (GDP), pp. 58–59.

LICS-2010-JenkinsORW #automaton #bound

Alternating Timed Automata over Bounded Time (MJ, JO, AR, JW), pp. 60–69.

LICS-2010-ColcombetL #cost analysis #finite

Regular Cost Functions over Finite Trees (TC, CL), pp. 70–79.

LICS-2010-KopczynskiT #complexity #image

Parikh Images of Grammars: Complexity and Applications (EK, AWT), pp. 80–89.

LICS-2010-BodirskyHM #algebra #approach #constraints #on the

On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction (MB, MH, BM), pp. 90–99.

LICS-2010-BartoK #csp

New Conditions for Taylor Varieties and CSP (LB, MK), pp. 100–109.

LICS-2010-Abadi #security

The Fine Print of Security (MA), p. 110.

LICS-2010-EndrullisHK #combinator #composition #fixpoint

Modular Construction of Fixed Point Combinators and Clocked Bohm Trees (JE, DH, JWK), pp. 111–119.

LICS-2010-BroadbentCOS #logic #recursion

Recursion Schemes and Logical Reflection (CHB, AC, CHLO, OS), pp. 120–129.

LICS-2010-BrotherstonK #logic

Undecidability of Propositional Separation Logic and Its Neighbours (JB, MIK), pp. 130–139.

LICS-2010-Larchey-WendlingG #semantics

The Undecidability of Boolean BI through Phase Semantics (DLW, DG), pp. 140–149.

LICS-2010-Mellies

Segal Condition Meets Computational Effects (PAM), pp. 150–159.

LICS-2010-KuskeLL #automation #morphism #problem

The Isomorphism Problem on Classes of Automatic Structures (DK, JL, ML), pp. 160–169.

LICS-2010-He #finite #first-order #on the #quantifier #strict

On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures (YH), pp. 170–178.

LICS-2010-Grohe #fixpoint #graph #polynomial

Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors (MG), pp. 179–188.

LICS-2010-KreutzerT #bound #complexity #higher-order #logic #monad

Lower Bounds for the Complexity of Monadic Second-Order Logic (SK, ST), pp. 189–198.

LICS-2010-Laubner #graph #polynomial

Capturing Polynomial Time on Interval Graphs (BL), pp. 199–208.

LICS-2010-JohannSV #algebra

A Generic Operational Metatheory for Algebraic Effects (PJ, AS, JV), pp. 209–218.

LICS-2010-Zeilberger #continuation #logic

Polarity and the Logic of Delimited Continuations (NZ), pp. 219–227.

LICS-2010-CaliGLMP #datalog #information management #logic #product line #query #representation

Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications (AC, GG, TL, BM, AP), pp. 228–242.

LICS-2010-BojanczykL #automaton #xpath

An Extension of Data Automata that Captures XPath (MB, SL), pp. 243–252.

LICS-2010-PlaceS #xpath

Deciding Definability in FO2(<) (or XPath) on Trees (TP, LS), pp. 253–262.

LICS-2010-BargunoCGJV #automaton #constraints #problem

The Emptiness Problem for Tree Automata with Global Constraints (LB, CC, GG, FJ, CV), pp. 263–272.

LICS-2010-SchweikardtS #invariant

Addition-Invariant FO and Regularity (NS, LS), pp. 273–282.

LICS-2010-Moore #proving #theorem proving #verification

Theorem Proving for Verification: The Early Days (JSM), p. 283.

LICS-2010-GuglielmiGS #logic

Breaking Paths in Atomic Flows for Classical Logic (AG, TG, LS), pp. 284–293.

LICS-2010-BasaldellaT

Infinitary Completeness in Ludics (MB, KT), pp. 294–303.

LICS-2010-AvronAZ #logic #on the

On Strong Maximality of Paraconsistent Finite-Valued Logics (AA, OA, AZ), pp. 304–313.

LICS-2010-AlvimAP #data flow #probability

Probabilistic Information Flow (MSA, MEA, CP), pp. 314–321.

LICS-2010-JohanssonBPV #calculus

Weak Equivalences in Psi-Calculi (MJ, JB, JP, BV), pp. 322–331.

LICS-2010-BartolettiZ #calculus #process

A Calculus of Contracting Processes (MB, RZ), pp. 332–341.

LICS-2010-EisentrautHZ #automaton #on the #probability

On Probabilistic Automata in Continuous Time (CE, HH, LZ), pp. 342–351.

LICS-2010-Goubault-Larrecq #probability

ω-QRB-Domains and the Probabilistic Powerdomain (JGL), pp. 352–361.

LICS-2010-DanosFFHK #automation #difference #modelling #reduction #rule-based #semantics

Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction (VD, JF, WF, RH, JK), pp. 362–381.

LICS-2010-LaneveV #power of

The Expressive Power of Synchronizations (CL, AV), pp. 382–391.

LICS-2010-StatonW #on the #symmetry

On the Expressivity of Symmetry in Event Structures (SS, GW), pp. 392–401.

LICS-2010-Ehrhard

A Finiteness Structure on Resource Terms (TE), pp. 402–410.

LICS-2010-Abramsky #algebra #physics

Coalgebras, Chu Spaces, and Representations of Physical Systems (SA), pp. 411–420.

LICS-2010-Milius #calculus #finite

A Sound and Complete Calculus for Finite Stream Circuits (SM), pp. 421–430.