Computer Science Logic
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Computer Science Logic: 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings
Computer Science Logic: 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings

Computer Science Logic: 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

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).

Table of 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.


Best Sellers


Product Details
  • ISBN-13: 9783642152047
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Language: English
  • Returnable: Y
  • ISBN-10: 364215204X
  • Publisher Date: 11 Aug 2010
  • Binding: Paperback
  • No of Pages: 548
  • Sub Title: 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Computer Science Logic: 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Computer Science Logic: 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Computer Science Logic: 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!