We propose a new technique for dynamic slicing of the UML communication models. In this technique, we use UML 2.0 communication diagram for representing the dynamic behavior of the system. First, the communication dia...
详细信息
ISBN:
(纸本)9781467345286
We propose a new technique for dynamic slicing of the UML communication models. In this technique, we use UML 2.0 communication diagram for representing the dynamic behavior of the system. First, the communication diagram is transformed into an intermediate representation which we named Communication Dependence graph (CoDG). Next, we propose a dynamic slicing algorithm which traverses the graph for a given slicing criterion and produces the slice. The algorithm is based on marking and unmarking the edges of CoDG when dependencies between messages arise and cease at runtime. Dynamic behavior is represented by two diagrams namely sequence diagram and communication diagram. The novelty of our approach is that we use the communication diagram of UML model for representing the dynamic nature of the system. The advantage of using communication diagram is that it emphasizes on the objects that interact and links between the objects whereas sequence diagrams emphasizes on ordering of the messages.
In this paper, we have developed an approach to generate test data for path coverage based testing using genetic algorithm. We have used control flow graph and cyclomatic complexity of the example program to find out ...
详细信息
ISBN:
(纸本)9788132212980;9788132212997
In this paper, we have developed an approach to generate test data for path coverage based testing using genetic algorithm. We have used control flow graph and cyclomatic complexity of the example program to find out the number of feasible paths present in the program and compared it with the actual number of paths covered by genetic algorithm. We have used genetic algorithm for generating test data automatically. We have shown that our algorithm is giving cent percent coverage, successfully covering all feasible paths. In our approach, we have observed that genetic algorithm is much more effective in generating test data within less time period, giving better coverage.
The development of dataflow processor architecture is a promising direction for improving the performance of computing systems. The dataflow processors have several advantages in contrast with the von Neumann architec...
详细信息
The development of dataflow processor architecture is a promising direction for improving the performance of computing systems. The dataflow processors have several advantages in contrast with the von Neumann architecture processors. These advantages are express in explicit parallelism of calculations, since in the presentation of programs for the dataflow processors the execution of instructions is limited solely by the fact of input data's ready state. The concept of using tokens as data storage for instructions allows you to remove many problems associated with data conflicts and simplifies the program logic. One of the most important elements in the implementation of the logic of the dataflow processor is the associative token memory, which should provide storage and quick search for ready-made data for instructions that can be transferred for execution. This article discusses the functionality of the dataflow processor emulator and its parts including associative token memory and the logic of its operation using the example of a simple dataflowgraph.
Automated software testing allows testers and managers for generating the quality of test data during each phase of software development. Path coverage based testing is the most effective technique in structural testi...
详细信息
ISBN:
(纸本)9781538623138
Automated software testing allows testers and managers for generating the quality of test data during each phase of software development. Path coverage based testing is the most effective technique in structural testing. The major challenge in path coverage based testing is to generate the test data to cover complete path from beginning till end. Therefore, we require a novel automated test data generation method for the same. Various soft computing techniques are being used to generate the path coverage tests for search-based software testing. In this paper, we have focused on resolving the multi-objective optimization of coverage based test data by proposing Multi-Objective Ant Lion Optimization (MOALO) algorithm. Further, we have discussed that how the proposed algorithm enhance the path coverage with reduced number of tests. To validate the proposed algorithm, we have compared the obtained experimental results with random resting and conventional genetic algorithm's data. These results shows that proposed algorithm outperforms the existing algorithms.
In today's world web applications have become increasingly popular which mandates high reliability and high quality of web applications. With the growing complexity of web applications, developing a reliable web a...
详细信息
ISBN:
(纸本)9781479901920
In today's world web applications have become increasingly popular which mandates high reliability and high quality of web applications. With the growing complexity of web applications, developing a reliable web application in turn requires rigorous testing techniques which are exhaustive, efficient and cost effective. Several researchers have proposed varied methodologies, frameworks and tools to generate test cases for testing web applications by extracting the navigation behavior of web applications using forward or reverse engineering tools. In this paper we propose a Model Based Test Case Generation technique wherein the model representing the navigation behavior of a web application is derived from requirements and low level design. The model is traversed to generate test sequences which can later be incorporated with input data to generate test cases. The proposed approach is also demonstrated by means of a case study.
The security of the web-service program is a very significant facet in the grid computing envroinment. A fuzzer is a program that attempts to discover security vulnerabilities by sending random input to an application...
详细信息
ISBN:
(纸本)9780769538181
The security of the web-service program is a very significant facet in the grid computing envroinment. A fuzzer is a program that attempts to discover security vulnerabilities by sending random input to an application. How to efficiently reduce the fuzzing data scale with the assurance of high fuzzing veracity and vulnerability coverage is a very important issue for its effective practice. In this paper, aimed at the web-service program, a new heuristic method for fuzzing data generation named as H-Fuzzing is be presented, which has high program executing path coverage with the information from the static analysis and dynamic property of the program. The main thought of H-Fuzzing is collecting the information of the key branch predications and building its relations with the input variables in order to supervise the dimension reducing of the fuzzing data aggregation.
Matrices often represent important information in scientific applications and are involved in performing complex calculations. But systematically testing these applications is hard due to the oracle problem. Metamorph...
详细信息
ISBN:
(纸本)9781450357296
Matrices often represent important information in scientific applications and are involved in performing complex calculations. But systematically testing these applications is hard due to the oracle problem. Metamorphic testing is an effective approach to test such applications because it uses metamorphic relations to determine whether test cases have passed or failed. Metamorphic relations are typically identified with the help of a domain expert and is a labor intensive task. In this work we use a graph kernel based machine learning approach to predict metamorphic relations for matrix calculation programs. Previously, this graph kernel based machine learning approach was used to successfully predict metamorphic relations for programs that perform numerical calculations. Results of this study show that this approach can be used to predict metamorphic relations for matrix calculation programs as well.
Selection of spaceborne computing platforms requires balance among several competing factors. Traditional performance analysis techniques are ill-suited for this purpose due to their overriding concern with runtime. T...
详细信息
ISBN:
(纸本)9780769529172
Selection of spaceborne computing platforms requires balance among several competing factors. Traditional performance analysis techniques are ill-suited for this purpose due to their overriding concern with runtime. The suitability measure is a new approach that quantifies the match between a computing platform and a program. It analyzes a program at the opcode and controlflow levels, and compares this to a machine's capability to support the unique characteristics of the program. In this paper we develop the suitability measure and a series of program analysis methods. Experimental results confirm that machines that provide a better match to the program yield a higher suitability score. We prove that loops provide the only contribution to the suitability value, and also that the number of loop iterations is irrelevant, leading to the conclusion that a single pass through a loop is sufficient to derive a suitability value.
In the paradigm of model checking, a formal model is considered as one of the crucial sources that tends to be verified with the desired properties. The definition of the formal model should be understandable and clea...
详细信息
ISBN:
(纸本)9781728121338
In the paradigm of model checking, a formal model is considered as one of the crucial sources that tends to be verified with the desired properties. The definition of the formal model should be understandable and clear in order to express the structure and behaviors of the system visually using diagrammatic tools. In this paper, we focused on the formal model which is written in Promela language that supports the non-determinism of the concurrent system. From our study, we found that the Promela syntax could probably be drawn by using NS-chart visual symbols. The classic NS-chart symbols represents the controlflow of the system that was written in Promela. As a main purpose of this paper, we aim to propose a set of mapping rules for generating the NS-chart drawing from Promela source codes. The result of the drawing with the proposed NS-Chart syntax showed that the Promela controlflow structure could be represented succinctly and the chart could be practically used for tracing the counterexample of the verification.
Malware is a malicious code which is developed to harm a computer or network. The number of malwares is growing so fast and this amount of growth makes the computer security researchers invent new methods to protect c...
详细信息
ISBN:
(纸本)9781467364904;9781467364898
Malware is a malicious code which is developed to harm a computer or network. The number of malwares is growing so fast and this amount of growth makes the computer security researchers invent new methods to protect computers and networks. There are three main methods used to malware detection: Signature based, Behavioral based and Heuristic ones. Signature based malware detection is the most common method used by commercial antiviruses but it can be used in the cases which are completely known and documented. Behavioral malware detection was introduced to cover deficiencies of signature based method. However, because of some shortcomings, the heuristic methods have been introduced. In this paper, we discuss the state of the art heuristic malware detection methods and briefly overview various features used in these methods such as API Calls, OpCodes, N-Grams etc. and discuss their advantages and disadvantages.
暂无评论