Computer Science Logic: 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008, Proceedings: 5213 - Brossura

Brossura

ISBN 10: 3540875301 ISBN 13: 9783540875307

Casa editrice: Springer-Verlag New York Inc, 2008

Riassunto

The annual conference of the European Association for Computer Science Logic (EACSL), CSL 2008, was held in Bertinoro, near Bologna (Italy), September 16–19, 2008. The conference series started as a program of International Wo- shops on Computer Science Logic, and then at its sixth meeting became the Annual Conference of the EACSL. This conference was the 22nd meeting and 17th EACSL conference; it was organized by the Department of Computer S- ence of Alma Mater Studiorum–Universita` di Bologna. CSL2008wasprecededonMonday,September15thbythesymposiumBri- ing Logic and Computer Science on the occasion of the 60th birthday of Johann A. Makowsky. In response to the call for papers, a total of 102 abstracts were submitted to CSL 2008 of which 87 were followed by a full paper. The Program Committee selected 31 papers for presentation at the conference and publication in these proceedings,during a one-weekelectronicdiscussion on the EasyChairplatform; each paper was refereed by three to ?ve reviewers. The Program Committee invited lectures from Luca Cardelli, Pierre-Louis Curien, Jean-PierreJouannaud,and Wolfgang Thomas. The papers providedby the invited speakers appear at the beginning of this volume. Createdin 2005,the AckermannAwardis the EACSLOutstanding Disser- tion Awardfor Logicin Computer Science, sponsoredfor the years2007-2009by LogitechS.A. The awardrecipientfor 2008wasKrishnenduChatterjee,who was invited to present his work at the conference. Citation for the award, abstract of the thesis, and a biographical sketch of the recipient may be found at the end of the proceedings.

Su questo libro

Contenuti:

Invited Talks.- The Computability Path Ordering: The End of a Quest.- The Joy of String Diagrams.- Model Transformations in Decidability Proofs for Monadic Theories.- Molecules as Automata.- Contributed Papers.- An Infinite Automaton Characterization of Double Exponential Time.- Recursion Schemata for NC k .- Extensional Uniformity for Boolean Circuits.- Pure Pointer Programs with Iteration.- Quantified Positive Temporal Constraints.- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars.- Continuous Fragment of the mu-Calculus.- On the Relations between the Syntactic Theories of ??-Calculi.- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms.- Proving Infinitude of Prime Numbers Using Binomial Coefficients.- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic.- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract).- Quantitative Game Semantics for Linear Logic.- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic.- An Indexed System for Multiplicative Additive Polarized Linear Logic.- A Characterisation of Lambda Definability with Sums Via ???-Closure Operators.- Superposition for Fixed Domains.- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T.- On the Almighty Wand.- On Counting Generalized Colorings.- The Descriptive Complexity of Parity Games.- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games.- Quantitative Languages.- Characterization of Logics over Ranked Tree Languages.- The Nesting-Depth of Disjunctive ?-Calculus for Tree Languages and the Limitedness Problem.- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract).- Syntactic Metatheory of Higher-Order Subtyping.- On Isomorphisms of Intersection Types.- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence.- Type-Based Termination with Sized Products.- The Ackermann Session.- The Ackermann Award 2008.

Dalla quarta di copertina:

This book constitutes the refereed proceedings of the 22nd International Workshop on Computer Science Logic, CSL 2008, held as the 17th Annual Conference of the EACSL in Bertinoro, Italy, in September 2008.

The 31 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from 102 submissions. All current aspects of logic in computer science are addressed, ranging from foundational and methodological issues to application issues of practical relevance. The book concludes with a presentation of this year's Ackermann award.

Su questa edizione

• Editore: Springer-Verlag New York Inc
• Data di pubblicazione: 2008
• ISBN 10: 3540875301
• ISBN 13: 9783540875307
• Rilegatura: Copertina flessibile
• Numero di pagine: 512
• Redattore: Kaminski Michael, Martini Simone