Thomas A. Henzinger, Dale Miller
Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science
CSL-LICS, 2014.

@proceedings{LICS-CSL-2014,
	acmid         = "2603088",
	address       = "Vienna, Austria",
	editor        = "Thomas A. Henzinger and Dale Miller",
	isbn          = "978-1-4503-2886-9",
	publisher     = "{ACM}",
	title         = "{Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science}",
	year          = 2014,
}

Contents (78 items)

17 ×#logic
10 ×#on the
8 ×#game studies
7 ×#automaton
4 ×#complexity
4 ×#composition
4 ×#concurrent
4 ×#infinity
4 ×#model checking
4 ×#query

LICS-CSL-2014-Fisher #biology #comprehension #logic

Understanding biology through logic (JF), p. 1.

LICS-CSL-2014-Mahboubi #order #proving #theorem

Computer-checked mathematics: a formal proof of the odd order theorem (AM), p. 1.

LICS-CSL-2014-Williams #first-order #graph #performance

Faster decision of first-order graph properties (RW), p. 6.

LICS-CSL-2014-Ilik #axiom #decidability #morphism

Axioms and decidability for type isomorphism in the presence of sums (DI), p. 7.

LICS-CSL-2014-AsarinBDDM #behaviour #logic

Asymptotic behaviour in temporal logic (EA, MB, AD, CD, CM), p. 9.

LICS-CSL-2014-BlumensathCKPB #automaton #infinity #logic

Two-way cost automata and cost logics over infinite trees (AB, TC, DK, PP, MVB), p. 9.

LICS-CSL-2014-BonchiPPR #induction

Coinduction up-to in a fibrational setting (FB, DP, DP, JR), p. 9.

LICS-CSL-2014-Chen #first-order #query #set

The tractability frontier of graph-like first-order query sets (HC), p. 9.

LICS-CSL-2014-Jeffrey #functional

Functional reactive types (AJ), p. 9.

LICS-CSL-2014-Khoussainov #infinity #random

A quest for algorithmically random infinite structures (BK), p. 9.

LICS-CSL-2014-LicataF #type system

Eilenberg-MacLane spaces in homotopy type theory (DRL, EF), p. 9.

LICS-CSL-2014-MareticDB #ltl

Anchored LTL separation (GPM, MTD, DAB), p. 9.

LICS-CSL-2014-0001C #abstract interpretation #automaton

Abstract interpretation from Büchi automata (MH, WC), p. 10.

LICS-CSL-2014-AbdullaAHMKT #energy #game studies #infinity

Infinite-state energy games (PAA, MFA, PH, RM, KNK, PT), p. 10.

LICS-CSL-2014-AccattoliL #invariant #reduction

β reduction is invariant, indeed (BA, UDL), p. 10.

LICS-CSL-2014-AlurFR #combinator #string

Regular combinators for string transformations (RA, AF, MR), p. 10.

LICS-CSL-2014-BaierDK #analysis #model checking #probability #trade-off

Trade-off analysis meets probabilistic model checking (CB, CD, SK), p. 10.

LICS-CSL-2014-BaierKKW #complexity #decidability #linear #logic #monitoring

Weight monitoring with linear temporal logic: complexity and decidability (CB, JK, SK, SW), p. 10.

LICS-CSL-2014-BarceloM #combinator #graph #logic #word

Graph logics with rational relations: the role of word combinatorics (PB, PM), p. 10.

LICS-CSL-2014-BenediktCB #effectiveness #logic

Effective interpolation and preservation in guarded logics (MB, BtC, MVB), p. 10.

LICS-CSL-2014-BernardoSV #higher-order #interactive #on the #power of

On the discriminating power of passivation and higher-order interaction (MB, DS, VV), p. 10.

LICS-CSL-2014-BilokonE #approach #probability #process

A domain-theoretic approach to Brownian motion and general continuous stochastic processes (PB, AE), p. 10.

LICS-CSL-2014-BojanczykDK #calculus #composition #model checking #theorem #μ-calculus

