Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCID24th CSL 2010: Brno, Czech Republic
- Anuj Dawar
, Helmut Veith:
Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings. Lecture Notes in Computer Science 6247, Springer 2010, ISBN 978-3-642-15204-7
Invited Talks
- David A. Basin, Cas J. F. Cremers:
Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries. 1-18 - Erich Grädel:
Definability in Games. 19-21 - Jan Krajícek:
From Feasible Proofs to Feasible Computations. 22-31 - Andrei A. Krokhin:
Tree Dualities for Constraint Satisfaction. 32-33 - Viktor Kuncak, Ruzica Piskac, Philippe Suter:
Ordered Sets in the Calculus of Data Structures. 34-48 - Peter W. O'Hearn:
Abductive, Inductive and Deductive Reasoning about Resources. 49-50 - Andrey Rybalchenko:
Constraint Solving for Program Verification: Theory and Practice by Example. 51
Contributed Papers
- Régis Alenda, Nicola Olivetti, Camilla Schwind, Dmitry Tishkovsky:
Tableau Calculi for CSL\mathcal{CSL} over minspaces. 52-66 - Matthias Baaz, Christian G. Fermüller:
A Resolution Mechanism for Prenex Gödel Logic. 67-79 - Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin:
Efficient Enumeration for Conjunctive Queries over X-underbar Structures. 80-94 - Aditi Barthwal, Michael Norrish:
A Formalisation of the Normal Forms of Context-Free Grammars in HOL4. 95-109 - Michael Benedikt, Clemens Ley, Gabriele Puppis:
Automata vs. Logics on Data Words. 110-124 - Alessandro Bianco, Fabio Mogavero, Aniello Murano:
Graded Computation Tree Logic with Binary Coding. 125-139 - Andreas Blass, Nachum Dershowitz, Yuri Gurevich:
Exact Exploration and Hanging Algorithms. 140-154 - Guillaume Burel:
Embedding Deduction Modulo into a Prover. 155-169 - Alberto Carraro, Thomas Ehrhard, Antonino Salibra:
Exponentials with Infinite Multiplicities. 170-184 - Kaustuv Chaudhuri:
Classical and Intuitionistic Subexponential Logics Are Equally Expressive. 185-199 - Yijia Chen, Jörg Flum:
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. 200-214 - Martin Churchill, James Laird:
A Logic of Sequentiality. 215-229 - Bob Coecke, Simon Perdrix:
Environment and Classical Channels in Categorical Quantum Mechanics. 230-244 - Stephen A. Cook, Lila Fontes:
Formal Theories for Linear Algebra. 245-259 - Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk:
Energy and Mean-Payoff Games with Imperfect Information. 260-274 - Kord Eickmeyer, Martin Grohe:
Randomisation and Derandomisation in Descriptive Complexity Theory. 275-289 - José Espírito Santo:
Towards a Canonical Classical Natural Deduction System. 290-304 - Bernd Finkbeiner, Sven Schewe:
Coordination Logic. 305-319 - Marcelo P. Fiore, Chung-Kil Hur:
Second-Order Equational Logic (Extended Abstract). 320-335 - Neil Ghani, Patricia Johann, Clément Fumex:
Fibrational Induction Rules for Initial Algebras. 336-350 - Stefan Hetzl:
A Sequent Calculus with Implicit Term Representation. 351-365 - Tobias Ganzow, Lukasz Kaiser:
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures. 366-380 - Beniamino Accattoli, Delia Kesner:
The Structural lambda-Calculus. 381-395 - Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The Isomorphism Problem for omega-Automatic Trees. 396-410 - Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. 411-425 - Barnaby Martin, Jos Martin:
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case. 426-438 - Yavor Nenov, Ian Pratt-Hartmann:
On the Computability of Region-Based Euclidean Logics. 439-453 - Fredrik Nordvall Forsberg, Anton Setzer:
Inductive-Inductive Definitions. 454-468 - André Platzer:
Quantified Differential Dynamic Logic for Distributed Hybrid Systems. 469-483 - Damien Pous:
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. 484-498 - Thomas Schwentick, Thomas Zeume:
Two-Variable Logic with Two Order Relations - (Extended Abstract). 499-513 - Christian Sternagel, René Thiemann:
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs. 514-528 - Pierre-Yves Strub:
Coq Modulo Theory. 529-543 - Johann A. Makowsky, Damian Niwinski:
The Ackermann Award 2010. 544-546
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2021-01-25 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
