|
计算机科学逻辑： CSL 2006/会议录Computer science logic (书店编码:2299590) |
| 从书名： |
| 书号:3540454588 |
定价:813.6 |
| 著译者: Zoltán Ésik 著 |
销售价:772.92 |
| 出版社:湖南文艺出版社 |
| 规格:版次:1|印次:|页数:626|纸张:胶版纸|装帧:平装 |
| 出版时间:
2006年12月1日 |
上架时间:2008-12-27 15:13:00 |
| ⇒ 察看所有书评 |
⇒ 放入我的收藏夹 |
| ⇒ 推荐给我的朋友 |
⇒ 察看我的收藏夹 |
|
|
|
|
|
主要内容:
This book constitutes the refereed proceedings of the 20th International Workshop on Computer Science Logic, CSL 2006, held as the 15th Annual Conference of the EACSL in Szeged, Hungary in September 2006.
The 37 revised full papers presented together with 4 invited contributions were carefully reviewed and selected from 132 submissions. All current aspects of logic in computer science are addressed, including automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and formal logics, modal and temporal logic, model checking, logical aspects of computational complexity, finite model theory, computational proof theory, logic programming and constraints, lambda calculus and combinatory logic, categorical logic and topological semantics, domain theory, database theory, specification, extraction and transformation of programs, logical foundations of programming paradigms, verification of security protocols, linear logic, higher-order logic, nonmonotonic reasoning, as well as logics and type systems for biology.
|
本书目录:
Invited Presentations
Functorial Boxes in String Diagrams
Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures(Extended Abatract)
Automata and Logics and Their Algebraic Foundations
Conributions
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
Verication 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
On Rational Trees
Reasoning About States of Probabilistic Sequential Programs
Concurrent Games with Tail Objectives
Nash Equilibrium for Upward-Closed Objectives
Algorithms for Omega-Ragular Games with Imperfect Information
Relating Two Standard Notions of Secrecy
Jump form Parallel to Sequential Proofs:Multplicatives
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
……
Appendix
Author Index
|
本书特点:
The LNCS series reports state-of-the-art results in computer science research,development,and education,at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community,with numerous individuals,as well as with prestigious organizations and societies,LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS,including its subseries LNAI,spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work,research projects,technical reports,etc.).
|
|
|
|
|
