计算的理论方面 - ICTAC 2006 /会议录/Theoretical aspects of computing - ICTAC
分类: 图书,计算机/网络,计算机理论,
作者: Kael Rarkaoui 等著
出 版 社: 湖南文艺出版社
出版时间: 2006-12-1字数:版次: 1页数: 370印刷时间: 2006/12/01开本:印次:纸张: 胶版纸I S B N : 9783540488156包装: 平装编辑推荐
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.).
内容简介
This book constitutes the thoroughly refereed post-proceedings of the Third International Conference on Sequences and Their Applications, SETA 2004, held in Seoul, Korea in October 2006. The 30 revised full papers presented together with 4 nvited survey articles were carefully selected during two rounds of reviewing and improvement from initially 59 submissions. The papers are organized in topical sections on complexity of sequences, perfect sequences, sequence construction, sequences modulo z, sequence generator properties and applications, multi-dimensional sequences, optics and OFDM applications, and polynomials and functions.
目录
Invited Papers
Verifying a Hotel Key Card System
Z/Eves and the Mondex Electronic Purse
Verification Constraint Problems with Strengthening
Semantics
Quantitative #-Calculus Analysis of Power Management in WirelessNetworks
Termination and Divergence Are Undecidable Under a Maximum
Progress Multi-step Semantics for LinCa
A Topological Approach of the Web Classification
Concurrency
Bisimulation Congruences in Roberto Barbuti, Andrea
Stronger Reduction Criteria for Local First Search
A Lattice-Theoretic Model for an Algebra of Communicating Sequential
Processes
A Petri Net Translation of 7r-Calculus Terms
Model Checking
Handling Algebraic Properties in Automatic Analysis
of Security Protocols
Algorithm for Parallel Model Checking of Polygonal
Thread-Modular Verification Is Cartesian Abstract Interpretation
Formal Languages
Capture-Avoiding Substitution as a Nominal Algebra
Prime Decomposition Problem for
Several Kinds of Regular Codes
A New Approach to Determinisation Using Bit-Parallelism
Logic and Type Theory
Proving ATL* Properties of Infinite-State Systems
Type Safety for FJ and FGJ
Partizan Games in Isabelle/HOLZF
Proof-Producing Program Analysis
Real-Time and Mobility
Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting
……
Tutorials Extended Abstracts
Anthor Index