Computer science logic : 24th international workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010 : proceedings

Annotation This volume constitutes the refereed proceedings of the 24th International Workshop on Computer Science Logic, CSL 2010, held in Brno, Czech Republic, in August 2010. The 33 full papers presented together with 7 invited talks, were carefully reviewed and selected from 103 submissions. Topics covered include automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and games, modal and temporal logic, model checking, decision procedures, logical aspects of computational complexity, finite model theory, computational proof theory, logic programming and constraints, lambda calculus and combinatory logic, categorical logic and topological semantics, domain theory, database theory, specification, extraction and transformation of programs, logical foundations of programming paradigms, verification and program analysis, linear logic, higher-order logic, and nonmonotonic reasoning Front Matter....Pages - Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries....Pages 1-18 Definability in Games....Pages 19-21 From Feasible Proofs to Feasible Computations....Pages 22-31 Tree Dualities for Constraint Satisfaction....Pages 32-33 Ordered Sets in the Calculus of Data Structures....Pages 34-48 Abductive, Inductive and Deductive Reasoning about Resources....Pages 49-50 Constraint Solving for Program Verification: Theory and Practice by Example....Pages 51-51 Tableau Calculi for $\mathcal{CSL}$ over minspaces....Pages 52-66 A Resolution Mechanism for Prenex Gödel Logic....Pages 67-79 Efficient Enumeration for Conjunctive Queries over X-underbar Structures....Pages 80-94 A Formalisation of the Normal Forms of Context-Free Grammars in HOL4....Pages 95-109 Automata vs. Logics on Data Words....Pages 110-124 Graded Computation Tree Logic with Binary Coding....Pages 125-139 Exact Exploration and Hanging Algorithms....Pages 140-154 Embedding Deduction Modulo into a Prover....Pages 155-169 Exponentials with Infinite Multiplicities....Pages 170-184 Classical and Intuitionistic Subexponential Logics Are Equally Expressive....Pages 185-199 On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT....Pages 200-214 A Logic of Sequentiality....Pages 215-229 Environment and Classical Channels in Categorical Quantum Mechanics....Pages 230-244 Formal Theories for Linear Algebra....Pages 245-259 Energy and Mean-Payoff Games with Imperfect Information....Pages 260-274 Randomisation and Derandomisation in Descriptive Complexity Theory....Pages 275-289 Towards a Canonical Classical Natural Deduction System....Pages 290-304 Coordination Logic....Pages 305-319 Second-Order Equational Logic (Extended Abstract)....Pages 320-335 Fibrational Induction Rules for Initial Algebras....Pages 336-350 A Sequent Calculus with Implicit Term Representation....Pages 351-365 New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures....Pages 366-380 The Structural λ -Calculus....Pages 381-395 The Isomorphism Problem for ω -Automatic Trees....Pages 396-410 Complexity Results for Modal Dependence Logic....Pages 411-425 The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case....Pages 426-438 On the Computability of Region-Based Euclidean Logics....Pages 439-453 Inductive-Inductive Definitions....Pages 454-468 Quantified Differential Dynamic Logic for Distributed Hybrid Systems....Pages 469-483 Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic....Pages 484-498 Two-Variable Logic with Two Order Relations....Pages 499-513 Signature Extensions Preserve Termination....Pages 514-528 Coq Modulo Theory....Pages 529-543 The Ackermann Award 2010....Pages 544-546 Back Matter....Pages -