Software Modularity Coupling Resolution by the Laplacian of a Bipartite Dependency Graph

Iaakov Exman, Netanel Ohayon

2019

Abstract

Software modularity by pinpointing and subsequent resolution of the remaining coupling problems is often assumed to be a general approach to optimize any software system design. However, software coupling types with differing specific characteristics, seemingly pose serious impediments to any generic coupling resolution approach. Despite the diversity of types, this work proposes a generic approach to solve any coupling type in three steps: a-obtain the Dependency graph for the coupled modules; b-convert the dependency graph into a Bipartite Graph; c-generate the Laplacian Matrix from the Bipartite Graph. Coupling problems to be resolved are then located, using Laplacian eigenvectors, in particular the Fiedler eigenvector. The generic approach is justified, explained in detail, and illustrated by a few case studies.

Paper Citation

in Harvard Style

Exman I. and Ohayon N. (2019). Software Modularity Coupling Resolution by the Laplacian of a Bipartite Dependency Graph.In Proceedings of the 14th International Conference on Software Technologies - Volume 1: ICSOFT, ISBN 978-989-758-379-7, pages 298-305. DOI: 10.5220/0007955802980305

in Bibtex Style

@conference{icsoft19,
author={Iaakov Exman and Netanel Ohayon},
title={Software Modularity Coupling Resolution by the Laplacian of a Bipartite Dependency Graph},
booktitle={Proceedings of the 14th International Conference on Software Technologies - Volume 1: ICSOFT,},
year={2019},
pages={298-305},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007955802980305},
isbn={978-989-758-379-7},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 14th International Conference on Software Technologies - Volume 1: ICSOFT,
TI - Software Modularity Coupling Resolution by the Laplacian of a Bipartite Dependency Graph
SN - 978-989-758-379-7
AU - Exman I.
AU - Ohayon N.
PY - 2019
SP - 298
EP - 305
DO - 10.5220/0007955802980305