基本説明
Subseries: Theoretical Computer Science and General Issues.
Full Description
The annual conference of the European Association for Computer Science Logic (EACSL), CSL 2010, was held in Brno (Czech Republic), August 23-27, 2010. The conference started as a series of international workshops on Computer S- ence Logic, and then at its sixth meeting became the Annual Conference of the EACSL. This conference was the 24th meeting and 19th EACSL conference; it was organized at the Faculty of Informatics, Masaryk University, Brno. In 2010, CSL and the 35th International Symposium on Mathematical Fo- dations of Computer Science (MFCS 2010)were federated and organizedin p- allel at the same place. The technical program and proceedings of MFCS 2010 andCSL2010werepreparedindependently. The federatedMFCSandCSL 2010 conference had ?ve common plenary sessions and common social events for all participants. The common plenary speakers were David Basin (Zur .. ich), Herbert Edelsbrunner(Klosterneuburg),ErichGrad .. el(Aachen),BojanMohar(Burnaby, Ljubljana), and Joseph Sifakis (Grenoble). Invited papers by David Basin and ErichGr. adelwereincludedintheproceedingsofCSL.Inaddition,CSL2010had ?ve invited speakers, namely, Peter O'Hearn (London), Jan Krajicek (Prague), Andrei Krokhin (Durham), Andrey Rybalchenko (Munich), and Viktor Kuncak (Lausanne).
Contents
Invited Talks.- Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries.- Definability in Games.- From Feasible Proofs to Feasible Computations.- Tree Dualities for Constraint Satisfaction.- Ordered Sets in the Calculus of Data Structures.- Abductive, Inductive and Deductive Reasoning about Resources.- Constraint Solving for Program Verification: Theory and Practice by Example.- Contributed Papers.- Tableau Calculi for over minspaces.- A Resolution Mechanism for Prenex Gödel Logic.- Efficient Enumeration for Conjunctive Queries over X-underbar Structures.- A Formalisation of the Normal Forms of Context-Free Grammars in HOL4.- Automata vs. Logics on Data Words.- Graded Computation Tree Logic with Binary Coding.- Exact Exploration and Hanging Algorithms.- Embedding Deduction Modulo into a Prover.- Exponentials with Infinite Multiplicities.- Classical and Intuitionistic Subexponential Logics Are Equally Expressive.- On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT.- A Logic of Sequentiality.- Environment and Classical Channels in Categorical Quantum Mechanics.- Formal Theories for Linear Algebra.- Energy and Mean-Payoff Games with Imperfect Information.- Randomisation and Derandomisation in Descriptive Complexity Theory.- Towards a Canonical Classical Natural Deduction System.- Coordination Logic.- Second-Order Equational Logic (Extended Abstract).- Fibrational Induction Rules for Initial Algebras.- A Sequent Calculus with Implicit Term Representation.- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures.- The Structural ?-Calculus.- The Isomorphism Problem for ?-Automatic Trees.- Complexity Results for Modal Dependence Logic.- The Complexity of Positive First-Order Logic without EqualityII: The Four-Element Case.- On the Computability of Region-Based Euclidean Logics.- Inductive-Inductive Definitions.- Quantified Differential Dynamic Logic for Distributed Hybrid Systems.- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic.- Two-Variable Logic with Two Order Relations.- Signature Extensions Preserve Termination.- Coq Modulo Theory.- Ackermann Award.- The Ackermann Award 2010.
