27,944 Hits in 11.1 sec

The effect of call graph construction algorithms for object-oriented programs on automatic clustering

D. Rayside, S. Reuss, E. Hedges, K. Kontogiannis
Proceedings IWPC 2000. 8th International Workshop on Program Comprehension  
A number of algorithms for the static construction of an object-oriented program's call graph have been developed in the compiler optimization literature in recent years.  ...  Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study.  ...  Acknowledgments This work was funded by the IBM Canada Ltd Centre for Advanced Studies and the National Research Council of Canada. We thank the anonymous referees for their considered criticism.  ... 
doi:10.1109/wpc.2000.852493 dblp:conf/iwpc/RaysideRHK00 fatcat:3yapb2iqwndsjboih2po7bsaki

Evolutionary unit testing of object-oriented software using strongly-typed genetic programming

Stefan Wappler, Joachim Wegener
2006 Proceedings of the 8th annual conference on Genetic and evolutionary computation - GECCO '06  
Not only approaches that search for numeric test data for procedural test objects have been investigated, but also techniques for automatically generating test programs that represent object-oriented unit  ...  We performed experiments with four test objects. The initial results are promising: high code coverages were achieved completely automatically for all of the test objects.  ...  Figure 1: test cluster for class Controller A unit test case for object-oriented software consists of a method call sequence and one or more assertion statements.  ... 
doi:10.1145/1143997.1144317 dblp:conf/gecco/WapplerW06 fatcat:szriapjmnbdzhfboxgs2wjzl3e

Approximating object based architecture for legacy software written in procedural languages using Variable Neighborhood Search

Md. Selim, Md. Saeed Siddik, Tajkia Rahman, Alim Ul Gias, Shah Mostafa Khaled
2014 The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)  
The method provides a set of clusters that gives a clue for possible structure of the object oriented architecture.  ...  This approach is based on the objective to minimize the coupling and maximize the cohesion within the clusters.  ...  VARIABLE NEIGHBORHOOD SEARCH FOR OPTIMAL GRAPH CLUSTERING Although local search algorithm is very effective in searching solutions to different optimization problems, it suffers the problem of getting  ... 
doi:10.1109/skima.2014.7083558 fatcat:sk7j7o63rbcxjittpkzlg4b4zq

Remodularizing Legacy Model Transformations with Automatic Clustering Techniques

Andreas Rentschler, Dominik Werle, Qais Noorshams, Lucia Happe, Ralf H. Reussner
2014 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems  
In this paper, we propose to apply clustering algorithms to find decompositions of transformation programs at the method level.  ...  In contrast to clustering techniques for general-purpose languages, we integrate not only method calls but also class and package dependencies of the models into the process.  ...  This research has been funded by the German Research Foundation (DFG) under the Priority Programme SPP 1593.  ... 
dblp:conf/models/RentschlerWNHR14 fatcat:2fpdpl5agrc4ncfeh6bp5l6t6e

On regression testing of object-oriented programs

David C Kung, Jerry Gao, Pei Hsia, Yasufumi Toyoshima, Cris Chen
1996 Journal of Systems and Software  
Although a number of studies have addressed the problems and solutions in regression testing of traditional programs, no studies have focused on the issues and solutions in regression testing of object-oriented  ...  In this article, we discuss various types of code changes of classes in an object-oriented program and present a method for identifying these changes and the affected classes.  ...  may contain only one vertex (such clusters are called unit I3 This is also called a strongly connected subgraph in graph theory. clusters).  ... 
doi:10.1016/0164-1212(95)00047-x fatcat:7zo5msrw45gllpymuiaxo22npe

Towards fully user transparent task and data parallel image processing

J. Lemeire, Yan Zhao, P. Schelkens, S. De Backer, F. Cornelissen, B. Torfs
2009 2009 Proceedings of 6th International Symposium on Image and Signal Processing and Analysis  
Interoperation optimization is attained by efficient scheduling of the tasks. The task dependency graph is automatically created at runtime.  ...  All features necessary for efficient parallel processing are specified by the task objects.  ...  Peter Schelkens is supported by a postdoctoral fellowship with the Fund for Scientific Research Flanders (FWO).  ... 
doi:10.1109/ispa.2009.5297660 fatcat:b4vceaffczemdh2kcjbca32rji

Test Case Reduction Techniques - Survey

Marwah Alian, Dima Suleiman, Adnan Shaout
2016 International Journal of Advanced Computer Science and Applications  
Therefore, regression testing reduction eliminates the redundant test cases in the regression testing suite and saves cost of this phase.  ...  In order to validate the correctness of the new version software project that resulted from maintenance phase, Regression testing reruns the regression testing suite to ensure that the new version.  ...  To reduce the cost of regression testing, the study of [46] uses two algorithms: the first one generates a program called differences, this algorithm called like this since it captures the difference  ... 
doi:10.14569/ijacsa.2016.070537 fatcat:vryfh5ebw5dcrcbdm2txu3n2qa

User Transparent Task Parallel Multimedia Content Analysis [chapter]

