Title
Simple and Efficient Relational Querying of Software Structures
Abstract
Many analyses of software systems can be formalized asrelational queries, for example the detection of design patterns,of patterns of problematic design, of code clones, ofdead code, and of differences between the as-built and theas-designed architecture. This paper describes the conceptsof CrocoPat, a tool for querying and manipulating relations.CrocoPat is easy to use, because of its simple query andmanipulation language based on predicate calculus, and itssimple file format for relations. CrocoPat is efficient, becauseit internally represents relations as binary decisiondiagrams, a data structure that is well-known as a compactrepresentation of large relations in computer-aided verification.CrocoPat is general, because it manipulates not onlygraphs (i.e. binary relations), but n-ary relations.
Year
DOI
Venue
2003
10.1109/WCRE.2003.1287252
WCRE
Keywords
Field
DocType
efficient relational querying,design pattern,itssimple file format,problematic design,binary decisiondiagrams,code clone,formalized asrelational query,computer-aided verification,ofdead code,conceptsof crocopat,data structure,software structures,software systems,binary decision diagram,binary relation,computer architecture,pattern analysis,calculus,reverse engineering,data structures,boolean functions,cloning
File format,Data structure,Programming language,Binary relation,Computer science,Reverse engineering,Software design pattern,Theoretical computer science,Software system,Software,Relational algebra
Conference
ISSN
ISBN
Citations 
1095-1350
0-7695-2027-8
26
PageRank 
References 
Authors
2.37
31
3
Name
Order
Citations
PageRank
Dirk Beyer11736100.85
Andreas Noack234724.73
Claus Lewerentz366564.65