Proceedings of the 20th IEEE Symposium on Logic in Computer Science
LICS, 2005.

@proceedings{LICS-2005,
	address       = "Chicago, Illinois, USA",
	ee            = "http://www.computer.org/csdl/proceedings/lics/2005/2266/00/index.html",
	isbn          = "0-7695-2266-1",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 20th IEEE Symposium on Logic in Computer Science}",
	year          = 2005,
}

Contents (49 items)

9 ×#logic
5 ×#algebra
3 ×#automaton
3 ×#game studies
3 ×#higher-order
3 ×#on the
3 ×#parametricity
3 ×#semantics
2 ×#analysis
2 ×#concurrent

LICS-2005-Winskel #concurrent

Relations in Concurrency (GW), pp. 2–11.

LICS-2005-BaetenC #algebra #process #regular expression

Regular Expressions in Process Algebra (JCMB, FC), pp. 12–19.

LICS-2005-DawarO #theorem

Modal Characterisation Theorems over Special Classes of Frames (AD, MO), pp. 21–30.

LICS-2005-BarceloL #logic

Temporal Logics over Unranked Trees (PB, LL), pp. 31–40.

LICS-2005-Niemisto #locality #on the #reduction

On Locality and Uniform Reduction (HN), pp. 41–50.

LICS-2005-Goris

Looping Caterpillars (EG, MM), pp. 51–60.

LICS-2005-WashburnW #data flow #parametricity #using

Generalizing Parametricity Using Information-flow (GW, SW), pp. 62–71.

LICS-2005-Hasegawa #parametricity #relational

Relational Parametricity and Control (MH), pp. 72–81.

LICS-2005-MelliesV #framework #parametricity #polymorphism #recursion

Recursive Polymorphic Types and Parametricity in an Operational Framework (PAM, JV), pp. 82–91.

LICS-2005-CastagnaNV #calculus #semantics #type system

Semantic Subtyping for the p-Calculus (GC, RDN, DV), pp. 92–101.

LICS-2005-Benedikt #logic

An Insider’s Guide to Logic in Telecommunications Data (MB), pp. 104–105.

LICS-2005-Atserias #on the #problem

On Digraph Coloring Problems and Treewidth Duality (AA), pp. 106–115.

LICS-2005-EsparzaKM #analysis #automaton #probability

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances (JE, AK, RM), pp. 117–126.

LICS-2005-AbdullaHM #finite #infinity #markov #verification

Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property (PAA, NBH, RM), pp. 127–136.

LICS-2005-BaierG #automaton #probability #regular expression

Recognizing ω-regular Languages with Probabilistic Automata (CB, MG), pp. 137–146.

LICS-2005-Leroux #diagrams #polynomial #synthesis

A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams (JL), pp. 147–156.

LICS-2005-GodefroidH #logic #model checking #semantics

Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics (PG, MH), pp. 158–167.

LICS-2005-Lohrey #model checking

Model-Checking Hierarchical Structures (ML), pp. 168–177.

LICS-2005-ChatterjeeHJ #game studies

Mean-Payoff Parity Games (KC, TAH, MJ), pp. 178–187.

LICS-2005-OuaknineW #decidability #logic #metric #on the

On the Decidability of Metric Temporal Logic (JO, JW), pp. 188–197.

LICS-2005-KupkeV #algebra #automaton

Closure Properties of Coalgebra Automata (CK, YV), pp. 199–208.

LICS-2005-LamarcheS #category theory

Constructing Free Boolean Categories (FL, LS), pp. 209–218.

LICS-2005-Santocanale #algebra

Completions of μ-algebras (LS), pp. 219–228.

LICS-2005-Hofmann #approach

Proof-Theoretic Approach to Description-Logic (MH0), pp. 229–237.

LICS-2005-Hillston #algebra #analysis #process

Process Algebras for Quantitative Analysis (JH), pp. 239–248.

LICS-2005-AltenkirchG #functional #programming language #quantum

A Functional Quantum Programming Language (TA, JG), pp. 249–258.

LICS-2005-BirkedalTY #higher-order #semantics #type system

Semantics of Separation-Logic Typing and Higher-Order Frame Rules (LB, NTS, HY), pp. 260–269.

LICS-2005-HondaYB #higher-order #imperative #logic

An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules (KH, NY, MB), pp. 270–279.

LICS-2005-BonevaTT #logic

Expressiveness of a Spatial Logic for Trees (IB, JMT, ST), pp. 280–289.

LICS-2005-Hardin #algebra #proving

Proof Theory for Kleene Algebra (CH), pp. 290–299.

LICS-2005-Winskel05a #generative

Name Generation and Linearity (GW), pp. 301–310.

LICS-2005-SassoneS

Reactive Systems over Cospans (VS, PS), pp. 311–320.

LICS-2005-FinkbeinerS #distributed #synthesis

Uniform Distributed Synthesis (BF, SS), pp. 321–330.

LICS-2005-BlanchetAF #automation #protocol #security #verification

Automated Verification of Selected Equivalences for Security Protocols (BB, MA, CF), pp. 331–340.

LICS-2005-Feferman

Tarski’s Influence on Computer Science (SF), p. 342.

LICS-2005-Fontana #biology #logic

Logic and Systems Biology (WF), p. 344.

LICS-2005-Lassen #bisimulation #normalisation

Eager Normal Form Bisimulation (SL), pp. 345–354.

LICS-2005-Saurin #λ-calculus #μ-calculus

Separation with Streams in the λμ-calculus (AS), pp. 356–365.

LICS-2005-Lago #geometry #higher-order #linear #recursion

The Geometry of Linear Higher-Order Recursion (UDL), pp. 366–375.

LICS-2005-FaggianM #concurrent #game studies #interactive

Ludics Nets, a game Model of Concurrent Interaction (CF, FM), pp. 376–385.

LICS-2005-Mellies #game studies #linear #logic

Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic (PAM), pp. 386–395.

LICS-2005-Maher #abduction #constraints

Herbrand Constraint Abduction (MJM), pp. 397–406.

LICS-2005-JiaSWG #compilation #stack

Certifying Compilation for a Language with Stack Allocation (LJ, FS, DW, NG), pp. 407–416.

LICS-2005-EdalatP

Inverse and Implicit Functions in Domain Theory (AE, DP), pp. 417–426.

LICS-2005-EscardoK #programming language

Operational Domain Theory and Topology of a Sequential Programming Language (MHE, WKH), pp. 427–436.

LICS-2005-Dalmau

Generalized Majority-Minority Operations are Tractable (VD), pp. 438–447.

LICS-2005-KieronskiO #decidability #first-order #logic

Small Substructures and Decidability Issues for First-Order Logic with Two Variables (EK, MO), pp. 448–457.

LICS-2005-Atserias05a #random

Definability on a Random 3-CNF Formula (AA), pp. 458–466.

LICS-2005-Rossman

Existential Positive Types and Preservation under Homomorphisisms (BR), pp. 467–476.