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

FSTTCS 2004: Foundations of Software Technology and Theoretical(FSTTCS 2004年:软件技术与理论计算机科学技术/会议录)

分享到:
FSTTCS 2004: Foundations of Software Technology and Theoretical(FSTTCS 2004年:软件技术与理论计算机科学技术/会议录)

最 低 价:¥650.88

定 价:¥723.20

作 者:KamalLodaya 著

出 版 社:北京燕山出版社

出版时间:2005-1-1

I S B N:3540240586

商品详情

编辑推荐

内容简介

This book constitutes the refereed proceedings of the 24th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004, held in Chennai, India, in December 2004.
  The 35 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 176 submissions. The papers address a broad variety of current issues in software science, programming theory, systems design and analysis, formal methods, mathematical logic, mathematical foundations, discrete mathematics, combinatorial mathematics

作者简介

目录

Invited Papers
Genome Halving Problem Revisited
Verifying Probabilistic Procedural Programs
Streaming Algorithms for Geometric Problems
Toward a Grainless Semantics for Shared-Variable Concurrency
Regular Languages, Unambiguous Concatenation and Computational Complexity
Contributed Papers
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets
On the Urgency Expressiveness
Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages
A Decidable Fragment of Separation Logic
Approximate Range Searching Using Binary Space Partitions
Representable Disjoint NP-Pairs
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
Optimal Strategies in Priced Timed Game Automata
A Calculus for Trust Management
Short-Cuts on Star, Source and Planar Unfoldings
Subdividing Alpha Complex
Real-Counter Automata and Their Decision Problems
Adjunct Elimination Through Games in Static Ambient Logic
On the Bisimulation Invariant Fragment of Monadic ~1 in the Finite
On the Complexity of Hilbert's 17th Problem
Who is Pointing When to Whom?
An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
Minimum Weight Pseudo-Triangulations
……
Author Index

商品评论(0条)

暂无评论!

您的浏览历史

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