Decomposition theorems and model-checking for the modal μ-calculus (MB, CD, SK), p. 10.

LICS-CSL-2014-Bollig #automaton #communication #logic

Logic for communicating automata with parameterized topology (BB), p. 10.

LICS-CSL-2014-BolligGMZ #automaton #logic

Logical characterization of weighted pebble walking automata (BB, PG, BM, MZ), p. 10.

LICS-CSL-2014-BovaGS #logic #model checking #order #set

Model checking existential logic on partially ordered sets (SB, RG, SS), p. 10.

LICS-CSL-2014-BrazdilKKNK #automaton #multi #probability

Zero-reachability in probabilistic multi-counter automata (TB, SK, AK, PN, JPK), p. 10.

LICS-CSL-2014-BrenguierRS #complexity #game studies

The complexity of admissibility in ω-regular games (RB, JFR, MS), p. 10.

LICS-CSL-2014-Breuvart #modelling #on the

On the characterization of models of H (FB), p. 10.

LICS-CSL-2014-BrotherstonFPG #induction #logic #satisfiability

A decision procedure for satisfiability in separation logic with inductive predicates (JB, CF, JANP, NG), p. 10.

LICS-CSL-2014-CastellanCW #concurrent #game studies #symmetry

Symmetry in concurrent games (SC, PC, GW), p. 10.

LICS-CSL-2014-CharatonikKM #decidability #logic #transitive

Decidability of weak logics with deterministic transitive closure (WC, EK, FM), p. 10.

LICS-CSL-2014-ChaudhuriG #calculus #fixpoint #similarity

Equality and fixpoints in the calculus of structures (KC, NG), p. 10.

LICS-CSL-2014-ChenK #distance #markov #on the

On the total variation distance of labelled Markov chains (TC, SK), p. 10.

LICS-CSL-2014-ChenM #classification #complexity #graph #query

One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries (HC, MM), p. 10.

LICS-CSL-2014-CousotC #abstract interpretation #past present future

Abstract interpretation: past, present and future (PC, RC), p. 10.

LICS-CSL-2014-CretinR #constraints #system f

System F with coercion constraints (JC, DR), p. 10.

LICS-CSL-2014-Das #on the

On the pigeonhole and related principles in deep inference and monotone systems (AD), p. 10.

LICS-CSL-2014-DemriD #logic

Expressive completeness of separation logic with two variables and no separating conjunction (SD, MD), p. 10.

LICS-CSL-2014-Ehrhard #correctness #proving

A new correctness criterion for MLL proof nets (TE), p. 10.

LICS-CSL-2014-EndrullisH #morphism #on the

On periodically iterated morphisms (JE, DH), p. 10.

LICS-CSL-2014-FigueiraL #logic

Pattern logics and auxiliary relations (DF, LL), p. 10.

LICS-CSL-2014-FioreS #algebra

Substitution, jumps, and algebraic effects (MPF, SS), p. 10.

LICS-CSL-2014-FredriksonJ #approach #privacy #satisfiability

Satisfiability modulo counting: a new approach for analyzing privacy properties (MF, SJ), p. 10.

LICS-CSL-2014-GottlobM #bound #logic #problem

Achieving new upper bounds for the hypergraph duality problem through logic (GG, EM), p. 10.

LICS-CSL-2014-GrathwohlKM #exclamation

KAT + B! (NBBG, DK, KM), p. 10.

LICS-CSL-2014-GuenotS #logic #normalisation #symmetry

Symmetric normalisation for intuitionistic logic (NG, LS), p. 10.

LICS-CSL-2014-GutierrezW #concurrent #game studies

Equilibria of concurrent games on event structures (JG, MW), p. 10.

LICS-CSL-2014-Haase #subclass

Subclasses of presburger arithmetic and the weak EXP hierarchy (CH), p. 10.

LICS-CSL-2014-Hague #term rewriting

Senescent ground tree rewrite systems (MH), p. 10.

