A novel formalization of symbolic trajectory evaluation semantics in Isabelle/HOL

This paper presents a formal symbolic trajectory evaluation (STE) theory based on a structural netlist circuit model, instead of an abstract next state function. We introduce an inductive definition for netlists, which gives an accurate and formal definition for netlist structures. A closure state function of netlists is formally introduced in terms of the formal netlist model. We refine the definition of the defining trajectory and the STE implementation to deal with the closure state function. The close correspondence between netlist structures and properties is discussed. We present a set of novel algebraic laws to characterize the relation between the structures and properties of netlists. Finally, the application of the new laws is demonstrated by parameterized verification of the properties of content-addressable memories.     

Internet网络管理的计算思想

以网络为中心的计算对网络管理的要求和对网络管理计算模式的影响同样重大.文章讨论了基于Client／Server、Code－on－Demand和Mobil Agent 计算的Internet网络     

基于VP的ATM网中多项服务质量路由算法

ＡＴＭ网传统的路由方案所考虑的仅是可连接性,对于基于ＶＰ的ＡＴＭ网,提出了一种以代价和时延多服务品质,基于Ｄｉｊｋｓｔｒａ算法的路由算法,算法简单易行,计算复杂度低。     

FAST: acceleration from theory to practice

Fast acceleration of symbolic transition systems (Fast) is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under study. Even if this reachability set is not necessarily recursive, we use innovative techniques, namely symbolic representation, acceleration and circuit selection, to increase convergence. Fast has proved to perform very well on case studies. This paper describes the tool, from the underlying theory to the architecture choices. Finally, Fast capabilities are compared with those of other tools. A range of case studies from the literature is investigated. This paper is mainly based on results presented at CAV 2003, TACAS 2004 and ATVA 2005.     

用ODP视点分析常见网络管理模型

本文运用ODP的分析方法对基于SNMP和CMIP以及分布式的网络管理系统模型进行分析,从信息和计算视点进行对比,找出各自的特点和不足,得出网络管理系统发展的一般趋势以及需要解决的问题,为以后网络管理系统的实施提供参考。     

一个实用的Ada源级调试器的设计和实现

Ada是美国国家军用标准编程语言。近年来,我国也开展了对Ada及其开发环境的研究工作。本文首先介绍高级语言开发环境中源级符号调试器的基本原理,然后给出了一个实用性的Ada源级调试器的设计和实现关键技术。     

Symbolic computation with finite biquandles

A method of computing a basis for the second Yang–Baxter cohomology of a finite biquandle with coefficients in Q$\mathbb{Q}$ and _Zp${\mathbb{Z}}_p$ from a matrix presentation of the finite biquandle is described. We also describe a method for computing the Yang–Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss code. We provide a URL for our Maple implementations of these algorithms.     

Irreducible constituents of monomial representations

We describe an algorithm for obtaining the central primitive idempotents of the algebra associated with a monomial representation. As a consequence, we obtain its irreducible constituents. This is implemented in Magma, using an algorithm based on Dixon’s modular approach. In the case of permutation representations, we get a simplified version of the algorithms of Michler and Weller.