數(shù)學(xué)方法與軟件技術(shù)

定　價(jià)：￥587.60

作　者：	Michael Johnson，Varmo Vene 著
出版社：	崇文書局（原湖北辭書出版社）
叢編項(xiàng)：
標(biāo)　簽：	暫缺

購買這本書可以去

當(dāng)當(dāng)網(wǎng) (￥464.20)

ISBN：	9783540356332	出版時(shí)間：	2006-12-01	包裝：	平裝
開本：		頁數(shù)：		字?jǐn)?shù)：

內(nèi)容簡介

　　This book constitutes the refereed proceedings of the 11th International Conference on Algebraic Methodology and Software Technology， AMAST 2006， held in Kuressaare， Estonia in July 2006， co-located with MPC 2006， the 8th International Conference on Mathematics of Program Construction.The 24 revised full papers presented together with 3 system demonstrations and 3 invited talks were carefully reviewed and selected from 55 submissions. Among the topics covered are all current issues in formal methods related to algebraic approaches and to software engineering including abstract data types， process algebras， algebraic specification， model checking， abstraction， refinement， mu-calculus， state machines， rewriting， Kleene algebra， programming logic， and formal software development.

作者簡介

暫缺《數(shù)學(xué)方法與軟件技術(shù)》作者簡介

圖書目錄

Invited Talks
Incremental Software Construction with Refinement Diagrams
Recursive Program Schemes: Past, Present, and Future
Monad-Based Logics for Computational Effects
Contributed Papers
State Space Representation for Verification of Open Systems
Data Movement Optimisation in Point-Free Form
Measuring the Speed of Information Leakage in Mobile Processes
Formal Islands
Some Programming Languages for LOGSPACE and PTIME
Opaque Predicates Detection by Abstract Interpretation
DO-Cash An Observer-Based Casl Extension for Dynamic Specifications
Model Transformations Incorporating Multiple Views
Hyperfinite Approximations to Labeled Markov Transition Systems
State Space Reduction of Rewrite Theories Using Invisible Transitions
The Essence of Multitasking
The Substitution Vanishes
Decomposing Interactions
Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues
Assessing the Expressivity of Formal Specification Languages
Fork Algebras as a Sufficiently Rich Universal Institution
Realizability Criteria for Compositional MSC
Quantales and Temporal Logics
Fractional Semantics
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic
Testing Semantics: Connecting Processes and Process Logics
Tableaux for Lattices
Accelerated Modal Abstractions of Labelled Transition Systems
A Compositional Semantics of Plan Revision in Intelligent Agents
System Descriptions
Author Index