Dan R. Ghica, Achim Jung
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic
CSL, 2018.

@proceedings{CSL-2018,
	editor        = "Dan R. Ghica and Achim Jung",
	ee            = "http://www.dagstuhl.de/dagpub/978-3-95977-088-0",
	isbn          = "978-3-95977-088-0",
	publisher     = "{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Proceedings of the 27th EACSL Annual Conference on Computer Science Logic}",
	volume        = 119,
	year          = 2018,
}

Contents (37 items)

CSL-2018-KozenS

The Ackermann Award 2018 (DK, TS), p. 5.

CSL-2018-Kawata #monad #re-engineering

A Contextual Reconstruction of Monadic Reflection (TK), p. 14.

CSL-2018-0001R #induction #infinity #logic #reasoning #transitive

Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (LC0, RNSR), p. 16.

CSL-2018-DawarW #logic #rank #symmetry

Symmetric Circuits for Rank Logic (AD, GW), p. 16.

CSL-2018-ZaidKL #automation #complexity

Climbing up the Elementary Complexity Classes with Theories of Automatic Structures (FAZ, DK, PL), p. 16.

CSL-2018-AbramskyS #semantics

Relating Structure and Power: Comonadic Semantics for Computational Resources (SA, NS), p. 17.

CSL-2018-AngiuliF0 #reasoning #type system

Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities (CA, KBH(, RH0), p. 17.

CSL-2018-AvronLL #safety

Safety, Absoluteness, and Computability (AA, SL, NL), p. 17.

CSL-2018-BerardBJ #bisimulation #finite

Finite Bisimulations for Dynamical Systems with Overlapping Trajectories (BB, PB, VJ), p. 17.

CSL-2018-ChouquetA #linear #logic #parallel #proving

An Application of Parallel Cut Elimination in Unit-Free Multiplicative Linear Logic to the Taylor Expansion of Proof Nets (JC, LVA), p. 17.

CSL-2018-ClairambaultP #modelling #probability #λ-calculus

Fully Abstract Models of the Probabilistic lambda-calculus (PC, HP), p. 17.

CSL-2018-DasO #polynomial #recursion

A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions (AD0, IO), p. 17.

CSL-2018-KrebsLPS #algebra #logic

An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation (AK, KL, PKP, HS), p. 17.

CSL-2018-LopezS #algebra #nondeterminism #probability

Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular (AL, AS), p. 17.

CSL-2018-MarsdenZ

Quantitative Foundations for Resource Theories (DM, MZ), p. 17.

CSL-2018-NeiderW0

Synthesizing Optimally Resilient Controllers (DN, AW, MZ0), p. 17.

CSL-2018-ScheweW0 #game studies

Parity Games with Weights (SS, AW, MZ0), p. 17.

CSL-2018-DasP #algebra #proving

Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices) (AD0, DP), p. 18.

CSL-2018-FerrarottiBV #higher-order #logic #transitive

Expressivity Within Second-Order Transitive-Closure Logic (FF, JVdB, JV), p. 18.

CSL-2018-GowersL #game studies #nondeterminism #semantics

A Fully Abstract Game Semantics for Countable Nondeterminism (WJG, JDL), p. 18.

CSL-2018-MadhusudanMS0 #decidability #higher-order #logic #synthesis

A Decidable Fragment of Second Order Logic With Applications to Synthesis (PM, UM, SS, MV0), p. 19.

CSL-2018-Terui #higher-order #logic

MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics (KT), p. 19.

CSL-2018-AtseriasD #challenge

Definable Inapproximability: New Challenges for Duplicator (AA, AD), p. 21.

CSL-2018-BaillotG #complexity #linear #logic

Combining Linear Logic and Size Types for Implicit Complexity (PB, AG), p. 21.

CSL-2018-BehrS #algebra #category theory

Rule Algebras for Adhesive Categories (NB, PS), p. 21.

CSL-2018-GradelH #concept #dependence #equivalence

Dependency Concepts up to Equivalence (EG, MH), p. 21.

CSL-2018-AhrensHLM #semantics

High-Level Signatures and Initial Semantics (BA, AH, AL, MM), p. 22.

CSL-2018-AlcoleiCHW #concurrent #theorem

The True Concurrency of Herbrand's Theorem (AA, PC, MH, GW), p. 22.

CSL-2018-BassetJPRB

Beyond Admissibility: Dominance Between Chains of Strategies (NB, IJ, AP, JFR, MvdB), p. 22.

CSL-2018-BodirskyMV #constraints #infinity #problem

Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains (MB, MM, CV), p. 22.

CSL-2018-McCuskerS #composition #on the

On Compositionality of Dinatural Transformations (GM, AS), p. 22.

CSL-2018-BonchiSS #query #visual notation

Graphical Conjunctive Queries (FB, JS, PS), p. 23.

CSL-2018-ChadhaS0 #approximate #automaton #probability #regular expression

Approximating Probabilistic Automata by Regular Languages (RC, APS, MV0), p. 23.

CSL-2018-DownenA #multi #towards

Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing (PD, ZMA), p. 23.

CSL-2018-FijalkowMMR #bound #logic

Quantifying Bounds in Strategy Logic (NF, BM, AM, SR), p. 23.

CSL-2018-Luck #canonical #complexity #logic #modelling

Canonical Models and the Complexity of Modal Team Logic (ML), p. 23.

CSL-2018-NolletST #fixpoint #linear #logic #proving

Local Validity for Circular Proofs in Linear Logic with Fixed Points (RN, AS, CT), p. 23.