Publikationen aus dem Jahr 2007
Petra Becker-Pechau, Marcel Bennicke
Concepts of Modeling Architectural Modules Views for Compliance Checks Based on Architectural Styles
In: J. Smith (Ed.): Proceedings of the 11th IASTED International Conference on Software Engineering and Applications (SEA'07), 19.-21.11.2007, Cambridge, MA, USA, 2007
2007[01]
Marcel Bennicke, Frank Steinbrückner, Mathias Radicke, Jan-Peter Richter
Das sd&m Software Cockpit: Architektur und Erfahrungen
In: Rainer Koschke, Otthein Herzog, Karl-Heinz Rödiger, Marc Ronthaler (Hrsg.): INFORMATIK 2007 - Informatik trifft Logistik. Band 2. Beiträge der 37. Jahrstagung der Gesellschaft für Informatik e.V. (GI) 24.-27. September 2007 in Bremen. GI-Edition - Lecture Notes in Informatics (LNI), P-110, Bonner Köllen Verlag (2007), ISBN 978-3-88579-204-8, ISSN 1617-5468, S. 254-260
HA 07-001 / 2007[02]
Marcel Bennicke, Jan-Peter Richter
Architecture of a Generic Software Control Centre
1. Workshop on Measurement- based Cockpits for Distributed Software and Systems Engineering Project SOFTPIT 2007. International Conference on Global Software Engineering, 27. - 30.08.2007, München
2007[03]
Alexandre Bergel, Claus Lewerentz, Liam O’Brien
Classboxes : Supporting Unanticipated Variation Points in the Source Code
In: Proceedings of the 2nd Workshop on Aspect-Oriented Product Line Engineering (AOPLE-2), Lancaster University, Computing Department, Technical Report, COMP-005-2007, October 4, 2007, Salzburg, Austria, pp. 8-13
2007[04]
Marcus Ciolkowski, Jens Heidrich, Jürgen Münch, Frank Simon, and Mathias Radicke
Evaluating: Software Project Control Centers in Industrial Environments
In: Proceedings of the 1st International Symposium on Empirical Software Engineering and Measurement (ESEM), September 20-21, 2007, Madrid, Spanien. ESEM 2007, Seiten 314-323
2007[05]
Andreas Noack
Energy Models for Graph Clustering
Journal of Graph Algorithms and Applications 11(2):453-480, February 2007
Journal of Graph Algorithms and Applications
2007[06]
Andreas Noack
Unified Quality Measures for Clusterings, Layouts, and Orderings of Graphs, and Their Application as Software Design Criteria
PhD Thesis, Brandenburgische Technische Universität Cottbus, Juli 2007.
2007[07] UBICO
Unified Quality Measures for Clusterings, Layouts, and Orderings of Graphs, and Their Application as Software Design Criteria
How good is a given graph clustering, graph layout, or graph ordering --specifically, how well does it group densely connected vertices and separate sparsely connected vertices? How good is a given software design -- specifically, how well does it minimize the interdependence of the subsystems? This work introduces and validates simple and uniform measures for these two properties. Together with existing optimization algorithms, the introduced measures enable the automatic computation e.g. of communities in social networks and of design flaws in software systems.
The first part derives, validates, and unifies quality measures for graph clusterings, graph layouts, and graph orderings, with the following results:
- Identical quality measures can be applied to clusterings, layouts, and orderings; this enables the computation of consistent clusterings, layouts, and orderings.
- Diverse existing and new measures can be unified into few general measures; this facilitates their comparison and validation.
- Many existing measures are biased towards certain clusterings, layouts, or orderings, even for graphs without particularly dense or sparse subgraphs, and thus do not (only) measure quality in the above sense.
- For example graphs, the minimization of new, unbiased (or weakly biased) measures reveals nonobvious groups, e.g. communities in social networks, subject areas in hypertexts, or closely interlocked countries in international trade.
The second part derives, validates, and unifies dependency-based indicators of software design quality. It applies two quality measures for graph clusterings as measures for the coupling of software subsystems -- specifically for the coupling indicated by common changes and for the coupling indicated by references -- and shows:
- The measures quantify the dependency-caused development costs, under well-defined simplifying assumptions.
- The minimization of the measures conforms to existing dependency-related design principles (like locality of change, acyclicity of references, and stability of references), design rules, and design patterns.
- For example software systems, the incremental minimization of the measures reveals nonobvious design flaws, like the distribution of coherent responsibilities over several subsystems, or references from low-level to high-level subsystems.
In summary, this work shows that
- simple measures can suffice to capture important aspects of graph clustering quality, graph layout quality, graph ordering quality, and software design quality, and
- the optimization of simple measures can suffice to detect nonobvious and often useful structure in various real-world systems.
Abstract english 2007[07]