Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz
Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Track B: Logic, Semantics, and Theory of Programming
ICALP (2), 2008.

@proceedings{ICALP-B-2008,
	address       = "Reykjavik, Iceland",
	editor        = "Luca Aceto and Ivan Damgård and Leslie Ann Goldberg and Magnús M. Halldórsson and Anna Ingólfsdóttir and Igor Walukiewicz",
	isbn          = "978-3-540-70582-6",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Track B: Logic, Semantics, and Theory of Programming}",
	volume        = 5126,
	year          = 2008,
}

Contents (34 items)

5 ×#automaton
5 ×#logic
4 ×#on the
2 ×#complexity
2 ×#composition
2 ×#constraints
2 ×#datalog
2 ×#equation
2 ×#finite
2 ×#nondeterminism

ICALP-B-2008-Canetti #analysis #composition #performance #security

Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency (RC), pp. 1–13.

ICALP-B-2008-EsparzaKL

Newton’s Method for ω-Continuous Semirings (JE, SK, ML), pp. 14–26.

ICALP-B-2008-BjorklundM #automaton #nondeterminism

The Tractability Frontier for NFA Minimization (HB, WM), pp. 27–38.

ICALP-B-2008-GruberH #automaton #finite #regular expression

Finite Automata, Digraph Connectivity, and Regular Expression Size (HG, MH), pp. 39–50.

ICALP-B-2008-Jurdzinski #recursion

Leftist Grammars Are Non-primitive Recursive (TJ), pp. 51–62.

ICALP-B-2008-JezO #equation #on the #set

On the Computational Completeness of Equations over Sets of Natural Numbers (AJ, AO), pp. 63–74.

ICALP-B-2008-NeubauerT #calculus

Placement Inference for a Client-Server Calculus (MN, PT), pp. 75–86.

ICALP-B-2008-JohanssonPVB #π-calculus

Extended π-Calculi (MJ, JP, BV, JB), pp. 87–98.

ICALP-B-2008-BergerHY #abstraction #logic #mobile #process

Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes (MB, KH, NY), pp. 99–111.

ICALP-B-2008-BoigelotBB #automaton #finite #multi #on the #set

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (BB, JB, VB), pp. 112–123.

ICALP-B-2008-BouyerMOW #complexity #model checking #on the #realtime

On Expressiveness and Complexity in Real-Time Model Checking (PB, NM, JO, JW), pp. 124–135.

ICALP-B-2008-VladimerouPVD #hybrid

STORMED Hybrid Systems (VV, PP, MV, GED), pp. 136–147.

ICALP-B-2008-BrazdilFK #branch #markov #process #synthesis #verification

Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives (TB, VF, AK), pp. 148–159.

ICALP-B-2008-DawarK #datalog #on the

On Datalog vs. LFP (AD, SK), pp. 160–171.

ICALP-B-2008-EgriLT #datalog #symmetry

Directed st-Connectivity Is Not Expressible in Symmetric Datalog (LE, BL, PT), pp. 172–183.

ICALP-B-2008-BodirskyG #complexity #constraints

Non-dichotomies in Constraint Satisfaction Complexity (MB, MG), pp. 184–196.

ICALP-B-2008-Chen #constraints #quantifier

Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (HC), pp. 197–208.

ICALP-B-2008-GomezGP #commutative #question

When Does Partial Commutative Closure Preserve Regularity? (ACG, GG, JÉP), pp. 209–220.

ICALP-B-2008-Mathissen #algebra #logic #word

Weighted Logics for Nested Words and Algebraic Formal Power Series (CM), pp. 221–232.

ICALP-B-2008-BojanczykS #first-order #logic #quantifier

Tree Languages Defined in First-Order Logic with One Quantifier Alternation (MB, LS), pp. 233–245.

ICALP-B-2008-GehrkeGP #equation #regular expression

Duality and Equational Theory of Regular Languages (MG, SG, JÉP), pp. 246–257.

ICALP-B-2008-YokoyamaAG #theorem

Reversible Flowchart Languages and the Structured Reversible Program Theorem (TY, HBA, RG), pp. 258–270.

ICALP-B-2008-Katsumata #attribute grammar #category theory #semantics

Attribute Grammars and Categorical Semantics (SyK), pp. 271–282.

ICALP-B-2008-Martin #formal method #quantum

A Domain Theoretic Model of Qubit Channels (KM), pp. 283–297.

ICALP-B-2008-CoeckeD #quantum

Interacting Quantum Observables (BC, RD), pp. 298–310.

ICALP-B-2008-Kesner #composition

Perpetuality for Full and Safe Composition (in a Constructive Setting) (DK), pp. 311–322.

ICALP-B-2008-Lebresne #call-by #exception #system f

A System F with Call-by-Name Exceptions (SL), pp. 323–335.

ICALP-B-2008-SimmonsP #algorithm #linear #logic

Linear Logical Algorithms (RJS, FP), pp. 336–347.

ICALP-B-2008-BirkedalRSY #higher-order #logic

A Simple Model of Separation Logic for Higher-Order Store (LB, BR, JS, HY), pp. 348–360.

ICALP-B-2008-GreimelBJV

Open Implication (KG, RB, BJ, MYV), pp. 361–372.

ICALP-B-2008-Schewe #satisfiability

ATL* Satisfiability Is 2EXPTIME-Complete (SS), pp. 373–385.

ICALP-B-2008-RaskinS #automaton #transducer

Visibly Pushdown Transducers (JFR, FS), pp. 386–397.

ICALP-B-2008-ColcombetL #automaton #nondeterminism

The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (TC, CL), pp. 398–409.

ICALP-B-2008-AxelssonHL #context-free grammar #incremental #satisfiability #using

Analyzing Context-Free Grammars Using an Incremental SAT Solver (RA, KH, ML), pp. 410–422.