000 05869nam a22006495i 4500
001 978-3-642-04027-6
003 DE-He213
005 20240423125742.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642040276
_9978-3-642-04027-6
024 7 _a10.1007/978-3-642-04027-6
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aComputer Science Logic
_h[electronic resource] :
_b23rd International Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009, Proceedings /
_cedited by Erich Grädel, Reinhard Kahle.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXI, 567 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5771
505 0 _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 -- NestedHoare 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.
520 _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.
650 0 _aArtificial intelligence.
650 0 _aMathematical logic.
650 0 _aMachine theory.
650 0 _aComputer science.
650 0 _aComputer science
_xMathematics.
650 0 _aCoding theory.
650 0 _aInformation theory.
650 1 4 _aArtificial Intelligence.
650 2 4 _aMathematical Logic and Foundations.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aCoding and Information Theory.
700 1 _aGrädel, Erich.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKahle, Reinhard.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642040269
776 0 8 _iPrinted edition:
_z9783642040283
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5771
856 4 0 _uhttps://doi.org/10.1007/978-3-642-04027-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181332
_d181332