## Stephan Kreutzer

*Proceedings of the 24th Annual Conference on Computer Science Logic*

CSL, 2015.

@proceedings{CSL-2015, address = "Berlin, Germany", editor = "Stephan Kreutzer", ee = "http://www.dagstuhl.de/dagpub/978-3-939897-90-3", isbn = "978-3-939897-90-3", publisher = "{Schloss Dagstuhl — Leibniz-Zentrum für Informatik}", series = "{Leibniz International Proceedings in Informatics}", title = "{Proceedings of the 24th Annual Conference on Computer Science Logic}", volume = 41, year = 2015, }

### Contents (42 items)

- CSL-2015-Abadi
- The Prophecy of Timely Rollback (MA), p. 1.
- CSL-2015-CarapelleL #constraints #logic
- Temporal Logics with Local Constraints (CC, ML), pp. 2–13.
- CSL-2015-Williams
- Thinking Algorithmically About Impossibility (RRW), pp. 14–23.
- CSL-2015-Mazza
- Simple Parsimonious Types and Logarithmic Space (DM), pp. 24–40.
- CSL-2015-BovaM #finite #first-order #query
- First-Order Queries on Finite Abelian Groups (SB, BM), pp. 41–59.
- CSL-2015-DawarW #finite
- A Definability Dichotomy for Finite Valued CSPs (AD, PW), pp. 60–77.
- CSL-2015-CranenLW #fixpoint #logic
- Evidence for Fixpoint Logic (SC, BL, TACW), pp. 78–93.
- CSL-2015-BaazF #logic
- Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic (MB, CGF), pp. 94–109.
- CSL-2015-HetzlZ
- Tree Grammars for the Elimination of Non-prenex Cuts (SH, SZ), pp. 110–127.
- CSL-2015-SchubertDB #automaton #proving
- Automata Theoretic Account of Proof Search (AS, WD, HPB), pp. 128–143.
- CSL-2015-MazowieckiR #automaton #logic #towards
- Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata (FM, CR), pp. 144–159.
- CSL-2015-CartonD #transducer
- Aperiodic Two-way Transducers and FO-Transductions (OC, LD), pp. 160–174.
- CSL-2015-KupfermanV #finite #on the #probability
- On Relative and Probabilistic Finite Counterability (OK, GV), pp. 175–192.
- CSL-2015-MolinariMP #logic #model checking
- A Model Checking Procedure for Interval Temporal Logics based on Track Representatives (AM, AM, AP), pp. 193–210.
- CSL-2015-AbramskyBKLM
- Contextuality, Cohomology and Paradox (SA, RSB, KK, RL, SM), pp. 211–228.
- CSL-2015-SalvatiW #behaviour #higher-order #source code
- A Model for Behavioural Properties of Higher-order Programs (SS, IW), pp. 229–243.
- CSL-2015-ClementeL #analysis #automaton #first-order #reachability
- Reachability Analysis of First-order Definable Pushdown Systems (LC, SL), pp. 244–259.
- CSL-2015-GrelloisM #higher-order #linear #logic #model checking #relational #semantics
- Relational Semantics of Linear Logic and Higher-order Model Checking (CG, PAM), pp. 260–276.
- CSL-2015-KontinenMSV #semantics #theorem
- A Van Benthem Theorem for Modal Team Semantics (JK, JSM, HS, HV), pp. 277–291.
- CSL-2015-SanoV #axiom #dependence #logic
- Axiomatizing Propositional Dependence Logics (KS, JV), pp. 292–307.
- CSL-2015-SchwentickVZ #source code #static analysis
- Static Analysis for Logic-based Dynamic Programs (TS, NV, TZ), pp. 308–324.
- CSL-2015-BrotherstonV #logic
- Sub-classical Boolean Bunched Logics and the Meaning of Par (JB, JV), pp. 325–342.
- CSL-2015-Berardi #comprehension #higher-order #induction
- Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness (SB), pp. 343–358.
- CSL-2015-CapriottiKV
- Functions out of Higher Truncations (PC, NK, AV), pp. 359–373.
- CSL-2015-GabbayGP
- Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes (MJG, DRG, DP), pp. 374–389.
- CSL-2015-GradelP #exclamation #logic #rank
- Rank Logic is Dead, Long Live Rank Logic! (EG, WP), pp. 390–404.
- CSL-2015-GasconST #polynomial #strict #unification
- Two-Restricted One Context Unification is in Polynomial Time (AG, MSS, AT), pp. 405–422.
- CSL-2015-LiuJO #confluence #term rewriting
- Confluence of Layered Rewrite Systems (JL, JPJ, MO), pp. 423–440.
- CSL-2015-Kaiser0LL #approach #bound
- A Unified Approach to Boundedness Properties in MSO (LK, ML, SL, CL), pp. 441–456.
- CSL-2015-LehtinenQ
- Deciding the First Levels of the Modal μ Alternation Hierarchy by Formula Construction (KL, SQ), pp. 457–471.
- CSL-2015-KuskeLM #decidability #infinity #monad #word
- Infinite and Bi-infinite Words with Decidable Monadic Theories (DK, JL, AM), pp. 472–486.
- CSL-2015-Traytel #algebra
- A Coalgebraic Decision Procedure for WS1S (DT), pp. 487–503.
- CSL-2015-BrihayeBMR #reachability
- Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability (TB, VB, NM, JFR), pp. 504–518.
- CSL-2015-Klein0 #game studies #lookahead #what
- What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead (FK, MZ), pp. 519–533.
- CSL-2015-DuparcFH #ambiguity #on the
- On Unambiguous Regular Tree Languages of Index (0, 2) (JD, KF, SH), pp. 534–548.
- CSL-2015-BaeldeDS #fixpoint
- Least and Greatest Fixed Points in Ludics (DB, AD, AS), pp. 549–566.
- CSL-2015-BreuvartP #linear #logic #modelling #relational #semantics
- Modelling Coeffects in the Relational Semantics of Linear Logic (FB, MP), pp. 567–581.
- CSL-2015-AminiE #linear #logic #on the
- On Classical PCF, Linear Logic and the MIX Rule (SA, TE), pp. 582–596.
- CSL-2015-KieronskiK #equivalence
- Uniform One-Dimensional Fragments with One Equivalence Relation (EK, AK), pp. 597–615.
- CSL-2015-Paperman #first-order #logic
- Finite-Degree Predicates and Two-Variable First-Order Logic (CP), pp. 616–630.
- CSL-2015-Charatonik0 #linear #logic #order
- Two-variable Logic with Counting and a Linear Order (WC, PW), pp. 631–647.
- CSL-2015-MogaveroP #first-order #logic
- Binding Forms in First-Order Logic (FM, GP), pp. 648–665.

14 ×#logic

4 ×#first-order

4 ×#linear

3 ×#automaton

3 ×#finite

3 ×#higher-order

3 ×#on the

3 ×#semantics

2 ×#fixpoint

2 ×#model checking

4 ×#first-order

4 ×#linear

3 ×#automaton

3 ×#finite

3 ×#higher-order

3 ×#on the

3 ×#semantics

2 ×#fixpoint

2 ×#model checking