Timo van Kessel, Niels Drost, Frank J. Seinstra
2010 Lecture Notes in Computer Science  
As most MMCA researchers are not also experts in the field of HPC, there is a demand for programming models and tools that can help MMCA researchers in applying these techniques.  ...  The research area of Multimedia Content Analysis (MMCA) considers all aspects of the automated extraction of knowledge from multimedia archives and data streams.  ...  Fig. 2 . 2 Task graph construction. Each API call leads to the creation of a future object and an operation node; importing data from file leads to the creation of a source node.  ... 
doi:10.1007/978-3-642-15291-7_5 fatcat:km6lgavtvzey7kuubq722axoai

A Regional Industry Intelligence Business Platform based on Adaptive Clustering

2020 North atlantic university union: International Journal of Circuits, Systems and Signal Processing  
Therefore, a Industrial Internet Platform for Regional Economic based on Adaptive Clustering called IIPRE is developed.  ...  The construction of the platform provides enterprises with comprehensive, timely, effective and accurate business competitive intelligence services, improves the strategic planning, competitive intelligence  ...  on data partition, focusing on solving the parallel problem of hierarchical clustering algorithm.  ... 
doi:10.46300/9106.2020.14.84 fatcat:qzlf4amzrrge5d2l3pty54pbym

Strongly-typed genetic programming and purity analysis

José Carlos Bregieiro Ribeiro, Mário Alberto Zenha-Rela, Francisco Fernandéz de Vega
2008 Proceedings of the 10th annual conference on Genetic and evolutionary computation - GECCO '08  
The focus of our on-going work is on employing evolutionary algorithms for generating test data for the structural unit-testing of Java programs.  ...  Search-based test case generation for object-oriented software is hindered by the size of the search space, which encompasses the arguments to the implicit and explicit parameters of the test object's  ...  Unit-test cases for object-oriented (OO) software consist of method call sequences (MCS), which define the test scenario.  ... 
doi:10.1145/1389095.1389439 dblp:conf/gecco/RibeiroRV08 fatcat:sortasxd7fb4hdcq4rvcbjdvda

Object-Oriented Modeling of Object-Oriented Concepts [chapter]

Michela Pedroni, Bertrand Meyer
2010 Lecture Notes in Computer Science  
The present work describes an approach to modeling educational domains and reports on the results for object-orientation.  ...  It analyzes the dependency structure of object-oriented concepts and describes the implications that the high interrelatedness of concepts has on teaching introductory programming.  ...  Herding from RWTH Aachen for testing TrucStudio and providing a partial model of object-oriented programming in Java. We are grateful to the anonymous referees for many useful comments.  ... 
doi:10.1007/978-3-642-11376-5_15 fatcat:bks5xp5czvgpra7qaw7tz76nte

An approach to analyzing executable code based on recovery of software architecture
Подход к анализу исполняемого кода на основе восстановления программной архитектуры

D.S. Kononov
2018 Proceedings of the Institute for System Programming of RAS  
This method is based on the functions clustering by the distances between them in the address space and on the call graph.  ...  A description of the implementation of the developed method as a plug-in for the IDA disassembler is given. For citation: Kononov D.S.  ...  It is planned to implement automatic clustering methods; to take into account the relationship graph of functions based on the using data in addition to the call graph; to perform software modules classification  ... 
doi:10.15514/ispras-2018-30(5)-4 fatcat:fwopd7mg5feypgqu4oiq7lv6g4

Segregating feature interfaces to support software product line maintenance

Bruno B. P. Cafeo, Claus Hunsen, Alessandro Garcia, Sven Apel, Jaejoon Lee
2016 Proceedings of the 15th International Conference on Modularity - MODULARITY 2016  
Therefore, we propose a graph representation that is able to capture the collaboration between members and apply a clustering algorithm to it to group highly-related members and segregate non-related members  ...  On a set of ten versions of a real-world product line, we evaluate the effectiveness of our approach, by comparing the two types of feature interfaces (segregated vs. original interfaces) with co-change  ...  Clustering We use the Markov Cluster (MCL) algorithm [14] to cluster the extracted MRGs. MCL is a cluster algorithm for graphs based on the simulation of stochastic flows in graphs.  ... 
doi:10.1145/2889443.2889451 dblp:conf/aosd/CafeoHGAL16 fatcat:arpkrnkfnbgcbctoalnonnkf2e

Approach to analyzing executable code based on the software architecture recovery

D. S. Kononov
2018 Proceedings of the Institute for System Programming of RAS  
This method is based on the functions clustering by the distances between them in the address space and on the call graph.  ...  A description of the implementation of the developed method as a plug-in for the IDA disassembler is given.  ...  It is planned to implement automatic clustering methods; to take into account the relationship graph of functions based on the using data in addition to the call graph; to perform software modules classification  ... 
doaj:b213a42eadf84b65a6d92ac84d086678 fatcat:mojyixek4rdjladrxqjbji5hhm

A Slice-Based Change Impact Analysis for Regression Test Case Prioritization of Object-Oriented Programs

S. Panda, D. Munjal, D. P. Mohapatra
2016 Advances in Software Engineering  
This paper presents a static approach to prioritizing the test cases by computing the affected component coupling (ACC) of the affected parts of object-oriented programs.  ...  We construct a graph named affected slice graph (ASG) to represent these affected program parts. We determine the fault-proneness of the nodes of ASG by computing their respective ACC values.  ...  of a call graph.  ... 
doi:10.1155/2016/7132404 fatcat:bcr234aokjg4dbgjpr7ef4rtti
« Previous Showing results 1 — 15 out of 27,944 results