TY - CHAP A1 - Beyer, Dirk A1 - Lewerentz, Claus T1 - CrocoPat: Efficient Pattern Analysis in Object-Oriented Programs Y1 - 2003 ER - TY - CHAP A1 - Beyer, Dirk A1 - Noack, Andreas A1 - Lewerentz, Claus T1 - Simple and Efficient Relational Querying of Software Structures T2 - Proceedings, 10th Working Conference on Reverse Engineering, WCRE 2003, Victoria, B.C., Canada, 13 - 16 November 2003 N2 - Abstract. Many analyses of software systems can be formalized as relational queries, for example the detection of design patterns, of patterns of problematic design, of code clones, of dead code, and of differences between the as-built and the as-designed architecture. This paper describes the concepts of CrocoPat, a tool for querying and manipulating relations. CrocoPat is easy to use, because of its simple query and manipulation language based on predicate calculus, and its simple file format for relations. CrocoPat is efficient, because it internally represents relations as binary decision diagrams, a data structure that is well-known as a compact representation of large relations in computer-aided verification. CrocoPat is general, because it manipulates not only graphs (i.e. binary relations), but n-ary relations. Y1 - 2003 SN - 0-7695-2027-8 SP - 216 EP - 225 PB - IEEE Computer Society CY - Los Alamitos, Calif. [u.a.] ER - TY - CHAP A1 - Lewerentz, Claus A1 - Simon, Frank A1 - Steinbrückner, Frank T1 - CrocoCosmos Y1 - 2002 ER - TY - GEN A1 - Balzer, Michael A1 - Noack, Andreas A1 - Deussen, Oliver A1 - Lewerentz, Claus T1 - Software Landscapes: Visualizing the Structure of Large Software Systems T2 - VisSym 2004, Symposium on Visualization, Konstanz, Germany, May 19- 21, 2004 Y1 - 2004 SP - 261 EP - 266 PB - Eurographics Association CY - Aire-la-Ville ER - TY - JOUR A1 - Beyer, Dirk A1 - Noack, Andreas A1 - Lewerentz, Claus T1 - Efficient Relational Calculation for Software Analysis Y1 - 2005 ER - TY - GEN ED - Engels, Gregor ED - Lewerentz, Claus ED - Schäfer, Wilhelm ED - Schürr, Andy ED - Westfechtel, Bernhard T1 - Graph Transformations and Model-Driven Engineering KW - Software Engineering KW - Logics and Meanings KW - Programming Languages KW - Software/Program Verification KW - Computer-Communication Networks KW - Programming Techniques Y1 - 2010 SN - 978-3-642-17321-9 SN - 3-642-17321-7 PB - Springer CY - Berlin [u.a.] ER - TY - THES A1 - Noack, Andreas T1 - Unified quality measures for clusterings, layouts, and orderings of graphs, and their application as software design criteria KW - Softwareentwicklung KW - Graphische Darstellung KW - Computergraphik KW - Projektmanagement Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:co1-opus-4046 UR - http://opus.kobv.de/btu/volltexte/2007/404/ ER - TY - RPRT A1 - Noack, Andreas T1 - Energy Models for Drawing Clustered Small-World Graphs N2 - We introduce energy models for drawing clustered small-world graphs. Clustered means that there exist (probably unknown) sets of nodes with many edges between nodes of the same set and few edges to nodes outside the set. Small-world means that the graph-theoretic distances between nodes are small relative to the number of nodes. Previous force or energy models do not produce satisfactory results for such graphs. In drawings that have minimum energy with respect to our new energy models, different clusters are clearly separated and have interpretable distances.We formally characterize the minimum energy drawings of our new energy mod%ADels and of a class of energy models that contains among others the well-known Fruchterman-Reingold model. These characterizations show 1) in what sense the minimum energy drawings of these energy models fulfill requirements like small, uniform edge lengths, well-distributed nodes, or separated clusters, and 2) what properties of the drawn graph can be inferred from the drawings Y1 - 2003 PB - Inst. of Computer Science CY - Cottbus ER - TY - RPRT A1 - Beyer, Dirk A1 - Noack, Andreas T1 - A Comparative Study of Decision Diagrams for Real-Time Verification N2 - In this paper we analyze the efficiency of binary decision diagrams (BDDs) and clock difference diagrams (CDDs) in the verification of timed automata. Therefore we present empirical and analytical complexity results for three communication protocols. The contributions of the analyses are: Firstly, they explain the empirical results. Secondly, they show that BDDs and CDDs of polynomial size exist for the reachability sets of the three protocols. Thirdly, they show that CDD-based tools, which currently use at least exponential space for two of the protocols, will only find polynomial-sized CDDs if they use better variable orders, as the BDD-based tool Rabbit does. Finally, they give insight into the dependency of the BDD and CDD size on properties of the model, in particular the number of automata and the magnitude of the clock values. Y1 - 2003 PB - BTU, Institut für Informatik CY - Cottbus ER - TY - RPRT A1 - Noack, Andreas T1 - Visual Clustering of Graphs with Nonuniform Degrees Y1 - 2004 PB - Inst. of Computer Science CY - Cottbus ER -