Optimizing construction of scheduled data flow graph for on-line testability

The objective of this work is to develop a new methodology for behavioural synthesis using a flow of synthesis, better suited to the scheduling of independent calculations and non-concurrent online testing. The traditional behavioural synthesis process can be defined as the compilation of an algorithmic specification into an architecture composed of a data path and a controller. This stream of synthesis generally involves scheduling, resource allocation, generation of the data path and controller synthesis. Experiments showed that optimization started at the high level synthesis improves the performance of the result, yet the current tools do not offer synthesis optimizations that from the RTL level. This justifies the development of an optimization methodology which takes effect from the behavioural specification and accompanying the synthesis process in its various stages. In this paper we propose the use of algebraic properties (commutativity, associativity and distributivity) to transform readable mathematical formulas of algorithmic specifications into mathematical formulas evaluated efficiently. This will effectively reduce the execution time of scheduling calculations and increase the possibilities of testability

Using formal methods to support testing

Formal methods and testing are two important approaches that assist in the development of high quality software. While traditionally these approaches have been seen as rivals, in recent years a new consensus has developed in which they are seen as complementary. This article reviews the state of the art regarding ways in which the presence of a formal specification can be used to assist testing

Analysis of Hardware Descriptions

The design process for integrated circuits requires a lot of analysis of circuit descriptions. An important class of analyses determines how easy it will be to determine if a physical component suffers from any manufacturing errors. As circuit complexities grow rapidly, the problem of testing circuits also becomes increasingly difficult. This thesis explores the potential for analysing a recent high level hardware description language called Ruby. In particular, we are interested in performing testability analyses of Ruby circuit descriptions. Ruby is ammenable to algebraic manipulation, so we have sought transformations that improve testability while preserving behaviour. The analysis of Ruby descriptions is performed by adapting a technique called abstract interpretation. This has been used successfully to analyse functional programs. This technique is most applicable where the analysis to be captured operates over structures isomorphic to the structure of the circuit. Many digital systems analysis tools require the circuit description to be given in some special form. This can lead to inconsistency between representations, and involves additional work converting between representations. We propose using the original description medium, in this case Ruby, for performing analyses. A related technique, called non-standard interpretation, is shown to be very useful for capturing many circuit analyses. An implementation of a system that performs non-standard interpretation forms the central part of the work. This allows Ruby descriptions to be analysed using alternative interpretations such test pattern generation and circuit layout interpretations. This system follows a similar approach to Boute's system semantics work and O'Donnell's work on Hydra. However, we have allowed a larger class of interpretations to be captured and offer a richer description language. The implementation presented here is constructed to allow a large degree of code sharing between different analyses. Several analyses have been implemented including simulation, test pattern generation and circuit layout. Non-standard interpretation provides a good framework for implementing these analyses. A general model for making non-standard interpretations is presented. Combining forms that combine two interpretations to produce a new interpretation are also introduced. This allows complex circuit analyses to be decomposed in a modular manner into smaller circuit analyses which can be built independently

Methods for testing of analog circuits

Práce se zabývá metodami pro testování lineárních analogových obvodů v kmitočtové oblasti. Cílem je navrhnout efektivní metody pro automatické generování testovacího plánu. Snížením počtu měření a výpočetní náročnosti lze výrazně snížit náklady za testování. Práce se zabývá multifrekveční parametrickou poruchovou analýzou, která byla plně implementována do programu Matlab. Vhodnou volbou testovacích kmitočtů lze potlačit chyby měření a chyby způsobené výrobními tolerancemi obvodových prvků. Navržené metody pro optimální volbu kmitočtů byly statisticky ověřeny metodou MonteCarlo. Pro zvýšení přesnosti a snížení výpočetní náročnosti poruchové analýzy byly vyvinuty postupy založené na metodě nejmenších čtverců a přibližné symbolické analýze.The thesis deals with methods for testing of linear analog circuits in the frequency domain. The goal is to develop new efficient methods for automatic test plan generation. To reduce test costs a minimum number of measurements as well as less computational demands are the fundamental aims. The thesis is focused on the multi-frequency parametric fault diagnosis which was fully implemented in the Matlab program. The fundamental problem consists in selection of test frequencies which can reduce the influences of measurement errors and errors caused by tolerances of well-working components. The proposed methods for test frequency selection were statistically verified by the MonteCarlo method. To improve the accuracy and reduce the computational complexity of fault diagnosis, the methods based on least-square techniques and approximate symbolic analysis were presented.

