检索结果-内蒙古大学图书馆

Test coverage analysis based on an object-oriented program model

JOURNAL OF SOFTWARE MAINTENANCE AND EVOLUTION-RESEARCH AND PRACTICE 2011年第7期23卷 465-493页

作者： Najumudheen, E. S. F. Mall, Rajib Samanta, Debasis Indian Inst Technol Dept Comp Sci & Engn Kharagpur 721302 W Bengal India Indian Inst Technol Sch Informat Technol Kharagpur 721302 W Bengal India

We propose a novel test coverage analysis technique for object-oriented (OO) programs. An important novelty of our technique is the use of a single coherent model, Call-based object-oriented System Dependence Graph (COSDG), which helps in presenting a unified test coverage analysis framework for OO programs. COSDG represents both procedural and OO features. Our technique not only uses the model to identify the different program features that are to be exercised by a test suite, but also captures the executed program features in the model for subsequent coverage evaluation and reporting. During test executions, the model elements corresponding to the executed features are marked. This helps in determining coverage on-the-fly, without the need to store the execution traces in a file. We describe the computation of various coverage measures, both procedural and OO, from the model elements. We have implemented our model-based technique in a prototype tool, named KANZ. The experimental results obtained by using the tool demonstrate the efficacy and efficiency of our technique in determining OO coverage measures. Copyright (C) 2010 John Wiley & Sons, Ltd.

关键词： Coverage analysis software testing object-oriented program program model

来源：评论

学校读者我要写书评

暂无评论

A Testing Method for object-oriented program based on Adaptive Random Testing with Variable Probability 21

A Testing Method for Object-oriented Program based on Adapti...

引用

21st IEEE International Conference on Software Quality, Reliability and Security (QRS)

作者： Lv, Tianxiang Bao, Qihao Chen, Haibo Zhang, Chi Jiangsu Univ Sch Comp Sci & Commun Engn Zhenjiang 212013 Jiangsu Peoples R China

ISBN: (纸本)9781665478366

object-oriented program (OOP) is very popular in these years for its advantages, but the testing method for OOP is still not mature enough. To deal with the problem that it is impossible to generate the probability density function by simply numeralizing a point in the lest case caused by the complex structure of the object-oriented test case, we propose the Adaptive Random Testing through Test Profile for object-oriented software (ART(TP)-OO). It generates a test case at the edge of the input field and calculates the distance between object-oriented test cases using object and Method Invocation Sequence Similarity (OMISS) metric formula. And the probability density function is generated by the distance to select the test cases, thereby realizing the application of ART(TP) algorithm in OOP. The experimental results indicate the proposed ART(TP)-OO consumes less time cusi without reducing the detection effectiveness.

关键词： object-oriented program Probability Density Function Adaptive Random Testing

来源：评论

学校读者我要写书评

暂无评论

A Dependence Graph-based Test Coverage Analysis Technique for object-oriented programs

A Dependence Graph-based Test Coverage Analysis Technique fo...

引用

6th International Conference on Information Technology - New Generations (ITNG 2009)

作者： Najumudheen, E. S. F. Mall, Rajib Samanta, Debasis Indian Inst Technol Dept Comp Sc & Engg Kharagpur 731302 W Bengal India Indian Inst Technol Sch Informat Tech Kharagpur 731302 W Bengal India

ISBN: (纸本)9781424437702

We propose a novel test coverage analysis technique for object-oriented programs. Our technique consists of three phases: graph construction, instrumentation, and coverage analysis. In the graph construction phase, the source program is converted into a dependence graph-based representation, named Call-based object-oriented System Dependence Graph (COSDG). In the instrumentation phase, the source code is instrumented at specific points. During the coverage analysis phase, the instrumented source code is executed for different test inputs, and the edges of COSDG are marked by the graph marker Various coverage measures are computed from the marked COSDG by the coverage analyzer to finally produce a coverage report. Inheritance and polymorphic coverage are considered in addition to traditional coverage measures.

关键词： Test coverage analysis software testing object-oriented program dependence graph

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Impact Analysis Approach for object-oriented programs

A Dynamic Impact Analysis Approach for Object-oriented Progr...

引用

International Conference on Advanced Software Engineering and Its Applications

作者： Huang, Lulu Song, Yeong-Tae Towson Univ Dept Comp & Informat Sci Towson MD 21014 USA

ISBN: (纸本)9780769534329

