网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 教育/科技 > 数学 > 商品详情

Computer Science Logic 计算机科学逻辑/会议录

分享到:
Computer Science Logic 计算机科学逻辑/会议录

最 低 价:¥650.88

定 价:¥723.20

作 者:JerzyMarcinkowski 著

出 版 社:北京燕山出版社

出版时间:2004-10-1

I S B N:3540230246

商品详情

编辑推荐

内容简介

This book constitutes the refereed proceedings of the 18th International Workshop on Computer Science Logic, CSL 2004, held as the 13th Annual Conference of the EACSL in Karpacz, Poland, in September 2004.
  The 33 revised full papers presented together with 5 invited contributions were carefully reviewed and selected from 88 papers submitted. All current aspects of logic in computer science are addressed ranging from mathematical logic and logical foundations to methodological issues and applications of logics in various computing contexts.

作者简介

目录

Invited Lectures
 Notions of Average-Case Complexity for Random 3-SAT
 Abstract Interpretation of Proofs: Classical Propositional Calculus
 Applications of Craig Interpolation to Model Checking
 Bindings, Mobility of Bindings, and the V-Quantifier: An Abstract
 My (Un)Favourite Things
Regular Papers
 On Nash Equilibria in Stochastic Games
 A Bounding Quantifier
 Parity and Exploration Games on Infinite Graphs
 Integrating Equational Reasoning into Instantiation-Based Theorem Proving
 Goal-Directed Methods for Lukasiewicz Logic
 A General Theorem on Termination of Rewriting
 Predicate Transformers and Linear Logic: Yet Another Denotational Model
 Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
 On Proof Nets for Multiplicative Linear Logic with Units
 The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
 Game-Based Notions of Locality over Finite Models
 Fixed Points of Type Constructors and Primitive Recursion
 On the Building of Ai~ne Retractions
 Higher-Order Matching in the Linear ~-Calculus with Pairing
 A Dependent Type Theory with Names and Binding
 Towards Mechanized Program Verification with Separation Logic
 A Functional Scenario for Bytecode Verification of Resource Bounds
 Proving Abstract Noninterference
 Intuitionistic LTL and a New Characterization of Safety and Liveness
 Moving in a Crumbling Network: The Balanced Case
 Parameterized Model Checking of RingBased Message Passing Systems
 A Third Order Bounded Arithmetic Theory for PSPACE
 ……
Author Index

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...