LICS-CSL-2014-HarwathHS #bound #composition #theorem

Preservation and decomposition theorems for bounded degree structures (FH, LH, NS), p. 10.

LICS-CSL-2014-HeijltjesH #equivalence #proving

No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete (WH, RH), p. 10.

LICS-CSL-2014-HoshinoMH #algebra #component #geometry #interactive

Memoryful geometry of interaction: from coalgebraic components to algebraic effects (NH, KM, IH), p. 10.

LICS-CSL-2014-KatoenSZ

Probably safe or live (JPK, LS, LZ), p. 10.

LICS-CSL-2014-KikotKPZ #on the #ontology #query

On the succinctness of query rewriting over shallow ontologies (SK, RK, VVP, MZ), p. 10.

LICS-CSL-2014-KlinLOT #complexity #constraints #problem #turing machine

Turing machines with atoms, constraint satisfaction problems, and descriptive complexity (BK, SL, JO, ST), p. 10.

LICS-CSL-2014-KoskinenT #reasoning

Local temporal reasoning (EK, TT), p. 10.

LICS-CSL-2014-KreutzerS #on the

On Hanf-equivalence and the number of embeddings of small induced subgraphs (SK, NS), p. 10.

LICS-CSL-2014-LagoFHY #geometry

The geometry of synchronization (UDL, CF, IH, AY), p. 10.

LICS-CSL-2014-LazicS #branch

Non-elementary complexities for branching VASS, MELL, and extensions (RL, SS), p. 10.

LICS-CSL-2014-LerouxPS #automaton #bound

Hyper-Ackermannian bounds for pushdown vector addition systems (JL, MP, GS), p. 10.

LICS-CSL-2014-LevyS #game studies

Transition systems over games (PBL, SS), p. 10.

LICS-CSL-2014-LiangFS #composition #concurrent #refinement #source code #verification

Compositional verification of termination-preserving refinement of concurrent programs (HL, XF, ZS), p. 10.

LICS-CSL-2014-LosemannM #query

MSO queries on trees: enumerating answers under updates (KL, WM), p. 10.

LICS-CSL-2014-Mamino #on the #power of

On the computing power of +, -, and × (MM), p. 10.

LICS-CSL-2014-Mamouras #hoare #monad #on the #recursion

On the Hoare theory of monadic recursion schemes (KM), p. 10.

LICS-CSL-2014-Mogelberg #effectiveness #recursion #type system

A type theory for productive coprogramming via guarded recursion (REM), p. 10.

LICS-CSL-2014-Munch-Maccagnoni #type system

Formulae-as-types for an involutive negation (GMM), p. 10.

LICS-CSL-2014-Padovani #concurrent #linear #π-calculus

Deadlock and lock freedom in the linear π-calculus (LP), p. 10.

LICS-CSL-2014-Pedrot #functional

A functional functional interpretation (PMP), p. 10.

LICS-CSL-2014-Perrinel #interactive #on the #semantics

On context semantics and interaction nets (MP), p. 10.

LICS-CSL-2014-PlaceZ #first-order #logic #regular expression

Separating regular languages with first-order logic (TP, MZ), p. 10.

LICS-CSL-2014-Pratt-Hartmann #equivalence #logic

Logics with counting and equivalence (IPH), p. 10.

LICS-CSL-2014-RouxP #game studies #infinity

Infinite sequential games with real-valued payoffs (SLR, AP), p. 10.

LICS-CSL-2014-TsukadaO #composition #game studies #higher-order #model checking

Compositional higher-order model checking via ω-regular games over Böhm trees (TT, CHLO), p. 10.

LICS-CSL-2014-Velner #multi #robust #synthesis

Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives (YV), p. 10.

LICS-CSL-2014-BruyereMR #game studies

Secure equilibria in weighted games (VB, NM, JFR), p. 26.

LICS-CSL-2014-CarreiroFVZ #automaton #similarity

Weak MSO: automata and expressiveness modulo bisimilarity (FC, AF, YV, FZ), p. 27.