Proceedings of the 22nd IEEE Symposium on Logic in Computer Science
LICS, 2007.

@proceedings{LICS-2007,
	address       = "Wroclaw, Poland",
	ee            = "http://www.computer.org/csdl/proceedings/lics/2007/2908/00/index.html",
	isbn          = "0-7695-2908-9",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 22nd IEEE Symposium on Logic in Computer Science}",
	year          = 2007,
}

Contents (44 items)

9 ×#logic
3 ×#game studies
3 ×#infinity
3 ×#performance
3 ×#proving
2 ×#algebra
2 ×#calculus
2 ×#complexity
2 ×#constraints
2 ×#encryption

LICS-2007-AbelCD #evaluation #normalisation #similarity #type system

Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements (AA, TC, PD), pp. 3–12.

LICS-2007-Riba #interactive #normalisation

Strong Normalization as Safe Interaction (CR), pp. 13–22.

LICS-2007-Moczydlowski #set

A Dependent Set Theory (WM), pp. 23–34.

LICS-2007-Hales #geometry #problem

Some Methods of Problem Solving in Elementary Geometry (TCH), pp. 35–40.

LICS-2007-BraunerHK #deduction

Principles of Superdeduction (PB, CH, CK), pp. 41–50.

LICS-2007-BrotherstonS #calculus #induction #infinity

Complete Sequent Calculi for Induction and Infinite Descent (JB, AS), pp. 51–62.

LICS-2007-RabinST #correctness #performance #proving

Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications (MOR, RAS, CT), pp. 63–76.

LICS-2007-CohenD #axiom #encryption

A Complete Axiomatization of Knowledge and Cryptography (MC, MD), pp. 77–88.

LICS-2007-GimbertZ #markov #multi #process

Limits of Multi-Discounted Markov Decision Processes (HG, WZ), pp. 89–98.

LICS-2007-AlfaroMRS #game studies #metric

Game Relations and Metrics (LdA, RM, VR, MS), pp. 99–108.

LICS-2007-BouyerMOW #cost analysis

The Cost of Punctuality (PB, NM, JO, JW), pp. 109–120.

LICS-2007-Bojanczyk #logic

Two-way unary temporal logic over trees (MB), pp. 121–130.

LICS-2007-JurdzinskiL #calculus #μ-calculus

Alternation-free modal μ-calculus for data trees (MJ, RL), pp. 131–140.

LICS-2007-MontanariP

A Contraction Method to Decide MSO Theories of Deterministic Trees (AM, GP), pp. 141–150.

LICS-2007-AlurABEIL #first-order #logic #word

First-Order and Temporal Logics for Nested Words (RA, MA, PB, KE, NI, LL), pp. 151–160.

LICS-2007-TorreMP #context-sensitive grammar #robust

A Robust Class of Context-Sensitive Languages (SLT, PM, GP), pp. 161–170.

LICS-2007-RanzatoT #algorithm #equivalence #performance #simulation

A New Efficient Simulation Equivalence Algorithm (FR, FT), pp. 171–180.

LICS-2007-KahlerKT #encryption #infinity #model checking #protocol

Infinite State AMC-Model Checking for Cryptographic Protocols (DK, RK, TT), pp. 181–192.

LICS-2007-EgriLT #constraints #datalog #problem #symmetry

Symmetric Datalog and Constraint Satisfaction Problems in Logspace (LE, BL, PT), pp. 193–202.

LICS-2007-BodirskyC #constraints #quantifier #similarity

Quantified Equality Constraints (MB, HC), pp. 203–212.

LICS-2007-IdziakMMVW #algebra

Tractability and learnability arising from algebras with few subpowers (PMI, PM, RM, MV, RW), pp. 213–224.

LICS-2007-Perron

Examining The Fragments of G (SJP), pp. 225–234.

LICS-2007-Nguyen #proving

Separating DAG-Like and Tree-Like Proof Systems (PN), pp. 235–244.

LICS-2007-NguyenC #complexity #proving #theorem

The Complexity of Proving the Discrete Jordan Curve Theorem (PN, SAC), pp. 245–256.

LICS-2007-Kolaitis #finite

Reflections on Finite Model Theory (PGK), pp. 257–269.

LICS-2007-DawarGK

Locally Excluding a Minor (AD, MG, SK), pp. 270–279.

LICS-2007-CateBV #first-order #logic #theorem

Lindstrom theorems for fragments of first-order logic (BtC, JvB, JAV), pp. 280–292.

LICS-2007-SangiorgiKS #bisimulation #higher-order

Environmental Bisimulations for Higher-Order Languages (DS, NK, ES), pp. 293–302.

LICS-2007-BonsangueK #logic #π-calculus

π-Calculus in Logical Form (MMB, AK), pp. 303–312.

LICS-2007-DengGHMZ #finite #probability #process #testing

Characterising Testing Preorders for Finite Probabilistic Processes (YD, RJvG, MH, CM, CZ), pp. 313–325.

LICS-2007-Stirling #automaton #game studies #higher-order

Higher-Order Matching, Games and Automata (CS), pp. 326–335.

LICS-2007-Klin #algebra #logic #semantics

Bialgebraic Operational Semantics and Modal Logic (BK), pp. 336–345.

LICS-2007-MogelbergS #parametricity #relational

Relational Parametricity for Computational Effects (REM, AS), pp. 346–355.

LICS-2007-Pottier

Static Name Control for FreshML (FP), pp. 356–365.

LICS-2007-CalcagnoOY #logic

Local Action and Abstract Separation Logic (CC, PWO, HY), pp. 366–378.

LICS-2007-HarmerHM #category theory #combinator

Categorical Combinatorics for Innocent Strategies (RH, MH, PAM), pp. 379–388.

LICS-2007-MelliesT #game studies #semantics

Resource modalities in game semantics (PAM, NT), pp. 389–398.

LICS-2007-Tzevelekos #abstraction

Full abstraction for nominal general references (NT), pp. 399–410.

LICS-2007-Schopp #bound #logic

Stratified Bounded Affine Logic for Logarithmic Space (US), pp. 411–420.

LICS-2007-BaillotCL #complexity #logic #reduction

Light Logics and Optimal Reduction: Completeness and Complexity (PB, PC, UDL), pp. 421–430.

LICS-2007-Oliva #linear #logic

Modified Realizability Interpretation of Classical Linear Logic (PO), pp. 431–442.

LICS-2007-Escardo #infinity #performance #set

Infinite sets that admit fast exhaustive search (MHE), pp. 443–452.

LICS-2007-Goubault-Larrecq #on the

On Noetherian Spaces (JGL), pp. 453–462.

LICS-2007-Edalat #approach #integration

A computable approach to measure and integration theory (AE), pp. 463–472.