Computer Science Logic [electronic resource] 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings / edited by Zoltán Ésik.

Bibliographic Details
Uniform Title:Theoretical Computer Science and General Issues, 2512-2029 ; 4207
Corporate Author: SpringerLink (Online service)
Other Authors: Ésik, Zoltán (Editor)
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edition:1st ed. 2006.
Series:Theoretical Computer Science and General Issues, 4207
Subjects:
Compilers (Computer programs).
Computer science.
Machine theory.
Artificial intelligence.
Mathematical logic.
Online Access:
Springer English/International eBooks 2006 - Full Set: 2006 (Springer Link)
Variant Title:
Computer Science Logic: 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings
Format: Electronic eBook
Contents:
  • Invited Presentations
  • Functorial Boxes in String Diagrams
  • Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract)
  • Automata and Logics for Words and Trees over an Infinite Alphabet
  • Nonmonotonic Logics and Their Algebraic Foundations
  • Contributions
  • Semi-continuous Sized Types and Termination
  • Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
  • A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
  • The Power of Linear Functions
  • Logical Omniscience Via Proof Complexity
  • Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
  • MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
  • Abstracting Allocation
  • Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
  • Towards an Implicit Characterization of NC k
  • On Rational Trees
  • Reasoning About States of Probabilistic Sequential Programs
  • Concurrent Games with Tail Objectives
  • Nash Equilibrium for Upward-Closed Objectives
  • Algorithms for Omega-Regular Games with Imperfect Information
  • Relating Two Standard Notions of Secrecy
  • Jump from Parallel to Sequential Proofs: Multiplicatives
  • First-Order Queries over One Unary Function
  • Infinite State Model-Checking of Propositional Dynamic Logics
  • Weak Bisimulation Approximants
  • Complete Problems for Higher Order Logics
  • Solving Games Without Determinization
  • Game Quantification on Automatic Structures and Hierarchical Model Checking Games
  • An Algebraic Point of View on the Crane Beach Property
  • A Sequent Calculus for Type Theory
  • Universality Results for Models in Locally Boolean Domains
  • Universal Structures and the Logic of Forbidden Patterns
  • On the Expressive Power of Graph Logic
  • Hoare Logic in the Abstract
  • Normalization of IZF with Replacement
  • Acyclicity and Coherence in Multiplicative Exponential Linear Logic
  • Church Synthesis Problem with Parameters
  • Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
  • Separation Logic for Higher-Order Store
  • Satisfiability and Finite Model Property for the Alternating-Time ?-Calculus
  • Space-Efficient Computation by Interaction
  • The Ackermann Award 2006.