@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} } @inproceedings{BeyerNoack, author = {Beyer, Dirk and Noack, Andreas}, title = {Can Decision Diagrams Overcome State Space Explosion in Real-Time Verification?}, series = {Formal techniques for networked and distributed systems - FORTE 2003, 23rd IFIP WG 6.1, international conference, Berlin, Germany, September 29 - October 2, 2003, proceedings}, booktitle = {Formal techniques for networked and distributed systems - FORTE 2003, 23rd IFIP WG 6.1, international conference, Berlin, Germany, September 29 - October 2, 2003, proceedings}, editor = {K{\"o}nig, Hartmut}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {3-540-20175-0}, pages = {193 -- 208}, 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 analytical and empirical complexity results for three communication protocols. The contributions of the analyses are: Firstly, they show that BDDs and CDDs of polynomial size exist for the reachability sets of the three protocols. This is the first evidence that CDDs can grow only polynomially for models with non-trivial state space explosion. Secondly, they show that CDD-based tools, which currently use at least exponential space for two of the protocols, will only find polynomial-size 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} } @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{BeyerNoack, author = {Beyer, Dirk and Noack, Andreas}, title = {Clustering Software Artifacts Based on Frequent Common Changes}, series = {Proceedings, 13th International Workshop on Program Comprehension, IWPC 2005, 15 - 16 May 2005, St. Louis, Missouri}, booktitle = {Proceedings, 13th International Workshop on Program Comprehension, IWPC 2005, 15 - 16 May 2005, St. Louis, Missouri}, publisher = {IEEE Computer Society}, address = {Los Alamitos, Calif. [u.a.]}, isbn = {0-7695-2254-8}, pages = {259 -- 268}, language = {en} } @inproceedings{BeyerNoack, author = {Beyer, Dirk and Noack, Andreas}, title = {BDD-basierte Verifikation von Realzeit-Systemen}, language = {de} } @article{BeyerNoackLewerentz, author = {Beyer, Dirk and Noack, Andreas and Lewerentz, Claus}, title = {Efficient Relational Calculation for Software Analysis}, language = {en} }