A large number of path-oriented testing criteria have been proposed in the last twenty years. Surprisingly, almost all of them suffer from a serious weakness, which is called the untestedness syndrome: even though a c...
详细信息
A large number of path-oriented testing criteria have been proposed in the last twenty years. Surprisingly, almost all of them suffer from a serious weakness, which is called the untestedness syndrome: even though a criterion is satisfied, sonic statements of the program under test may remain `untested', i.e., the observed test output does not depend on them. A new data-flow based testing criterion is introduced which does not suffer from untestedness, called the All program function (APF) criterion. Intuitively, it requires that each possible computation to every output statement in a program be covered by some test;but for lots of programs APF would require an infinite number of tests. A second, applicable criterion is thus introduced, derived from APF and called the Basic program function (BPF) criterion. BPF leaves no statement untested and yields finite test suites. Some examples show the application of BPF and investigate the failure-detection capability of the proposed criterion. Copyright (C) 2001 John Wiley Sons, Ltd.
It was previously shown by Barzdin and Podnieks that one does not increase the power of learning programs for functions by allowing learning algorithms to converge to a finite set of correct programs instead of requir...
详细信息
It was previously shown by Barzdin and Podnieks that one does not increase the power of learning programs for functions by allowing learning algorithms to converge to a finite set of correct programs instead of requiring them to converge to a single correct program. In this paper we define some new, subtle, but natural concepts of mind change complexity for function learning and show that, if one bounds this complexity for learning algorithms, then, by contrast with Barzdin and Podnieks result, there are interesting and sometimes complicated trade-offs between these complexity bounds, bounds on the number of final correct programs, and learning power. (C) 1995 Academic Press, Inc.
The increasing criticality of software applications, the increasing size and complexity of such applications, and the increasing reliance of software engineering paradigms on third party software assets combine to pla...
详细信息
The increasing criticality of software applications, the increasing size and complexity of such applications, and the increasing reliance of software engineering paradigms on third party software assets combine to place a high premium on the ability to analyze software products to an arbitrary level of thoroughness and precision. Yet despite several decades of research, the goal of analyzing the functional properties of software products to an arbitrary level of thoroughness and precision remains unfulfilled. In this paper, we discuss the use of a relation-theoretic approach inspired from Mills' logic to analyze while loops, and we support our approach by an operational prototype tool. The proposed method and tool have applications in program comprehension, reverse engineering, program verification, software maintenance, and programmer education.
Heart rate telemetry with its software design is built on the Windows operating system platforms currently widespread use of microcomputers. It can be achieved that using a computer to automatically collect heart rate...
详细信息
Heart rate telemetry with its software design is built on the Windows operating system platforms currently widespread use of microcomputers. It can be achieved that using a computer to automatically collect heart rate, analysis and processing the automatic assessment of exercise load. It can also improve the analysis efficiency evaluation of student movement load in physical education class. It has high practicability and popularization.
暂无评论