We introduced a dynamic impact analysis approach [1] for OO programs that considers the unique features of OO programs compared to procedural ones and the dependency relationships of OO runtime program entities. In this paper, we present the further improved approach with the ability to identify runtime OO inheritance relationships. Furthermore, we present the implementation Of our approach - a tool named Java (TM) Dynamic Impact Analyzer (JDIA) that can perform dynamic impact analysis for Java programs residing in a local or a remote Java Virtual Machine (JVM). Empirical studies of JDIA are presented to show that our approach produces more precise results than the existing dynamic impact analysis techniques by performing dependency analysis.

关键词： dynamic impact analysis object-oriented program software impact analyzer

来源：评论

学校读者我要写书评

暂无评论

Dynamic Slicing of object-oriented programs in Presence of Inheritance 1

Dynamic Slicing of Object-Oriented Programs in Presence of I...

引用

1st International Conference on Computational Intelligence in Data Mining (ICCIDM)

作者： Mohanty, S. R. Sahu, M. Behera, P. K. Mohapatra, D. P. Rims Dept CS Rourkela 769012 Odisha India NIT Rourkela Dept CSE Rourkela 769008 Odisha India Utkal Univ Dept CSA Bhubneswar 751004 Odisha India

ISBN: (纸本)9788132222088;9788132222071

This paper proposes an DG traversal dynamic slicing algorithm for dynamic slicing of object-oriented programs in presence of inheritance, which can facilitate various software engineering activities like program comprehension, testing, debugging, reverse engineering, maintenance etc. This paper creates an intermediate program representation called dynamic graph to represent the execution trace of an object-oriented program. Then the proposed slicing algorithm is applied on the intermediate representation to compute the dynamic slice. The advantage of this approach is that, the intermediate program representation is small, hence needs less memory to store and the proposed algorithm is space efficient as well as time efficient and computes precise dynamic slices.

关键词： Dynamic slice Dynamic graph object-oriented program

来源：评论

学校读者我要写书评

暂无评论

A manufacturing model to enable knowledge maintenance in decision support systems

引用

JOURNAL OF MANUFACTURING SYSTEMS 2006年第2期25卷 122-136页

作者： Guerra-Zubiaga, David A. Young, Robert I. M. Technol Monterrey Ctr Innovac Diseno & Tecnol Monterrey Nuevo Leon Mexico Univ Loughborough Wolfson Sch Mech & Mfg Engn Loughborough Leics England

Modeling manufacturing knowledge is a requirement to design a decision support system. The research reported in this paper defined a Manufacturing Facility Information and Knowledge Model (MFIKM);this model allows the storage, access, and management of both information and knowledge related to the manufacturing facility. Major emphasis was placed on process knowledge and resource knowledge to support process planning decisions. This work also explains the relevance of using different types of knowledge categorization. This paper argues that by using the novel Knowledge Maintenance Life Cycle as a method to maintain knowledge, it is possible to capture new and valuable machining knowledge using different types of representations. An experimental software application is presented to demonstrate the research ideas.

关键词： manufacturing model knowledge and information model decision support knowledge maintenance knowledge structures object-oriented program

来源：评论

学校读者我要写书评

暂无评论

GCLgrid: A three-dimensional geographical curvilinear grid library for computational seismology

引用

COMPUTERS & GEOSCIENCES 2006年第3期32卷 371-381页

作者： Fan, CL Pavlis, GL Tuncay, K Indiana Univ Dept Geol Sci Bloomington IN 47405 USA Indiana Univ Dept Chem Bloomington IN 47405 USA

We developed a general library for handling a class of objects we call geographical curvilinear grids (GCLgrids). A GCLgrid is a distorted, uniform grid that is georeferenced. The GCLgrid library is implemented in an object oriented system with methods that relate points in the grid to a geographic reference frame. A simple example is a spherical shell divided along latitude, longitude, and depth, but more elaborate shapes can use the same interface. Scalar and vector fields are derived from the base grid through inheritance. Two algorithms are the core of this library. First, we use the Direction Set method to search for a location in space from a starting point. This algorithm converges reasonably fast if the grid is not extremely distorted. Second, we interpolate the grid using methods known from finite element analysis. A Jacobian matrix for an 8-node cube is computed to transform a distorted cube into a unit one. Shape functions for the standard cube are used to compute interpolation coefficients. Once the interpolation coefficients are computed, we can interpolate n-element vectors almost as quickly as scalar data. We show an application of the library to travel time table calculation at regional distances. Our table interpolator was found to be 10 times faster than one based on the tau-p method and is expected to be several orders of magnitude faster than 3D ray-tracing methods. Travel time interpolation errors are reduced significantly by tabulating delay times relative to a homogenous reference model instead of absolute times. This allows much coarser grids to be used at large scales comparing to one using total time. (c) 2005 Published by Elsevier Ltd.

