loading...
Simple and Efficient Relational Querying of Software Structures
Victoria, B.C., Canada November 13-November 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WCRE.2003.128725210th Working Conference on Reverse En ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dirk Beyer, Brandenburg Technical University at Cottbus, Germany
Andreas Noack, Brandenburg Technical University at Cottbus, Germany
Claus Lewerentz, Brandenburg Technical University at Cottbus, Germany
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.
Citation:
Dirk Beyer, Andreas Noack, Claus Lewerentz, "Simple and Efficient Relational Querying of Software Structures," wcre, pp.216, 10th Working Conference on Reverse Engineering (WCRE 2003), 2003
Usage of this product signifies your acceptance of the Terms of Use.