@Proceedings{kreutzer:LIPIcs.CSL.2015,
title = {{LIPIcs, Volume 41, CSL'15, Complete Volume}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015},
URN = {urn:nbn:de:0030-drops-54670},
doi = {10.4230/LIPIcs.CSL.2015},
annote = {Keywords: Conference Proceedings, Distributed Systems, Software/ Programs Verifications, Formal Definitions and Theory, Languages Constructs and Features, Knowledge Representations Formalisms and Methods, Theory of Computation, Mathematical Logic}
}
@InProceedings{kreutzer:LIPIcs.CSL.2015.i,
author = {Kreutzer, Stephan},
title = {{Front Matter, Table of Contents, Preface, Conference Organisation, External Reviewers}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {i--xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.i},
URN = {urn:nbn:de:0030-drops-54489},
doi = {10.4230/LIPIcs.CSL.2015.i},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organisation, External Reviewers}
}
@InProceedings{dawar_et_al:LIPIcs.CSL.2015.xv,
author = {Dawar, Anuj and Kozen, Dexter and Ronchi Della Rocca, Simona},
title = {{The Ackermann Award 2015}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {15--18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.xv},
URN = {urn:nbn:de:0030-drops-54470},
doi = {10.4230/LIPIcs.CSL.2015.xv},
annote = {Keywords: Ackermann Award}
}
@InProceedings{abadi:LIPIcs.CSL.2015.1,
author = {Abadi, Mart{\'\i}n},
title = {{The Prophecy of Timely Rollback}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {1--1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.1},
URN = {urn:nbn:de:0030-drops-54452},
doi = {10.4230/LIPIcs.CSL.2015.1},
annote = {Keywords: Dataflow, refinement, rollback}
}
@InProceedings{carapelle_et_al:LIPIcs.CSL.2015.2,
author = {Carapelle, Claudia and Lohrey, Markus},
title = {{Temporal Logics with Local Constraints}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {2--13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.2},
URN = {urn:nbn:de:0030-drops-54465},
doi = {10.4230/LIPIcs.CSL.2015.2},
annote = {Keywords: Temporal logics with constraints, concrete domains, LTL, CTL*, ECTL*}
}
@InProceedings{williams:LIPIcs.CSL.2015.14,
author = {Williams, R. Ryan},
title = {{Thinking Algorithmically About Impossibility}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {14--23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.14},
URN = {urn:nbn:de:0030-drops-54396},
doi = {10.4230/LIPIcs.CSL.2015.14},
annote = {Keywords: satisfiability, derandomization, circuit complexity}
}
@InProceedings{mazza:LIPIcs.CSL.2015.24,
author = {Mazza, Damiano},
title = {{Simple Parsimonious Types and Logarithmic Space}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {24--40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.24},
URN = {urn:nbn:de:0030-drops-54053},
doi = {10.4230/LIPIcs.CSL.2015.24},
annote = {Keywords: implicit computational complexity, linear logic, geometry of interaction}
}
@InProceedings{bova_et_al:LIPIcs.CSL.2015.41,
author = {Bova, Simone and Martin, Barnaby},
title = {{First-Order Queries on Finite Abelian Groups}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {41--59},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.41},
URN = {urn:nbn:de:0030-drops-54060},
doi = {10.4230/LIPIcs.CSL.2015.41},
annote = {Keywords: Finite Abelian Groups, First-Order Logic, Monadic Second-Order Logic}
}
@InProceedings{dawar_et_al:LIPIcs.CSL.2015.60,
author = {Dawar, Anuj and Wang, Pengming},
title = {{A Definability Dichotomy for Finite Valued CSPs}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {60--77},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.60},
URN = {urn:nbn:de:0030-drops-54078},
doi = {10.4230/LIPIcs.CSL.2015.60},
annote = {Keywords: descriptive complexity, constraint satisfaction, definability, fixed-point logic, optimization}
}
@InProceedings{cranen_et_al:LIPIcs.CSL.2015.78,
author = {Cranen, Sjoerd and Luttik, Bas and Willemse, Tim A. C.},
title = {{Evidence for Fixpoint Logic}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {78--93},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.78},
URN = {urn:nbn:de:0030-drops-54080},
doi = {10.4230/LIPIcs.CSL.2015.78},
annote = {Keywords: fixpoint logic, diagnostics, counterexample, model checking, stuttering bisimilarity, ACTL*}
}
@InProceedings{baaz_et_al:LIPIcs.CSL.2015.94,
author = {Baaz, Matthias and Ferm\"{u}ller, Christian G.},
title = {{Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {94--109},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.94},
URN = {urn:nbn:de:0030-drops-54097},
doi = {10.4230/LIPIcs.CSL.2015.94},
annote = {Keywords: Cut-elimination, sequent calculus, intuitionistic logic}
}
@InProceedings{hetzl_et_al:LIPIcs.CSL.2015.110,
author = {Hetzl, Stefan and Zivota, Sebastian},
title = {{Tree Grammars for the Elimination of Non-prenex Cuts}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {110--127},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.110},
URN = {urn:nbn:de:0030-drops-54103},
doi = {10.4230/LIPIcs.CSL.2015.110},
annote = {Keywords: proof theory, cut-elimination, Herbrand's theorem, tree grammars}
}
@InProceedings{schubert_et_al:LIPIcs.CSL.2015.128,
author = {Schubert, Aleksy and Dekkers, Wil and Barendregt, Henk P.},
title = {{Automata Theoretic Account of Proof Search}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {128--143},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.128},
URN = {urn:nbn:de:0030-drops-54113},
doi = {10.4230/LIPIcs.CSL.2015.128},
annote = {Keywords: simple types, automata, trees, languages of proofs}
}
@InProceedings{mazowiecki_et_al:LIPIcs.CSL.2015.144,
author = {Mazowiecki, Filip and Riveros, Cristian},
title = {{Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {144--159},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.144},
URN = {urn:nbn:de:0030-drops-54127},
doi = {10.4230/LIPIcs.CSL.2015.144},
annote = {Keywords: MSO, Finite Automata, Cost Register Automata, Weighted Automata, Weighted Logics, Semirings}
}
@InProceedings{carton_et_al:LIPIcs.CSL.2015.160,
author = {Carton, Olivier and Dartois, Luc},
title = {{Aperiodic Two-way Transducers and FO-Transductions}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {160--174},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.160},
URN = {urn:nbn:de:0030-drops-54133},
doi = {10.4230/LIPIcs.CSL.2015.160},
annote = {Keywords: Transducer, first-order, two-way, transition monoid, aperiodic}
}
@InProceedings{kupferman_et_al:LIPIcs.CSL.2015.175,
author = {Kupferman, Orna and Vardi, Gal},
title = {{On Relative and Probabilistic Finite Counterability}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {175--192},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.175},
URN = {urn:nbn:de:0030-drops-54147},
doi = {10.4230/LIPIcs.CSL.2015.175},
annote = {Keywords: Model Checking, Counterexamples, Safety, Liveness, Probability, omega-Regular Languages}
}
@InProceedings{molinari_et_al:LIPIcs.CSL.2015.193,
author = {Molinari, Alberto and Montanari, Angelo and Peron, Adriano},
title = {{A Model Checking Procedure for Interval Temporal Logics based on Track Representatives}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {193--210},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.193},
URN = {urn:nbn:de:0030-drops-54150},
doi = {10.4230/LIPIcs.CSL.2015.193},
annote = {Keywords: Interval Temporal Logic, Model Checking, Complexity}
}
@InProceedings{abramsky_et_al:LIPIcs.CSL.2015.211,
author = {Abramsky, Samson and Soares Barbosa, Rui and Kishida, Kohei and Lal, Raymond and Mansfield, Shane},
title = {{Contextuality, Cohomology and Paradox}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {211--228},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.211},
URN = {urn:nbn:de:0030-drops-54166},
doi = {10.4230/LIPIcs.CSL.2015.211},
annote = {Keywords: Quantum mechanics, contextuality, sheaf theory, cohomology, logical paradoxes}
}
@InProceedings{salvati_et_al:LIPIcs.CSL.2015.229,
author = {Salvati, Sylvain and Walukiewicz, Igor},
title = {{A Model for Behavioural Properties of Higher-order Programs}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {229--243},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.229},
URN = {urn:nbn:de:0030-drops-54173},
doi = {10.4230/LIPIcs.CSL.2015.229},
annote = {Keywords: Simply typed lambda-Y-calculus, Monadic second order logic, semantic models}
}
@InProceedings{clemente_et_al:LIPIcs.CSL.2015.244,
author = {Clemente, Lorenzo and Lasota, Slawomir},
title = {{Reachability Analysis of First-order Definable Pushdown Systems}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {244--259},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.244},
URN = {urn:nbn:de:0030-drops-54185},
doi = {10.4230/LIPIcs.CSL.2015.244},
annote = {Keywords: automata theory, pushdown systems, sets with atoms, saturation technique}
}
@InProceedings{grellois_et_al:LIPIcs.CSL.2015.260,
author = {Grellois, Charles and Melli\`{e}s, Paul-Andr\'{e}},
title = {{Relational Semantics of Linear Logic and Higher-order Model Checking}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {260--276},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.260},
URN = {urn:nbn:de:0030-drops-54190},
doi = {10.4230/LIPIcs.CSL.2015.260},
annote = {Keywords: Higher-order model-checking, linear logic, relational semantics, parity games, parametric comonads.}
}
@InProceedings{kontinen_et_al:LIPIcs.CSL.2015.277,
author = {Kontinen, Juha and M\"{u}ller, Julian-Steffen and Schnoor, Henning and Vollmer, Heribert},
title = {{A Van Benthem Theorem for Modal Team Semantics}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {277--291},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.277},
URN = {urn:nbn:de:0030-drops-54206},
doi = {10.4230/LIPIcs.CSL.2015.277},
annote = {Keywords: modal logic, dependence logic, team semantics, expressivity, bisimulation, independence, inclusion, generalized dependence atom}
}
@InProceedings{sano_et_al:LIPIcs.CSL.2015.292,
author = {Sano, Katsuhiko and Virtema, Jonni},
title = {{Axiomatizing Propositional Dependence Logics}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {292--307},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.292},
URN = {urn:nbn:de:0030-drops-54215},
doi = {10.4230/LIPIcs.CSL.2015.292},
annote = {Keywords: propositional dependence logic, modal dependence logic, axiomatization, tableau calculus}
}
@InProceedings{schwentick_et_al:LIPIcs.CSL.2015.308,
author = {Schwentick, Thomas and Vortmeier, Nils and Zeume, Thomas},
title = {{Static Analysis for Logic-based Dynamic Programs}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {308--324},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.308},
URN = {urn:nbn:de:0030-drops-54221},
doi = {10.4230/LIPIcs.CSL.2015.308},
annote = {Keywords: Dynamic descriptive complexity, algorithmic problems, emptiness, history independence, consistency}
}
@InProceedings{brotherston_et_al:LIPIcs.CSL.2015.325,
author = {Brotherston, James and Villard, Jules},
title = {{Sub-classical Boolean Bunched Logics and the Meaning of Par}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {325--342},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.325},
URN = {urn:nbn:de:0030-drops-54234},
doi = {10.4230/LIPIcs.CSL.2015.325},
annote = {Keywords: Bunched logic, linear logic, modal logic, Kripke semantics, model theory}
}
@InProceedings{berardi:LIPIcs.CSL.2015.343,
author = {Berardi, Stefano},
title = {{Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {343--358},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.343},
URN = {urn:nbn:de:0030-drops-54246},
doi = {10.4230/LIPIcs.CSL.2015.343},
annote = {Keywords: Intuitionism, Inductive Definitions, Proof Theory, impredicativity, omega rule}
}
@InProceedings{capriotti_et_al:LIPIcs.CSL.2015.359,
author = {Capriotti, Paolo and Kraus, Nicolai and Vezzosi, Andrea},
title = {{Functions out of Higher Truncations}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {359--373},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.359},
URN = {urn:nbn:de:0030-drops-54257},
doi = {10.4230/LIPIcs.CSL.2015.359},
annote = {Keywords: homotopy type theory, truncation elimination, constancy on loop spaces}
}
@InProceedings{gabbay_et_al:LIPIcs.CSL.2015.374,
author = {Gabbay, Murdoch J. and Ghica, Dan R. and Petrisan, Daniela},
title = {{Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {374--389},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.374},
URN = {urn:nbn:de:0030-drops-54262},
doi = {10.4230/LIPIcs.CSL.2015.374},
annote = {Keywords: nominal sets, scope, alpha equivalence, dynamic sequences}
}
@InProceedings{gradel_et_al:LIPIcs.CSL.2015.390,
author = {Gr\"{a}del, Erich and Pakusa, Wied},
title = {{Rank Logic is Dead, Long Live Rank Logic!}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {390--404},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.390},
URN = {urn:nbn:de:0030-drops-54279},
doi = {10.4230/LIPIcs.CSL.2015.390},
annote = {Keywords: logic, descriptive complexity, polynomial time, rank logic}
}
@InProceedings{gascon_et_al:LIPIcs.CSL.2015.405,
author = {Gasc\'{o}n, Adri\`{a} and Schmidt-Schau{\ss}, Manfred and Tiwari, Ashish},
title = {{Two-Restricted One Context Unification is in Polynomial Time}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {405--422},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.405},
URN = {urn:nbn:de:0030-drops-54289},
doi = {10.4230/LIPIcs.CSL.2015.405},
annote = {Keywords: context unification, first-order unification, deduction, type checking}
}
@InProceedings{liu_et_al:LIPIcs.CSL.2015.423,
author = {Liu, Jiaxiang and Jouannaud, Jean-Pierre and Ogawa, Mizuhito},
title = {{Confluence of Layered Rewrite Systems}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {423--440},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.423},
URN = {urn:nbn:de:0030-drops-54293},
doi = {10.4230/LIPIcs.CSL.2015.423},
annote = {Keywords: Layers, confluence, decreasing diagrams, critical pairs, cyclic unification}
}
@InProceedings{kaiser_et_al:LIPIcs.CSL.2015.441,
author = {Kaiser, Lukasz and Lang, Martin and Le{\ss}enich, Simon and L\"{o}ding, Christof},
title = {{A Unified Approach to Boundedness Properties in MSO}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {441--456},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.441},
URN = {urn:nbn:de:0030-drops-54309},
doi = {10.4230/LIPIcs.CSL.2015.441},
annote = {Keywords: quantitative logics, monadic second order logic, boundedness, automatic structures, tree automata}
}
@InProceedings{lehtinen_et_al:LIPIcs.CSL.2015.457,
author = {Lehtinen, Karoliina and Quickert, Sandra},
title = {{Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {457--471},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.457},
URN = {urn:nbn:de:0030-drops-54316},
doi = {10.4230/LIPIcs.CSL.2015.457},
annote = {Keywords: modal mu calculus, fixpoint logic, alternation hierarchy}
}
@InProceedings{kuske_et_al:LIPIcs.CSL.2015.472,
author = {Kuske, Dietrich and Liu, Jiamou and Moskvina, Anastasia},
title = {{Infinite and Bi-infinite Words with Decidable Monadic Theories}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {472--486},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.472},
URN = {urn:nbn:de:0030-drops-54325},
doi = {10.4230/LIPIcs.CSL.2015.472},
annote = {Keywords: infinite words, bi-infinite words, monadic second order logic}
}
@InProceedings{traytel:LIPIcs.CSL.2015.487,
author = {Traytel, Dmitriy},
title = {{A Coalgebraic Decision Procedure for WS1S}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {487--503},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.487},
URN = {urn:nbn:de:0030-drops-54335},
doi = {10.4230/LIPIcs.CSL.2015.487},
annote = {Keywords: WS1S, decision procedure, coalgebra, Brzozowski derivatives, Isabelle}
}
@InProceedings{brihaye_et_al:LIPIcs.CSL.2015.504,
author = {Brihaye, Thomas and Bruy\`{e}re, V\'{e}ronique and Meunier, No\'{e}mie and Raskin, Jean-Francois},
title = {{Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {504--518},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.504},
URN = {urn:nbn:de:0030-drops-54345},
doi = {10.4230/LIPIcs.CSL.2015.504},
annote = {Keywords: multi-player games on graphs, quantitative objectives, Nash equilibrium, subgame perfect equilibrium, quantitative reachability}
}
@InProceedings{klein_et_al:LIPIcs.CSL.2015.519,
author = {Klein, Felix and Zimmermann, Martin},
title = {{What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {519--533},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.519},
URN = {urn:nbn:de:0030-drops-54354},
doi = {10.4230/LIPIcs.CSL.2015.519},
annote = {Keywords: Determinacy, Infinite Games, Delay Games, Borel Hierarchy}
}
@InProceedings{duparc_et_al:LIPIcs.CSL.2015.534,
author = {Duparc, Jacques and Fournier, Kevin and Hummel, Szczepan},
title = {{On Unambiguous Regular Tree Languages of Index (0,2)}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {534--548},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.534},
URN = {urn:nbn:de:0030-drops-54369},
doi = {10.4230/LIPIcs.CSL.2015.534},
annote = {Keywords: Tree Automata, Unambiguity, Wadge Hierarchy.}
}
@InProceedings{baelde_et_al:LIPIcs.CSL.2015.549,
author = {Baelde, David and Doumane, Amina and Saurin, Alexis},
title = {{Least and Greatest Fixed Points in Ludics}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {549--566},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.549},
URN = {urn:nbn:de:0030-drops-54374},
doi = {10.4230/LIPIcs.CSL.2015.549},
annote = {Keywords: proof theory, fixed points, linear logic, ludics, game semantics, completeness, circular proofs, infinitary proof systems}
}
@InProceedings{breuvart_et_al:LIPIcs.CSL.2015.567,
author = {Breuvart, Flavien and Pagani, Michele},
title = {{Modelling Coeffects in the Relational Semantics of Linear Logic}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {567--581},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.567},
URN = {urn:nbn:de:0030-drops-54384},
doi = {10.4230/LIPIcs.CSL.2015.567},
annote = {Keywords: relational semantics, bounded linear logic, lambda calculus}
}
@InProceedings{amini_et_al:LIPIcs.CSL.2015.582,
author = {Amini, Shahin and Erhard, Thomas},
title = {{On Classical PCF, Linear Logic and the MIX Rule}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {582--596},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.582},
URN = {urn:nbn:de:0030-drops-54402},
doi = {10.4230/LIPIcs.CSL.2015.582},
annote = {Keywords: lambda-calculus, linear logic, classical logic, denotational semantics}
}
@InProceedings{kieronski_et_al:LIPIcs.CSL.2015.597,
author = {Kier\'{o}nski, Emanuel and Kuusisto, Antti},
title = {{Uniform One-Dimensional Fragments with One Equivalence Relation}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {597--615},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.597},
URN = {urn:nbn:de:0030-drops-54418},
doi = {10.4230/LIPIcs.CSL.2015.597},
annote = {Keywords: two-variable logic, uniform one-dimensional fragments, complexity, expressivity, equivalence relations}
}
@InProceedings{paperman:LIPIcs.CSL.2015.616,
author = {Paperman, Charles},
title = {{Finite-Degree Predicates and Two-Variable First-Order Logic}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {616--630},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.616},
URN = {urn:nbn:de:0030-drops-54420},
doi = {10.4230/LIPIcs.CSL.2015.616},
annote = {Keywords: First order logic, automata theory, semigroup, modular predicates}
}
@InProceedings{charatonik_et_al:LIPIcs.CSL.2015.631,
author = {Charatonik, Witold and Witkowski, Piotr},
title = {{Two-variable Logic with Counting and a Linear Order}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {631--647},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.631},
URN = {urn:nbn:de:0030-drops-54436},
doi = {10.4230/LIPIcs.CSL.2015.631},
annote = {Keywords: Two-variable logic, counting quantifiers, linear order, satisfiability, complexity}
}
@InProceedings{mogavero_et_al:LIPIcs.CSL.2015.648,
author = {Mogavero, Fabio and Perelli, Giuseppe},
title = {{Binding Forms in First-Order Logic}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {648--665},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Kreutzer, Stephan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.648},
URN = {urn:nbn:de:0030-drops-54443},
doi = {10.4230/LIPIcs.CSL.2015.648},
annote = {Keywords: First-Order Logic, Decidable Fragments, Satisfiability, Model Checking}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing