@inproceedings{BeyerLewerentz, author = {Beyer, Dirk and Lewerentz, Claus}, title = {CrocoPat: Efficient Pattern Analysis in Object-Oriented Programs}, language = {en} } @inproceedings{BeyerNoackLewerentz, author = {Beyer, Dirk and Noack, Andreas and Lewerentz, Claus}, title = {Simple and Efficient Relational Querying of Software Structures}, series = {Proceedings, 10th Working Conference on Reverse Engineering, WCRE 2003, Victoria, B.C., Canada, 13 - 16 November 2003}, booktitle = {Proceedings, 10th Working Conference on Reverse Engineering, WCRE 2003, Victoria, B.C., Canada, 13 - 16 November 2003}, publisher = {IEEE Computer Society}, address = {Los Alamitos, Calif. [u.a.]}, isbn = {0-7695-2027-8}, pages = {216 -- 225}, abstract = {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.}, language = {en} } @inproceedings{LewerentzSimonSteinbrueckner, author = {Lewerentz, Claus and Simon, Frank and Steinbr{\"u}ckner, Frank}, title = {CrocoCosmos}, language = {en} } @misc{BalzerNoackDeussenetal., author = {Balzer, Michael and Noack, Andreas and Deussen, Oliver and Lewerentz, Claus}, title = {Software Landscapes: Visualizing the Structure of Large Software Systems}, series = {VisSym 2004, Symposium on Visualization, Konstanz, Germany, May 19- 21, 2004}, journal = {VisSym 2004, Symposium on Visualization, Konstanz, Germany, May 19- 21, 2004}, publisher = {Eurographics Association}, address = {Aire-la-Ville}, pages = {261 -- 266}, language = {en} } @article{BeyerNoackLewerentz, author = {Beyer, Dirk and Noack, Andreas and Lewerentz, Claus}, title = {Efficient Relational Calculation for Software Analysis}, language = {en} } @misc{OPUS4-4929, title = {Graph Transformations and Model-Driven Engineering}, editor = {Engels, Gregor and Lewerentz, Claus and Sch{\"a}fer, Wilhelm and Sch{\"u}rr, Andy and Westfechtel, Bernhard}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {978-3-642-17321-9}, pages = {XI, 768}, language = {en} } @phdthesis{Noack, author = {Noack, Andreas}, title = {Unified quality measures for clusterings, layouts, and orderings of graphs, and their application as software design criteria}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus-4046}, language = {en} } @techreport{Noack, author = {Noack, Andreas}, title = {Energy Models for Drawing Clustered Small-World Graphs}, publisher = {Inst. of Computer Science}, address = {Cottbus}, pages = {33}, abstract = {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}, language = {en} } @techreport{BeyerNoack, author = {Beyer, Dirk and Noack, Andreas}, title = {A Comparative Study of Decision Diagrams for Real-Time Verification}, publisher = {BTU, Institut f{\"u}r Informatik}, address = {Cottbus}, pages = {13}, abstract = {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.}, language = {en} } @techreport{Noack, author = {Noack, Andreas}, title = {Visual Clustering of Graphs with Nonuniform Degrees}, publisher = {Inst. of Computer Science}, address = {Cottbus}, pages = {16 Bl.}, language = {en} }