Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@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} }
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. i-xix, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Thomas Ehrhard. Resource Lambda-Calculus: the Differential Viewpoint. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Martin Otto. The Freedoms of Guarded Bisimulation. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, p. 2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Moshe Y. Vardi. Branching vs. Linear Time: Semantical Perspective. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, p. 3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Frank Wolter. Ontology-Based Data Access and Constraint Satisfaction. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, p. 4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Jiri Adamek, Stefan Milius, Lawrence S. Moss, and Lurdes Sousa. Power-Set Functors and Saturated Trees. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 5-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Federico Aschieri. Transfinite Update Procedures for Predicative Systems of Analysis. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 20-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Romain Beauxis and Samuel Mimram. A Non-Standard Semantics for Kahn Networks in Continuous Time. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 35-50, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Alexis Bernadet and Stéphane Lengrand. Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 51-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Alexis Bès and Olivier Carton. Algebraic Characterization of FO for Scattered Linear Orderings. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 67-81, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Udi Boker and Thomas A. Henzinger. Determinizing Discounted-Sum Automata. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 82-96, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Antonio Bucciarelli, Alberto Carraro, Thomas Ehrhard, and Giulio Manzonetto. Full Abstraction for Resource Calculus with Tests. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 97-111, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Yang Cai and Ting Zhang. Tight Upper Bounds for Streett and Parity Complementation. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 112-128, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Domenico Cantone, Cristiano Longo, and Marianna Nicolosi Asmundo. A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 129-143, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Luca Cardelli, Kim G. Larsen, and Radu Mardare. Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of Formulas. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 144-158, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Kaustuv Chaudhuri, Nicolas Guenot, and Lutz Straßburger. The Focused Calculus of Structures. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 159-173, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Lukasz Czajka. A Semantic Approach to Illative Combinatory Logic. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 174-188, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Arnaud Durand and Yann Strozecki. Enumeration Complexity of Logical Query Problems with Second-order Variables. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 189-202, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
László Egri. On Constraint Satisfaction Problems below P*. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 203-217, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Kord Eickmeyer. Non-Definability Results for Randomised First-Order Logic. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 218-232, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Martin Escardo, Paulo Oliva, and Thomas Powell. System T and the Product of Selection Functions. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 233-247, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, and Thomas Wilke. Unifying Büchi Complementation Constructions. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 248-263, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Wladimir Fridman, Christof Löding, and Martin Zimmermann. Degrees of Lookahead in Context-free Infinite Games. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 264-276, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Martin Grohe, Berit Grußien, André Hernich, and Bastian Laubner. L-Recursion and a new Logic for Logarithmic Space. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 277-291, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Alan Jeffrey and Julian Rathke. The Lax Braided Structure of Streaming I/O. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 292-306, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, and James Worrell. The Church Synthesis Problem with Metric. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 307-321, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Alexander Kartzow. A Pumping Lemma for Collapsible Pushdown Graphs of Level 2. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 322-336, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Emanuel Kieronski. Decidability Issues for Two-Variable Logics with Several Linear Orders. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 337-351, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Ekaterina Komendantskaya and John Power. Coalgebraic Derivations in Logic Programming. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 352-366, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Eryk Kopczynski. Trees in Trees: Is the Incomplete Information about a Tree Consistent?. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 367-380, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Dai Tri Man Lê, Stephen A. Cook, and Yuli Ye. A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 381-395, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Steffen Lösch and Andrew M. Pitts. Relating Two Semantics of Locally Scoped Names. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 396-411, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Yoad Lustig, Sumit Nain, and Moshe Y. Vardi. Synthesis from Probabilistic Components. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 412-427, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Parthasarathy Madhusudan. Synthesizing Reactive Programs. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 428-442, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Sara Miner More, Pavel Naumov, and Benjamin Sapp. Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 443-457, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Andrew Polonsky. Axiomatizing the Quote. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 458-469, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Bernhard Reus and Thomas Streicher. Relative Completeness for Logics of Functional Programs. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 470-480, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Andreas Schnabl and Jakob Grue Simonsen. The Exact Hardness of Deciding Derivational and Runtime Complexity. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 481-495, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Daniel Schwencke. A Category Theoretic View of Nondeterministic Recursive Program Schemes. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 496-511, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Jan Schwinghammer and Lars Birkedal. Step-Indexed Relational Reasoning for Countable Nondeterminism. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 512-524, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Howard Straubing. Algebraic Characterization of the Alternation Hierarchy in FO^2[<] on Finite Words. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 525-537, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Makoto Tatsuta and Stefano Berardi. Non-Commutative Infinitary Peano Arithmetic. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 538-552, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }
Johann A. Makowsky. Model Theory in Computer Science: My Own Recurrent Themes. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 553-567, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@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} }