INAP协议一致性测试生成的形式化方法

文章应用形式化方法对INAP协议进行测试，基于INAP协议描述的I／O FSM模型，应用UIO方法生成一致性测试序列，然后应用中国乡村邮递员算法对测试序列进行优化，生成的测试序列可以覆盖状态机的每个变迁，且生成的测试序列较短。     

基于UIO测试序列的错误诊断算法

唯一输入输出(Unique Input Output)测试序列是协议测试中常用的一种测试序列,在一个已有的错误诊断算法基础上,结合UIO测试序列的一些特点,该文提出了一种应用于UIO测试序列的错误诊断算法。该算法充分利用了UIO测试序列给出的判定消息,及测试结果中可能的错误转换后的输入/输出消息,从而能高效完全地诊断单个错误。最后用实验数据给出了该文算法和原始算法之间的比较结果。     

IPv6邻居发现协议的一致性测试序列生成

自1998年互联网工程任务组(IETF)提出下一代互联网标准规范以来,IPv6已经历了十多年的发展。现今已有越来越多的IPv6产品被投入到了开发与应用中。而如何提高不同产品间的互通性和可靠性则成为了一个关键问题。进行协议一致性测试是提高IPv6实现可靠性的一种有效方式。本文就重点针对IPv6邻居发现协议进行了一致性测试分析。本文首先简要分析了IPv6邻居发现协议的主要功能及实现原理,并据此抽象出其有限状态机（FSM）模型。进而结合一种现有基于有限状态机(FSM)的一致性测试序列改进算法生成了该协议的抽象测试序列。本文在最后对得到的测试序列进行了有效性和可靠性分析,分析表明,使用该算法得到的测试序列不仅在序列长度上较传统UIO序列法有了明显的缩短,同时对测试过程中可能发生的输出错误及末状态转换错误也具备良好的检测能力。本文获得的抽象测试序列可对相关IPv6协议开发者提供有效参考。      

时序系统的状态组区别序列测试方法

介绍了采用单变迁故障模型的时序系统状态组区别序列测试方法,通过选择状态组区别序列优化测试序列长度。这种测试生成方法比时序电路门级测试生成快得多,而且能达到很高的故障覆盖率。     

基于UIO的协议一致性测试序列生成方法改进

在协议一致性测试中关键则在于寻找一条简捷高效的测试序列。在基于UIO序列的基础上提出BUIO序列的方法,并运用中国邮递员算法和启发式算法对其进行优化。     

基于变周期重播种LFSR的测试生成

基于重播种的LFSR结构的伪随机测试生成中包含的冗余测试序列较多,因而其测试序列长度仍较长,耗费测试时间长,测试效率不高。针对此状况,提出基于变周期重播种的LFSR结构的测试生成方法。该方法可以有效地跳过伪随机测试生成中的大量冗余测试序列。在保证电路测试故障覆盖率不变的条件下,缩短总测试序列的长度。分析结果表明,同定长重播种方法相比,该方法能以较少的硬件开销实现测试序列的精简,加快了测试的速度,提高了电路测试诊断的效率。     

利用逆向判定性缩短EFSM的测试序列的长度

在一个以扩展的有限状态机（ＥＦＳＭ）为模型描述的协议测试系统中,测试序列的可执行性是一个重要的问题。同时,还要考虑到测试序列的优化问题。文中以ＥＦＳＭ为协议的描述模型,引入了逆向判定性的概念,并利用这一概念对转换可执行性分析（ＴＥＡ）方法进行了改进,缩短了生成的测试序列的长度,并且减小了所需的ＴＥＡ树扩展空间。     

LabVIEW^TM和Lab Windows^TM／CVI测试执行软件新版本

国家仪器公司(NI)最近推出了用于LabVIEW和LabWindows/CVI测试开发仪器软件的新测试执行软件,软件提供了多种新功能:模块化结构使用户能方便地对测试进行客户化;先进的序列和子序列能力保证软件工程师能将常用的测试集打包在可再使用的子序列中;序列级的断点和单步调试能力;测试方案文档和ISO9000需要的ASCII序列文件生成/装入功能。     

基于UIO序列的类重要性度量

程序理解是测试和维护大规模面向对象程序的关键,选择程序的关键类优先开展分析是理解程序结构的一个有效的方法.为支持自动识别软件系统中的关键类,本文提出了一种基于UIO序列的类重要性度量方法.首先将软件系统抽象为一个以类为转换的有限自动机模型,随后求解该自动机的UIO序列,将该序列集合转化为状态转换树.通过递归计算状态转换树的节点复杂度求得类重要度.并在考虑异常传播的基础上改进了算法.最后通过实验验证了算法的有效性.     

基于低功耗的BIST测试生成结构优化设计

针对内建自测试(Built-In Self-Test,BIST)技术的伪随机测试生成具有测试时间过长,测试功耗过高的缺点,严重影响测试效率等问题,提出一种低功耗测试生成方案,该方案是基于线性反馈移位寄存器(LFSR)设计的一种低功耗测试序列生成结构--LP-TPG(Low Power Test Pattern Generator),由于CMOS电路的测试功耗主要由电路节点的翻转引起,所以对LFSR结构进行改进,在相邻向量间插入向量,这样在保证原序列随机特性的情况下,减少被测电路输入端的跳变,以ISCAS'8585基准电路作为验证对象,组合电路并发故障仿真工具fsim,可得到平均功耗和峰值功耗的降低,从而达到降低功耗的效果.验证结果表明,该设计在保证故障覆盖率的同时,有效地降低了测试功耗,缩短了测试序列的长度,具有一定的实用性.     

