Sciweavers

513 search results - page 2 / 103
» Software Components Capture Using Graph Clustering
Sort
View
ICECCS
2005
IEEE
171views Hardware» more  ICECCS 2005»
13 years 10 months ago
Behavior Capture and Test: Automated Analysis of Component Integration
Component-based technology is increasingly adopted to speed up the development of complex software through component reuse. Unfortunately, the lack of complete information about r...
Leonardo Mariani, Mauro Pezzè
ICDCS
2003
IEEE
13 years 10 months ago
Monitoring and Characterization of Component-Based Systems with Global Causality Capture
Current software development techniques and tools lack the capability to characterize function call chains in multithreaded and distributed applications built upon component techn...
Jun Li
ER
2007
Springer
101views Database» more  ER 2007»
13 years 11 months ago
Using Attributed Goal Graphs for Software Component Selection: An Application of Goal-Oriented Analysis to Decision Making
During software requirements analysis and design steps, developers and stakeholders have many alternatives of artifacts such as software component selection and should make decisi...
Kazuma Yamamoto, Motoshi Saeki
CSMR
2009
IEEE
13 years 9 months ago
Software Clustering Using Dynamic Analysis and Static Dependencies
Decomposing a software system into smaller, more manageable clusters is a common approach to support the comprehension of large systems. In recent years, researchers have focused ...
Chiragkumar Patel, Abdelwahab Hamou-Lhadj, Juergen...
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 7 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...