CSL B

42 papers

YearTitle / Authors
2010A Formalisation of the Normal Forms of Context-Free Grammars in HOL4.
Aditi Barthwal, Michael Norrish
2010A Logic of Sequentiality.
Martin Churchill, James Laird
2010A Resolution Mechanism for Prenex Gödel Logic.
Matthias Baaz, Christian G. Fermüller
2010A Sequent Calculus with Implicit Term Representation.
Stefan Hetzl
2010Abductive, Inductive and Deductive Reasoning about Resources.
Peter W. O'Hearn
2010Automata vs. Logics on Data Words.
Michael Benedikt, Clemens Ley, Gabriele Puppis
2010Classical and Intuitionistic Subexponential Logics Are Equally Expressive.
Kaustuv Chaudhuri
2010Complexity Results for Modal Dependence Logic.
Peter Lohmann, Heribert Vollmer
2010Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings
Anuj Dawar, Helmut Veith
2010Constraint Solving for Program Verification: Theory and Practice by Example.
Andrey Rybalchenko
2010Coordination Logic.
Bernd Finkbeiner, Sven Schewe
2010Coq Modulo Theory.
Pierre-Yves Strub
2010Definability in Games.
Erich Grädel
2010Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries.
David A. Basin, Cas Cremers
2010Efficient Enumeration for Conjunctive Queries over X-underbar Structures.
Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin
2010Embedding Deduction Modulo into a Prover.
Guillaume Burel
2010Energy and Mean-Payoff Games with Imperfect Information.
Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk
2010Environment and Classical Channels in Categorical Quantum Mechanics.
Bob Coecke, Simon Perdrix
2010Exact Exploration and Hanging Algorithms.
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
2010Exponentials with Infinite Multiplicities.
Alberto Carraro, Thomas Ehrhard, Antonino Salibra
2010Fibrational Induction Rules for Initial Algebras.
Neil Ghani, Patricia Johann, Clément Fumex
2010Formal Theories for Linear Algebra.
Stephen A. Cook, Lila Fontes
2010From Feasible Proofs to Feasible Computations.
Jan Krajícek
2010Graded Computation Tree Logic with Binary Coding.
Alessandro Bianco, Fabio Mogavero, Aniello Murano
2010Inductive-Inductive Definitions.
Fredrik Nordvall Forsberg, Anton Setzer
2010New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures.
Tobias Ganzow, Lukasz Kaiser
2010On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT.
Yijia Chen, Jörg Flum
2010On the Computability of Region-Based Euclidean Logics.
Yavor Nenov, Ian Pratt-Hartmann
2010Ordered Sets in the Calculus of Data Structures.
Viktor Kuncak, Ruzica Piskac, Philippe Suter
2010Quantified Differential Dynamic Logic for Distributed Hybrid Systems.
André Platzer
2010Randomisation and Derandomisation in Descriptive Complexity Theory.
Kord Eickmeyer, Martin Grohe
2010Second-Order Equational Logic (Extended Abstract).
Marcelo P. Fiore, Chung-Kil Hur
2010Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs.
Christian Sternagel, René Thiemann
2010Tableau Calculi for
Régis Alenda, Nicola Olivetti, Camilla Schwind, Dmitry Tishkovsky
2010The Ackermann Award 2010.
Johann A. Makowsky, Damian Niwinski
2010The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case.
Barnaby Martin, Jos Martin
2010The Isomorphism Problem for
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2010The Structural
Beniamino Accattoli, Delia Kesner
2010Towards a Canonical Classical Natural Deduction System.
José Espírito Santo
2010Tree Dualities for Constraint Satisfaction.
Andrei A. Krokhin
2010Two-Variable Logic with Two Order Relations - (Extended Abstract).
Thomas Schwentick, Thomas Zeume
2010Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic.
Damien Pous