An Integrated Test Plan for an Advanced Very Large Scale Integrated Circuit Design Group

VLSI testing poses a number of problems which includes the selection of test techniques, the determination of acceptable fault coverage levels, and test vector generation. Available device test techniques are examined and compared. Design rules should be employed to assure the design is testable. Logic simulation systems and available test utilities are compared. The various methods of test vector generation are also examined. The selection criteria for test techniques are identified. A table of proposed design rules is included. Testability measurement utilities can be used to statistically predict the test generation effort. Field reject rates and fault coverage are statistically related. Acceptable field reject rates can be achieved with less than full test vector fault coverage. The methods and techniques which are examined form the basis of the recommended integrated test plan. The methods of automatic test vector generation are relatively primitive but are improving

Are Metaphysical Claims Testable?

To consider metaphysical claims a priori and devoid of empirical content, is a rather commonplace received opinion. This paper attempts an exploration of a contemporary philosophical heresy: it is possible to test metaphysical claims if they play an indispensable role in producing empirical success, i.e. novel predictions. To do so one, firstly, needs to express the metaphysical claims employed in the logico-mathematical language of a scientific theory, i.e. to explicate them. Secondly, they should have an understanding of what it is to test and to verify or to falsify a metaphysical claim. Finally, they also need to consider the philosophical practice of testing a metaphysical claim. These three aspects are introduced in this paper and they are illustrated by means of the metaphysical concept of common cause and the principle of the common cause

TESTABILITY OF INFORMATION LEAK IN THE SOURCE CODE FOR INDEPENDENT TEST ORGANIZATION BY USING BACK PROPAGATION ALGORITHM

A strategy for software testing integrates the design of software test cases into a wellplanned series of steps that results in a successful development of the software security. The strategy provides the secure source code test by Independent Test Organization (ITO) that describes the steps to be taken, when, and how much effort, time, and resources will be required. The strategy incorporates test planning, test case design, test execution, test result collection and test leak information and evaluation. In this work we speak about the testability of leak information in source code and how to detect and protect it inside the ITO. In this paper we present a privacy preserving algorithm for the neural network learning to detect and protect the leak information in source code between two parties the programmer (source code) and Independent Test Organization (Sensor). We show that our algorithm is very secure and the sensor inside Independent Test Organization is able to detect and protect all leaks information inside the source code. We demonstrate the efficiency of our algorithm by experiments on real world data. We present new technology for software Security using Back Propagation algorithm. That is embedded sensor to analyze the source code inside the ITO. By using embedded sensor we can detect and protect in real time all the attacks or leaks of information inside the source code. The connection between an Artificial Neural Networks and source code analysis inside Independent Test Organization is providing a great help for the software security

Enhancing the Process of Testing Object -Oriented Systems.

Testing is a crucial step in the overall system development process. Using testing techniques that support features of the underlying software paradigm more effectively tests program than do testing techniques that support features of other paradigms. Systems developed with the object-oriented paradigm require techniques that support object-oriented features such as inheritance, data abstraction, encapsulation, and dynamic binding. Many techniques that are used to test systems developed with the structured paradigm are not sufficient for the testing of object-oriented systems. The goal of this research is to develop methods that will improve the process of testing object-oriented systems. Specifically, emphasis is given to improving the level of testing of methods because the level of method testing is generally considered inadequate. Algorithms are included that identify the set of methods, both interobject and intraobject, that should be tested for a given system. These algorithms are implemented as a part of an automated testing system that derives a framework for the testing of methods. This system includes the automatic generation of test drivers to facilitate the testing. It captures the results of tests for the purposes of reuse for future system maintenance. This framework provides the software engineer who is testing a system a mechanism to determine the level of method coverage that has been achieved in the testing process