关键词： grid object direction set method finite element analysis travel time object-oriented program

来源：评论

学校读者我要写书评

暂无评论

Type slicing: An accurate object oriented slicing based on sub-statement level dependence graph

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2020年 127卷 106369-106369页

作者： Wang Lulu Li Bixin Kong Xianglong Southeast Univ Sch Comp Sci & Engn Nanjing Peoples R China

Context: program slicing is very useful in program analysis and software engineering. It computes the slice, which is a part of program and contains all the statements related to the given slicing criterion. The more accurate a slicing technique could be, the smaller the slice is. objective: This paper aims to improve the current slicing accuracy for object-oriented programs. The slicing accuracy is mainly related to three factors, the dependency graph (which extracts the inner relationships of source code), the slicing criterion (which determines the slicing requirement), and the slicing algorithm (which computes the slice for the criterion from the dependency graph). Method: Our method consists of three parts. First, we present a Sub-Statement Level Dependence Graph (SSLDG), which computes finer-grained dependences for object-oriented programs than mostly-used statement level graph. Second, we present a new type slicing criterion called (Sub-statement) Type Slicing Criterion (STSC), which supports the user to specify not only the statement and object variable, but also the type of object among its polymorphic types. At last, a corresponding slicing algorithm called (Sub-statement) Type Slicing (STS) is designed to perform the slicing process. Results: We implement STS on Java programs as MyJavaSlicer, and run it with ten open source projects and random slicing criteria. The results show that STS slicing algorithm as well as SSLDG would make slices 35.90% smaller than traditional two-phase slicing;additionally using STSC would make the slices 48.4% further smaller;STSC also helps traditional two-phase slices reduced by 56.90%. Conclusions: STS could provide more accurate slices than traditional two-phase slicing, and it also runs faster on most cases;STSC helps specify the slicing requirement, and roughly halves the size of slices for both slicing algorithms.

关键词： program slicing System dependence graph object-oriented program Slicing algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed dynamic slicing of Java programs

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2006年第12期79卷 1661-1678页

作者： Mohapatra, Durga P. Kumar, Rajeev Mall, Rajib Kumar, D. S. Bhasin, Mayank Natl Inst Technol Dept Comp Sci & Engn Rourkela 769008 Orissa India Indian Inst Technol Dept Comp Sci & Engn Kharagpur 721302 W Bengal India

We propose a novel dynamic slicing technique for distributed Java programs. We first construct the intermediate representation of a distributed Java program in the form of a set of Distributed program Dependence Graphs (DPDG). We mark and unmark the edges of the DPDG appropriately as and when dependencies arise and cease during run-time. Our algorithm can run parallely on a network of computers, with each node in the network contributing to the dynamic slice in a fully distributed fashion. Our approach does not require any trace files to be maintained. Another advantage of our approach is that a slice is available even before a request for a slice is made. This appreciably reduces the response time of slicing commands. We have implemented the algorithm in a distributed environment. The results obtained from our experiments show promise. (C) 2006 Elsevier Inc. All rights reserved.

关键词： program slicing dynamic slicing program dependence graph debugging object-oriented program multithreading Java distributed programming

来源：评论

学校读者我要写书评

暂无评论

引用

IET SOFTWARE 2009年第1期3卷 46-57页

作者： Al Dallal, J. Kuwait Univ Coll Women Dept Informat Sci Safat 13060 Kuwait

Cohesion is an important factor used in evaluating software design quality and modularity. The cohesion of a module refers to the relatedness of the module components. In software engineering, highly cohesive modules are highly desirable because of their high reusability and maintainability. Cohesion is classified according to levels. Functional cohesion, the strongest level, refers to how closely the module parts that contribute to different outputs are related. Here, a similarity-based functional cohesion (SBFC) metric is introduced to measure the functional cohesion of a module in a procedural or object-oriented program. The metric uses the degree of similarity between the data slices of the module as a basis to measure functional cohesion. The appropriateness of the metric is evaluated both theoretically and empirically. The evaluation results show that the metric does as well as some earlier metrics in indicating the level of cohesiveness and it does better than some in terms of providing different values for the modules of different cohesion. In addition, the SBFC metric is used as an indicator for restructuring the weakly cohesive modules.

关键词： Software metrics software similarity-based functional cohesion metric software reusability software maintenance software metrics systems analysis object-oriented program Software engineering techniques software engineering software design quality

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：