@Proceedings{bezem:LIPIcs.CSL.2011,
title = {{LIPIcs, Volume 12, CSL'11, Complete Volume}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2013},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011},
URN = {urn:nbn:de:0030-drops-41066},
doi = {10.4230/LIPIcs.CSL.2011},
annote = {Keywords: Conference Proceedings; Software; Theory of Computation; Graph Theory; Probability and Statistics; Artificial Intelligence}
}
@InProceedings{bezem:LIPIcs.CSL.2011.i,
author = {Bezem, Marc},
title = {{Frontmatter, Table of Contents, Preface, Conference Organization}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {i--xix},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.i},
URN = {urn:nbn:de:0030-drops-32144},
doi = {10.4230/LIPIcs.CSL.2011.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{ehrhard:LIPIcs.CSL.2011.1,
author = {Ehrhard, Thomas},
title = {{Resource Lambda-Calculus: the Differential Viewpoint}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {1--1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.1},
URN = {urn:nbn:de:0030-drops-32152},
doi = {10.4230/LIPIcs.CSL.2011.1},
annote = {Keywords: proof theory, lambda-calculus, linear logic, denotational semantics}
}
@InProceedings{otto:LIPIcs.CSL.2011.2,
author = {Otto, Martin},
title = {{The Freedoms of Guarded Bisimulation}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {2--2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.2},
URN = {urn:nbn:de:0030-drops-32163},
doi = {10.4230/LIPIcs.CSL.2011.2},
annote = {Keywords: model theory, guarded logic, bisimulation, hypergraphs}
}
@InProceedings{vardi:LIPIcs.CSL.2011.3,
author = {Vardi, Moshe Y.},
title = {{Branching vs. Linear Time: Semantical Perspective}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {3--3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.3},
URN = {urn:nbn:de:0030-drops-32173},
doi = {10.4230/LIPIcs.CSL.2011.3},
annote = {Keywords: linear time, branching time, process equivalence, contextual equivalence}
}
@InProceedings{wolter:LIPIcs.CSL.2011.4,
author = {Wolter, Frank},
title = {{Ontology-Based Data Access and Constraint Satisfaction}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {4--4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.4},
URN = {urn:nbn:de:0030-drops-32186},
doi = {10.4230/LIPIcs.CSL.2011.4},
annote = {Keywords: description logic, constraint satisfaction, conjunctive query}
}
@InProceedings{adamek_et_al:LIPIcs.CSL.2011.5,
author = {Adamek, Jiri and Milius, Stefan and Moss, Lawrence S. and Sousa, Lurdes},
title = {{Power-Set Functors and Saturated Trees}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {5--19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.5},
URN = {urn:nbn:de:0030-drops-32194},
doi = {10.4230/LIPIcs.CSL.2011.5},
annote = {Keywords: saturated tree, extensional tree, final coalgebra, power-set functor, modal logic}
}
@InProceedings{aschieri:LIPIcs.CSL.2011.20,
author = {Aschieri, Federico},
title = {{Transfinite Update Procedures for Predicative Systems of Analysis}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {20--34},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.20},
URN = {urn:nbn:de:0030-drops-32200},
doi = {10.4230/LIPIcs.CSL.2011.20},
annote = {Keywords: update procedure, epsilon substitution method, predicative classical analysis, bar recursion}
}
@InProceedings{beauxis_et_al:LIPIcs.CSL.2011.35,
author = {Beauxis, Romain and Mimram, Samuel},
title = {{A Non-Standard Semantics for Kahn Networks in Continuous Time}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {35--50},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.35},
URN = {urn:nbn:de:0030-drops-32212},
doi = {10.4230/LIPIcs.CSL.2011.35},
annote = {Keywords: Kahn network, non-standard analysis, fixpoint category, internal cpo}
}
@InProceedings{bernadet_et_al:LIPIcs.CSL.2011.51,
author = {Bernadet, Alexis and Lengrand, St\'{e}phane},
title = {{Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {51--66},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.51},
URN = {urn:nbn:de:0030-drops-32226},
doi = {10.4230/LIPIcs.CSL.2011.51},
annote = {Keywords: non-idempotent intersections, System F, realisability}
}
@InProceedings{bes_et_al:LIPIcs.CSL.2011.67,
author = {B\`{e}s, Alexis and Carton, Olivier},
title = {{Algebraic Characterization of FO for Scattered Linear Orderings}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {67--81},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.67},
URN = {urn:nbn:de:0030-drops-32233},
doi = {10.4230/LIPIcs.CSL.2011.67},
annote = {Keywords: linear orderings, first-order logic, semigroups, rational sets}
}
@InProceedings{boker_et_al:LIPIcs.CSL.2011.82,
author = {Boker, Udi and Henzinger, Thomas A.},
title = {{Determinizing Discounted-Sum Automata}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {82--96},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.82},
URN = {urn:nbn:de:0030-drops-32243},
doi = {10.4230/LIPIcs.CSL.2011.82},
annote = {Keywords: Discounted-sum automata, determinization, quantitative verification}
}
@InProceedings{bucciarelli_et_al:LIPIcs.CSL.2011.97,
author = {Bucciarelli, Antonio and Carraro, Alberto and Ehrhard, Thomas and Manzonetto, Giulio},
title = {{Full Abstraction for Resource Calculus with Tests}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {97--111},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.97},
URN = {urn:nbn:de:0030-drops-32250},
doi = {10.4230/LIPIcs.CSL.2011.97},
annote = {Keywords: resource lambda calculus, relational semantics, full abstraction, differential linear logic}
}
@InProceedings{cai_et_al:LIPIcs.CSL.2011.112,
author = {Cai, Yang and Zhang, Ting},
title = {{Tight Upper Bounds for Streett and Parity Complementation}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {112--128},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.112},
URN = {urn:nbn:de:0030-drops-32269},
doi = {10.4230/LIPIcs.CSL.2011.112},
annote = {Keywords: Streett automata, omega-automata, parity automata, complementation, upper bounds}
}
@InProceedings{cantone_et_al:LIPIcs.CSL.2011.129,
author = {Cantone, Domenico and Longo, Cristiano and Nicolosi Asmundo, Marianna},
title = {{A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {129--143},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.129},
URN = {urn:nbn:de:0030-drops-32278},
doi = {10.4230/LIPIcs.CSL.2011.129},
annote = {Keywords: NP-complete decision procedures, set theory, description logic}
}
@InProceedings{cardelli_et_al:LIPIcs.CSL.2011.144,
author = {Cardelli, Luca and Larsen, Kim G. and Mardare, Radu},
title = {{Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of Formulas}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {144--158},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.144},
URN = {urn:nbn:de:0030-drops-32281},
doi = {10.4230/LIPIcs.CSL.2011.144},
annote = {Keywords: probabilistic logic, axiomatization, Markov processes, metric semantics}
}
@InProceedings{chaudhuri_et_al:LIPIcs.CSL.2011.159,
author = {Chaudhuri, Kaustuv and Guenot, Nicolas and Stra{\ss}burger, Lutz},
title = {{The Focused Calculus of Structures}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {159--173},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.159},
URN = {urn:nbn:de:0030-drops-32297},
doi = {10.4230/LIPIcs.CSL.2011.159},
annote = {Keywords: focusing, polarity, calculus of structures, linear logic}
}
@InProceedings{czajka:LIPIcs.CSL.2011.174,
author = {Czajka, Lukasz},
title = {{A Semantic Approach to Illative Combinatory Logic}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {174--188},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.174},
URN = {urn:nbn:de:0030-drops-32303},
doi = {10.4230/LIPIcs.CSL.2011.174},
annote = {Keywords: illative combinatory logic, term rewriting, first-order logic}
}
@InProceedings{durand_et_al:LIPIcs.CSL.2011.189,
author = {Durand, Arnaud and Strozecki, Yann},
title = {{Enumeration Complexity of Logical Query Problems with Second-order Variables}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {189--202},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.189},
URN = {urn:nbn:de:0030-drops-32313},
doi = {10.4230/LIPIcs.CSL.2011.189},
annote = {Keywords: descriptive complexity, enumeration, query problem}
}
@InProceedings{egri:LIPIcs.CSL.2011.203,
author = {Egri, L\'{a}szl\'{o}},
title = {{On Constraint Satisfaction Problems below P*}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {203--217},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.203},
URN = {urn:nbn:de:0030-drops-32320},
doi = {10.4230/LIPIcs.CSL.2011.203},
annote = {Keywords: constraint satisfaction problems, complexity classes, Datalog fragments}
}
@InProceedings{eickmeyer:LIPIcs.CSL.2011.218,
author = {Eickmeyer, Kord},
title = {{Non-Definability Results for Randomised First-Order Logic}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {218--232},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.218},
URN = {urn:nbn:de:0030-drops-32333},
doi = {10.4230/LIPIcs.CSL.2011.218},
annote = {Keywords: descriptive complexity, randomised logics, derandomisation}
}
@InProceedings{escardo_et_al:LIPIcs.CSL.2011.233,
author = {Escardo, Martin and Oliva, Paulo and Powell, Thomas},
title = {{System T and the Product of Selection Functions}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {233--247},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.233},
URN = {urn:nbn:de:0030-drops-32341},
doi = {10.4230/LIPIcs.CSL.2011.233},
annote = {Keywords: primitive recursion, product of selection functions, finite choice, dialectica interpretation}
}
@InProceedings{fogarty_et_al:LIPIcs.CSL.2011.248,
author = {Fogarty, Seth and Kupferman, Orna and Vardi, Moshe Y. and Wilke, Thomas},
title = {{Unifying B\"{u}chi Complementation Constructions}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {248--263},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.248},
URN = {urn:nbn:de:0030-drops-32357},
doi = {10.4230/LIPIcs.CSL.2011.248},
annote = {Keywords: B\"{u}chi automata, complementation, ranks, determinism in the limit}
}
@InProceedings{fridman_et_al:LIPIcs.CSL.2011.264,
author = {Fridman, Wladimir and L\"{o}ding, Christof and Zimmermann, Martin},
title = {{Degrees of Lookahead in Context-free Infinite Games}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {264--276},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.264},
URN = {urn:nbn:de:0030-drops-32365},
doi = {10.4230/LIPIcs.CSL.2011.264},
annote = {Keywords: infinite games, delay, context-free languages}
}
@InProceedings{grohe_et_al:LIPIcs.CSL.2011.277,
author = {Grohe, Martin and Gru{\ss}ien, Berit and Hernich, Andr\'{e} and Laubner, Bastian},
title = {{L-Recursion and a new Logic for Logarithmic Space}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {277--291},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.277},
URN = {urn:nbn:de:0030-drops-32373},
doi = {10.4230/LIPIcs.CSL.2011.277},
annote = {Keywords: descriptive complexity, logarithmic space, fixed-point logics}
}
@InProceedings{jeffrey_et_al:LIPIcs.CSL.2011.292,
author = {Jeffrey, Alan and Rathke, Julian},
title = {{The Lax Braided Structure of Streaming I/O}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {292--306},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.292},
URN = {urn:nbn:de:0030-drops-32386},
doi = {10.4230/LIPIcs.CSL.2011.292},
annote = {Keywords: semantics, categorical models, streaming I/O, Agda}
}
@InProceedings{jenkins_et_al:LIPIcs.CSL.2011.307,
author = {Jenkins, Mark and Ouaknine, Jo\"{e}l and Rabinovich, Alexander and Worrell, James},
title = {{The Church Synthesis Problem with Metric}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {307--321},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.307},
URN = {urn:nbn:de:0030-drops-32390},
doi = {10.4230/LIPIcs.CSL.2011.307},
annote = {Keywords: Church's Problem, monadic logic, games, uniformization}
}
@InProceedings{kartzow:LIPIcs.CSL.2011.322,
author = {Kartzow, Alexander},
title = {{A Pumping Lemma for Collapsible Pushdown Graphs of Level 2}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {322--336},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.322},
URN = {urn:nbn:de:0030-drops-32406},
doi = {10.4230/LIPIcs.CSL.2011.322},
annote = {Keywords: collapsible pushdown graph, epsilon-contraction, pumping lemma}
}
@InProceedings{kieronski:LIPIcs.CSL.2011.337,
author = {Kieronski, Emanuel},
title = {{Decidability Issues for Two-Variable Logics with Several Linear Orders}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {337--351},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.337},
URN = {urn:nbn:de:0030-drops-32415},
doi = {10.4230/LIPIcs.CSL.2011.337},
annote = {Keywords: two-variable logic, linear orders, guarded fragment, decidability}
}
@InProceedings{komendantskaya_et_al:LIPIcs.CSL.2011.352,
author = {Komendantskaya, Ekaterina and Power, John},
title = {{Coalgebraic Derivations in Logic Programming}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {352--366},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.352},
URN = {urn:nbn:de:0030-drops-32424},
doi = {10.4230/LIPIcs.CSL.2011.352},
annote = {Keywords: Logic programming, SLD-resolution, concurrency, coinduction, Lawvere theoriesm, coinductive logic programming, concurrent logic programming}
}
@InProceedings{kopczynski:LIPIcs.CSL.2011.367,
author = {Kopczynski, Eryk},
title = {{Trees in Trees: Is the Incomplete Information about a Tree Consistent?}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {367--380},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.367},
URN = {urn:nbn:de:0030-drops-32434},
doi = {10.4230/LIPIcs.CSL.2011.367},
annote = {Keywords: XML, tree automata, incomplete tree descriptions, Euler cycle}
}
@InProceedings{le_et_al:LIPIcs.CSL.2011.381,
author = {L\^{e}, Dai Tri Man and Cook, Stephen A. and Ye, Yuli},
title = {{A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {381--395},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.381},
URN = {urn:nbn:de:0030-drops-32440},
doi = {10.4230/LIPIcs.CSL.2011.381},
annote = {Keywords: bounded arithmetic, complexity theory, comparator circuits}
}
@InProceedings{losch_et_al:LIPIcs.CSL.2011.396,
author = {L\"{o}sch, Steffen and Pitts, Andrew M.},
title = {{Relating Two Semantics of Locally Scoped Names}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {396--411},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.396},
URN = {urn:nbn:de:0030-drops-32454},
doi = {10.4230/LIPIcs.CSL.2011.396},
annote = {Keywords: local names, continuations, typed lambda-calculus, observational equivalence}
}
@InProceedings{lustig_et_al:LIPIcs.CSL.2011.412,
author = {Lustig, Yoad and Nain, Sumit and Vardi, Moshe Y.},
title = {{Synthesis from Probabilistic Components}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {412--427},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.412},
URN = {urn:nbn:de:0030-drops-32461},
doi = {10.4230/LIPIcs.CSL.2011.412},
annote = {Keywords: temporal synthesis, probabilistic components}
}
@InProceedings{madhusudan:LIPIcs.CSL.2011.428,
author = {Madhusudan, Parthasarathy},
title = {{Synthesizing Reactive Programs}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {428--442},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.428},
URN = {urn:nbn:de:0030-drops-32479},
doi = {10.4230/LIPIcs.CSL.2011.428},
annote = {Keywords: program synthesis, boolean programs, automata theory, temporal logics}
}
@InProceedings{minermore_et_al:LIPIcs.CSL.2011.443,
author = {Miner More, Sara and Naumov, Pavel and Sapp, Benjamin},
title = {{Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {443--457},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.443},
URN = {urn:nbn:de:0030-drops-32480},
doi = {10.4230/LIPIcs.CSL.2011.443},
annote = {Keywords: independence, concurrency, information flow, axiomatization}
}
@InProceedings{polonsky:LIPIcs.CSL.2011.458,
author = {Polonsky, Andrew},
title = {{Axiomatizing the Quote}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {458--469},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.458},
URN = {urn:nbn:de:0030-drops-32493},
doi = {10.4230/LIPIcs.CSL.2011.458},
annote = {Keywords: lambda calculus, combinatory logic, quote operator, enumerator}
}
@InProceedings{reus_et_al:LIPIcs.CSL.2011.470,
author = {Reus, Bernhard and Streicher, Thomas},
title = {{Relative Completeness for Logics of Functional Programs}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {470--480},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.470},
URN = {urn:nbn:de:0030-drops-32509},
doi = {10.4230/LIPIcs.CSL.2011.470},
annote = {Keywords: completeness, program logics, LCF}
}
@InProceedings{schnabl_et_al:LIPIcs.CSL.2011.481,
author = {Schnabl, Andreas and Simonsen, Jakob Grue},
title = {{The Exact Hardness of Deciding Derivational and Runtime Complexity}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {481--495},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.481},
URN = {urn:nbn:de:0030-drops-32516},
doi = {10.4230/LIPIcs.CSL.2011.481},
annote = {Keywords: term rewriting, derivational complexity, arithmetical hierarchy}
}
@InProceedings{schwencke:LIPIcs.CSL.2011.496,
author = {Schwencke, Daniel},
title = {{A Category Theoretic View of Nondeterministic Recursive Program Schemes}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {496--511},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.496},
URN = {urn:nbn:de:0030-drops-32529},
doi = {10.4230/LIPIcs.CSL.2011.496},
annote = {Keywords: recursive program scheme, nondeterminism, powerset monad, distributive law, final coalgebra}
}
@InProceedings{schwinghammer_et_al:LIPIcs.CSL.2011.512,
author = {Schwinghammer, Jan and Birkedal, Lars},
title = {{Step-Indexed Relational Reasoning for Countable Nondeterminism}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {512--524},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.512},
URN = {urn:nbn:de:0030-drops-32535},
doi = {10.4230/LIPIcs.CSL.2011.512},
annote = {Keywords: countable choice, lambda calculus, program equivalence}
}
@InProceedings{straubing:LIPIcs.CSL.2011.525,
author = {Straubing, Howard},
title = {{Algebraic Characterization of the Alternation Hierarchy in FO^2\lbrack\langle\rbrack on Finite Words}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {525--537},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.525},
URN = {urn:nbn:de:0030-drops-32549},
doi = {10.4230/LIPIcs.CSL.2011.525},
annote = {Keywords: automata, finite model theory}
}
@InProceedings{tatsuta_et_al:LIPIcs.CSL.2011.538,
author = {Tatsuta, Makoto and Berardi, Stefano},
title = {{Non-Commutative Infinitary Peano Arithmetic}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {538--552},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.538},
URN = {urn:nbn:de:0030-drops-32551},
doi = {10.4230/LIPIcs.CSL.2011.538},
annote = {Keywords: proof theory, cut elimination, intuitionistic logic, infinitary logic, recursive omega rules, substructural logic}
}
@InProceedings{makowsky:LIPIcs.CSL.2011.553,
author = {Makowsky, Johann A.},
title = {{Model Theory in Computer Science: My Own Recurrent Themes}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {553--567},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Bezem, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.553},
URN = {urn:nbn:de:0030-drops-32567},
doi = {10.4230/LIPIcs.CSL.2011.553},
annote = {Keywords: model theory, finite model theory, databases, graph invariants}
}
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