LEADER 06409nam 22008415 450 001 996465668403316 005 20230406065302.0 010 $a3-642-04027-6 024 7 $a10.1007/978-3-642-04027-6 035 $a(CKB)1000000000784708 035 $a(SSID)ssj0000316898 035 $a(PQKBManifestationID)11246637 035 $a(PQKBTitleCode)TC0000316898 035 $a(PQKBWorkID)10276724 035 $a(PQKB)10472840 035 $a(DE-He213)978-3-642-04027-6 035 $a(MiAaPQ)EBC3064573 035 $a(PPN)139955275 035 $a(EXLCZ)991000000000784708 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic$b[electronic resource] $e23rd International Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009, Proceedings /$fedited by Erich Grädel, Reinhard Kahle 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XI, 567 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5771 300 $aIncludes index. 311 $a3-642-04026-8 327 $aInvited 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. 330 $aThe annual conference of the European Association for Computer Science Logic (EACSL), CSL 2009, was held in Coimbra (Portugal), September 7?11, 2009. The conference series started as a programme of International Workshops on Computer Science Logic, and then at its sixth meeting became the Annual C- ference of the EACSL. This conference was the 23rd meeting and 18th EACSL conference; it was organized at the Department of Mathematics, Faculty of S- ence and Technology, University of Coimbra. In response to the call for papers, a total of 122 abstracts were submitted to CSL 2009of which 89 werefollowedby a full paper. The ProgrammeCommittee selected 34 papers for presentation at the conference and publication in these proceedings. The Ackermann Award is the EACSL Outstanding Dissertation Award for Logic in Computer Science. The awardrecipient for 2009 was Jakob Nordstr¨ om. Citation of the award, abstract of the thesis, and a biographical sketch of the recipient may be found at the end of the proceedings. The award was sponsored for the years 2007?2009 by Logitech S.A. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5771 606 $aArtificial intelligence 606 $aMathematical logic 606 $aMachine theory 606 $aComputer science 606 $aComputer science?Mathematics 606 $aCoding theory 606 $aInformation theory 606 $aArtificial Intelligence 606 $aMathematical Logic and Foundations 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aSymbolic and Algebraic Manipulation 606 $aCoding and Information Theory 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 0$aMachine theory. 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 0$aCoding theory. 615 0$aInformation theory. 615 14$aArtificial Intelligence. 615 24$aMathematical Logic and Foundations. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aCoding and Information Theory. 676 $a004.015113 686 $aDAT 540f$2stub 686 $aDAT 706f$2stub 686 $aSS 4800$2rvk 702 $aGrädel$b Erich$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKahle$b Reinhard$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aEuropean Association for Computer Science Logic. 712 12$aCSL 2009 906 $aBOOK 912 $a996465668403316 996 $aComputer Science Logic$9771972 997 $aUNISA