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

Foundations of Software Science and Computation Structures(基础科学计算软件结构)

分享到:
Foundations of Software Science and Computation Structures(基础科学计算软件结构)

最 低 价:¥329.50

定 价:¥558.47

作 者:MogensNielsen , UffeEngberg 著

出 版 社:湖南文艺出版社

出版时间:2002-4-1

I S B N:354043366x

商品详情

编辑推荐

内容简介

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 research 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 published traditionally includes.
—proceedings (published in time for the respective conference)
—post-proceedings (consisting of thoroughly revised final full papers)
—research monographs(which may be based on outstanding PhD work,research projects,technical reports,etc.).

作者简介

目录

Invited Paper
Semantical Evaluations as Monadic Seecond-Order Compatible Structure Transformations
Contributed Papers
Verification for Java s Reentrant Multithreading Concept
On the Integration of Observability and Reachability Concepts
Proving Correctness of Timed Concurrent Constraint Programs
Generalised Regular MSC Languages
On Compositional Reasoning in the SPi-calculus
On Specification Logics for Algebra-Coalgebra Structures:Reconciling Reachability and Observability
A First-Order One-Pass CPS Transformation
The Demonic Product of Probabilistic Relations
Minimizing Transition Systems for Name Passing Calculi:A Co-algebraic Formulation
Varieties of Effects
A Characterization of Families of Graphs in Which Election Is Possible
Equivalence-Checking with One-Counter Automata:A Generic Method for Proving Lower Bounds
Efficient Type Matching
Higher-Order Pushdown Trees Are Easy
Conflict Detection and Resolution In Access Control Policy Specifications
Logics Admitting Final Semantics
Model Checking Fixed Point Logic with Chop
On Model Checking Durational Kripke Structures
Model-Checking Infinite systems Generated by Ground Tree Rewriting
Bounded MSC Communication
The Informatic Dervative at a Compact Element
Heterogeneous Development Graphs and Heterogeneous Borrowing
Notions of COmputation Determine Monads
A Calculus of Circular Proofs and Its Categorical Semantics
Verifying Temporal Properties Using Explicit Approximants:Completeness for Context-free Processes
Note on the Tableau Technique for Commutative Transition Systems
A Semantic Basis for Local Reasoning
Linearity and Bisimulation
Author Index

商品评论(0条)

暂无评论!

您的浏览历史

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