Foundations of Software Science and Computation Structures
点此进入淘宝搜索页搜索分類: 图书,计算机/网络,计算机理论,
作者：
出 版 社： 湖南文艺出版社
出版时间：字数：版次：页数： 413印刷时间：开本：印次：纸张： 胶版纸I S B N ： 3540418644包装： 平装编辑推荐
内容简介
"This book constitutes the refereed proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2001, held in Genova, Italy in April 2001.
The 25 revised full papers presented together with an invited paper and a tool presentation paper were carefully reviewed and selected from a total of 63 submissions. Among the topics covered are algebraic, categorical, logical, and geometric theories, models, and methods supporting the specification, synthesis, verification, analysis, and transformation of sequential, concurrent, distributed and mobile programs and software systems."
作者简介
目录
Invited Paper
Adequacy for Algebraic Effects
Contributed Papers
Secrecy Types for Asymmetric Communication
Axiomatizing Tropical Semirings
Type Isomorphisms and Proof Reuse in Dependent Type Theory
On the Duality between Observability and Reachability
The Finite Graph Problem for Two-Way Alternating Automata
High-Level Petri Nets as Type Theories in the Join Calculus
Temporary Data in Shared Dataspace Coordination Languages
On Garbage and Program Loic
The Complexity of Model Checking Mobile Ambients
The Rho Cube
Type Inference with Recursive Type Equations
On the Modularity of Deciding Call-by-Need
Synchronized Tree Languages Revisited and New Applications
Computational Completeness of Programming Lang uages Based on Graph Transformation
Axions for Recursion in Call-by-Value(Extended Abstrace)
Class Analysis of Object-Oriented Programs throuhg Abstract Interpretation
On the Complexity of Parity Word Automata
Foundations for a Graph-Based Approach to the Specification of Access Control
Policies
Categories of Processes Enriched in Final Coalgebras
Model Checking CTL+and FCTL Is Hard
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewica
Trace Theory
Verified Bytecode Verifiers
Higher-Order Abstract Syntax with Induction in Isabelle/HOL:Formalizing the л-
Calculus and Mechanizing th Theory of Contexts
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
An Axiomatic Semantics for the Synchronous Language Gentzen
Tool Presentation
MARRELLA and the Verification of an Embedded System
Author Indes
媒体评论