Protocol conformance testing using multiple UIO sequences

Automatic generation of conformance test sequences for communication protocols by means of unique input/output (UIO) sequences is addressed. It is shown that if multiple minimum-length UIO sequences are computed for each state of the finite-state-machine (FSM) specification, then the length of the resulting test sequence is significantly reduced without an appreciable increase in the time needed to compute the sequence. An algorithm for assignment of the multiple UIO sequences is given. This algorithm, which is based on network flow, is polynomial in the number of states and transitions of the FSM and is effective in reducing the overall length of the test sequence     

An optimization technique for protocol conformance test generationbased on UIO sequences and rural Chinese postman tours

A method for generating test sequences for checking the conformance of a protocol implementation to its specification is described. A rural Chinese postman tour problem algorithm is used to determine a minimum-cost tour of the transition graph of a finite-state machine. It is shown that, when the unique input/output sequence (UIO) is used in place of the more cumbersome distinguishing sequence, both the controllability and observability problems of the protocol testing problem are addressed, providing an efficient method for computing a test sequence for protocol conformance testing     

On the generation of minimal-length conformance tests forcommunication protocols

A technique for generating a test sequence for conformance testing of communication protocols is presented. This approach shows that it is possible to generate optimal-length test sequences which include multiple unique input/output (UIO) sequences and overlapping under certain conditions. In the absence of the above-mentioned conditions, a heuristic technique is used to obtain suboptimal solutions which show significant improvement over optimal solutions without overlapping. The technique is illustrated by the example of the NBS Class 4 Transport Protocol (TP4). The computational complexity of the algorithm is compared with that of previous techniques. A brief discussion of bounds on test sequence length is presented, and the results are compared with these bounds     

Evaluation and improvement of fault coverage of conformance testingby UIO sequences

The fault coverage of testing protocols using unique input/output (UIO) sequences is analyzed. UIO sequences can be efficiently employed in checking the conformance specifications of protocols by using transition testing. The test sequence is found using the rural Chinese postman tour algorithm. A comprehensive fault model is developed, and analytical expressions are given for the fault coverage. The conditions for undetectability are analyzed, and a new algorithm is proposed. Simulation results and illustrative examples are presented. Overhead issues are discussed, and significant improvements are shown for achieving 100% fault coverage. The major advantage of the proposed approach is that it provides the theoretical basis for fault coverage evaluation of protocol testing using UIO sequences     

Synchronizable test sequences based on multiple UIO sequences

A test sequence generation method is proposed for testing the conformance of a protocol implementation to its specification in a remote testing system where both external synchronization and input/output operation costs are taken into consideration. The method consists of a set of transformation rules that constructs a duplexU digraph from a given finite state machine (FSM) representation of a protocol specification; and an algorithm that finds a rural postman tour in the duplexU digraph to generate a synchronizable test sequence utilizing multiple UIO sequences. If the protocol satisfies a specific property, namely, the transitions to be tested and the UIO sequences to be employed form a weakly-connected subgraph of the duplexU digraph, the proposed algorithm yields a minimum-cost test sequence. X.25 DTE and ISO Class 0 transport protocols are shown to possess this property. Otherwise, the algorithm yields a test sequence whose cost is within a bound from the cost of the minimum-cost test sequence. The bound for the test sequence generated from the Q.931 network-side protocol is shown to be the cost sum of an input/output operation pair and an external synchronization operation     

On testing hierarchies for protocols

The authors consider a protocol specification represented as a fully specified Mealy automata, and the problem of testing an implementation for conformance to such a specification. No single sequence-based test can be completely reliable, if one allows for the possibility of an implementation with an unknown number of extra states. They define a hierarchy of test sequences, parameterized by the length of behaviors under test. For the reset method of conformance testing, they prove that the hierarchy has the property that any fault detected by test i is also detected by test i+1, and show that this sequence of tests converges to a reliable conformance test. For certain bridge sequence methods for constructing test sequences, this result does not always hold. In experiments with several specifications, they observe that given a small number of extra states in an implementation, the sequence of tests converge to a total fault coverage for small values of i, for both reset and bridge sequence methods. They also observe that the choice of characterizing sequence has less effect on fault coverage than the choice of behavior length or number of extra states in the implementation     

UIO序列优化搜索算法的研究

UIO序列是对有限状态机进行功能测试的有效手段,在VLSI、通信协议等时序系统中有很强的实际应用背景.本文基于可区分状态组这一概念设计了一个搜索算法,进一步利用搜索信息建立了一个基于"小于"关系的启发策略,有效的剪枝策略的设计将尽可能消除没有意义的搜索分枝,新设计出的多路OPEN/CLOSED表存储机制也加快了相关的判别、处理过程.根据实验结果,分析了优化措施对于改进了搜索过程、减少搜索信息的产生、提高搜索速度有显著的贡献.该算法与以往的算法相比,在时间复杂度和空间复杂度两方面都得到了很大改进.