Robustness of temporal logic specifications for continuous-time signals

In this paper, we consider the robust interpretation of Metric Temporal Logic (MTL) formulas over signals that take values in metric spaces. For such signals, which are generated by systems whose states are equipped with non-trivial metrics, for example continuous or hybrid, robustness is not only natural, but also a critical measure of system performance. Thus, we propose multi-valued semantics for MTL formulas, which capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance, ε$\epsilon$, from unsatisfiability. We prove that any other signal that remains ε$\epsilon$-close to the initial one also satisfies the same MTL specification under the usual Boolean semantics. Finally, our framework is applied to the problem of testing formulas of two fragments of MTL, namely Metric Interval Temporal Logic (MITL) and closed Metric Temporal Logic (clMTL), over continuous-time signals using only discrete-time analysis. The motivating idea behind our approach is that if the continuous-time signal fulfills certain conditions and the discrete-time signal robustly satisfies the temporal logic specification, then the corresponding continuous-time signal should also satisfy the same temporal logic specification.     

Optimal testing resource allocation during module testing considering cost, testing effort and reliability

Software reliability is one of the most important quality attributes of commercial software. During software testing, software reliability growth models (SRGMs) are commonly used to describe the phenomenon of failure occurrence and/or fault removal which consequently enhancements software reliability. Large software systems are developed by integrating a number of relatively small and independent modules, which are tested independently during module testing phase. The amount of testing resource available is limited which is desired to be consumed judiciously so as to optimize the testing process. In this paper we formulate a resource allocation problem of minimizing the cost of software testing under available amount of testing resource, given a reliability constraint. We use a flexible SRGM considering testing effort which, depending upon the values of parameters, can describe either exponential or S-shaped failure pattern of software modules. A systematic and sequential Algorithm is proposed to solve the optimization problem formulated. Numerical examples are given to illustrate the formulation and solution procedures. Sensitivity analysis is performed to examine the behavior of some parameters of SRGM with most significant influence.     

基于FPGA的逻辑分析仪连续触发模块设计

该文介绍一种逻辑分析仪数据捕获模式的设计原理与实现方法。该模式主要用于嵌入式软件的测试分析,它不再采用采样的方式来采集数据,而是利用软件插桩与硬件设置触发字相结合的方法来监视系统总线。当程序运行到插桩点时,硬件将产生触发,此时才会主动地到总线上将相应数据与对应的具体时问捕获回来,从而实现有效数据的精确捕获。此外,在FPGA内部采用双RAM交替读写的方式来暂存数据,在不中断程序运行的情况下,实现有效数据的长时间实时存取与分析,提高嵌入式软件性能分析的范围和质量。采用FPGA作为构成硬件架构的基本功能器件,提高了工作速度,使整个设计具具有集成度高、性能稳定、调试方便等特点。该模块在实际应用中得到了验证,并取得了良好的效果。     

Scalable satisfiability checking and test data generation from modeling diagrams

We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language. ORM is a popular conceptual modeling language, primarily targeting database applications, with significant uses in practice. The general problem of even checking whether an ORM diagram is satisfiable is quite hard: restricted forms are easily NP-hard and the problem is undecidable for some expressive formulations of ORM. Brute-force mapping to input for constraint and SAT solvers does not scale: state-of-the-art solvers fail to find data to satisfy uniqueness and mandatory constraints in realistic time even for small examples. We instead define a restricted subset of ORM that allows efficient reasoning yet contains most constraints overwhelmingly used in practice. We show that the problem of deciding whether these constraints are consistent (i.e., whether we can generate appropriate test data) is solvable in polynomial time, and we produce a highly efficient (interactive speed) checker. Additionally, we analyze over 160 ORM diagrams that capture data models from industrial practice and demonstrate that our subset of ORM is expressive enough to handle their vast majority.     

软件质量控制的群体协同工作模型

当前软件的开发离不开协同工作。文章通过研究软件开发各个阶段中所存在的各种角色,着重引出了三组角色：质量保证组、开发组和测试组,并在详细分析它们在软件开发过程中的相互作用的基础上,提出了一个软件质量控制的群体协同工作模型。     

系统测试平台的设计与实现

文章针对系统测试任务的工作性质和工作需求,首先分析了分布式实时应用系统的系统测试的特征和要求,并结合国际上软件发展的趋势,提出了管理者／代理系统测试模型。依据该模型提炼出可重用的评测支持系统（Evaluation and Test Supporting System,ETSS）作为系统测试平台,并从接口、管理、通信、同步、实时性和测试实施等几个方面阐述了ETSS的设计思想和原则,及其具有的基本功能。最后,以一个已实现的评测支持系统为例,介绍有关的实现情况。     

一种基于Windows9X/NT的考试系统的研究与实现

文章以计算机基础知识考试软件系统为背景,就考试的“无纸化”提出了一套完整的考试系统的实现方案。并论述了基于试题原语的考题的组成、具有Windows特点的考试环境和实现快速、安全自动阅卷中的有关技术问题。     

Generating Test Sets from Non-Deterministic Stream X-Machines

X-machines were proposed by Holcombe as a possible specification language and since then a number of further investigations have demonstrated that the model is intuitive and easy to use as well as general enough to cater for a wide range of applications. In particular (generalised) stream X-machines have been found to be extremely useful as a specification method and most of the theory developed so far has concentrated on this particular class of X-machines. Furthermore, a method for testing systems specified by stream X-machines exists and is proved to detect all faults of the implementation provided that the system meets certain initial requirements. However, this method can only be used to generate test sequences from deterministic X-machine specifications. In this paper we present the theoretical basis for a method for generating test sets from non-deterministic generalised stream X-machines. Received November 1999 / Accepted in revised form September 2000     

Separation of synchronous and asynchronous communication via testing

One of the early results concerning the asynchronous π$\pi$-calculus which significantly contributed to its popularity is the capability of encoding the output prefix of the (choiceless) π$\pi$-calculus in a natural and elegant way. Encodings of this kind were proposed by Honda and Tokoro, by Nestmann and (independently) by Boudol. We investigate whether the above encodings preserve De Nicola and Hennessy’s testing semantics. In this sense, it turns out that, under some general conditions, no encoding of the output prefix is able to preserve the must testing. This negative result is due to (a) the non-atomicity of the sequences of steps which are necessary in the asynchronous π$\pi$-calculus to mimic synchronous communication, and (b) testing semantics’ sensitivity to divergence.     

Bluetooth协议栈一致性测试

Bluetooth协议栈实现的一致性测试是保证不同厂商产品之间互连与互操作的基础。文章基于OSI协议一致性测试标准进行了Bluetooth协议一致性测试研究和实际测试,并以L2CAP层协议为例介绍了一致性测试的方法、结构、测试集的设计生成与完备性分析。