Computer science logic : 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7-11, 2009 : proceedings / Erich Grädel, Reinhard Kahle (eds.).

By: CSL 2009 (2009 : Coimbra, Portugal)
Contributor(s): Grädel, Erich, 1958- | Kahle, Reinhard, 1967- | European Association for Computer Science Logic
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 5771.; LNCS sublibrary: Publisher: Berlin ; New York : Springer, ©2009Description: 1 online resource (xi, 565 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783642040276; 3642040276; 9783642040269; 3642040268Subject(s): Computer logic -- Congresses | Computer logic | Informatique | Computer logic | Computational logic | Logik | Logische Programmierung | Programmierlogik | Theoretische Informatik | wiskunde | mathematics | computerwetenschappen | computer sciences | computerwiskunde | computational mathematics | informatietheorie | information theory | algebra | logica | logic | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Computer science logic.DDC classification: 005.101/5113 LOC classification: QA76.9.L63 | C68 2009Other classification: TP301-532 | SS 4800 | DAT 706f | DAT 540f Online resources: Click here to access online
Contents:
Invited Talks -- Algebra for Tree Languages -- Forcing and Type Theory -- Functional Interpretations of Intuitionistic Linear Logic -- Fixed-Point Definability and Polynomial Time -- Special Invited Talk to Commemorate the Centenary of Stephen Cole Kleene -- Kleene's Amazing Second Recursion Theorem -- Contributed Papers -- Typed Applicative Structures and Normalization by Evaluation for System F? -- Jumping Boxes -- Tree-Width for First Order Formulae -- Algorithmic Analysis of Array-Accessing Programs -- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems -- Cardinality Quantifiers in MLO over Trees -- From Coinductive Proofs to Exact Real Arithmetic -- On the Relation between Sized-Types Based Termination and Semantic Labelling -- Expanding the Realm of Systematic Proof Theory -- EXPTIME Tableaux for the Coalgebraic?-Calculus -- On the Word Problem for -Categories, and the Properties of Two-Way Communication -- Intersection, Universally Quantified, and Reference Types -- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata -- Enriching an Effect Calculus with Linear Types -- Degrees of Undecidability in Term Rewriting -- Upper Bounds on Stream I/O Using Semantic Interpretations -- Craig Interpolation for Linear Temporal Languages -- On Model Checking Boolean BI -- Efficient Type-Checking for Amortised Heap-Space Analysis -- Deciding the Inductive Validity of????* Queries -- On the Parameterised Intractability of Monadic Second-Order Logic -- Automatic Structures of Bounded Degree Revisited -- Nondeterminism and Observable Sequentiality -- A Decidable Spatial Logic with Cone-Shaped Cardinal Directions -- Focalisation and Classical Realisability -- Decidable Extensions of Church's Problem -- Nested Hoare Triples and Frame Rules for Higher-Order Store -- A Complete Characterization of Observational Equivalence in Polymorphic?-Calculus with General References -- Non-Commutative First-Order Sequent Calculus -- Model Checking FO(R) over One-Counter Processes and beyond -- Confluence of Pure Differential Nets with Promotion -- Decision Problems for Nash Equilibria in Stochastic Games -- On the Complexity of Branching-Time Logics -- Nominal Domain Theory for Concurrency -- The Ackermann Award 2009.
Summary: This book constitutes the proceedings of the 23rd International Workshop on Computer Science Logic, CSL 2009, held in Coimbra, Portugal, in September 2009. The 34 papers presented together with 5 invited talks were carefully reviewed and selected from 89 full paper 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, the EACSL Outstanding Dissertation Award for Logic in Computer Science.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

Print version record.

Invited Talks -- Algebra for Tree Languages -- Forcing and Type Theory -- Functional Interpretations of Intuitionistic Linear Logic -- Fixed-Point Definability and Polynomial Time -- Special Invited Talk to Commemorate the Centenary of Stephen Cole Kleene -- Kleene's Amazing Second Recursion Theorem -- Contributed Papers -- Typed Applicative Structures and Normalization by Evaluation for System F? -- Jumping Boxes -- Tree-Width for First Order Formulae -- Algorithmic Analysis of Array-Accessing Programs -- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems -- Cardinality Quantifiers in MLO over Trees -- From Coinductive Proofs to Exact Real Arithmetic -- On the Relation between Sized-Types Based Termination and Semantic Labelling -- Expanding the Realm of Systematic Proof Theory -- EXPTIME Tableaux for the Coalgebraic?-Calculus -- On the Word Problem for -Categories, and the Properties of Two-Way Communication -- Intersection, Universally Quantified, and Reference Types -- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata -- Enriching an Effect Calculus with Linear Types -- Degrees of Undecidability in Term Rewriting -- Upper Bounds on Stream I/O Using Semantic Interpretations -- Craig Interpolation for Linear Temporal Languages -- On Model Checking Boolean BI -- Efficient Type-Checking for Amortised Heap-Space Analysis -- Deciding the Inductive Validity of????* Queries -- On the Parameterised Intractability of Monadic Second-Order Logic -- Automatic Structures of Bounded Degree Revisited -- Nondeterminism and Observable Sequentiality -- A Decidable Spatial Logic with Cone-Shaped Cardinal Directions -- Focalisation and Classical Realisability -- Decidable Extensions of Church's Problem -- Nested Hoare Triples and Frame Rules for Higher-Order Store -- A Complete Characterization of Observational Equivalence in Polymorphic?-Calculus with General References -- Non-Commutative First-Order Sequent Calculus -- Model Checking FO(R) over One-Counter Processes and beyond -- Confluence of Pure Differential Nets with Promotion -- Decision Problems for Nash Equilibria in Stochastic Games -- On the Complexity of Branching-Time Logics -- Nominal Domain Theory for Concurrency -- The Ackermann Award 2009.

This book constitutes the proceedings of the 23rd International Workshop on Computer Science Logic, CSL 2009, held in Coimbra, Portugal, in September 2009. The 34 papers presented together with 5 invited talks were carefully reviewed and selected from 89 full paper 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, the EACSL Outstanding Dissertation Award for Logic in Computer Science.

There are no comments for this item.

to post a comment.

Powered by Koha