Citation Context

...Snelting96reengineering [52] 1.6 Snelting98concept [53] 1.6 0 106 1.5 Snelting98reengineering [55] 0 Snelting99reengineering [56] 0 9 Snelting00software [54] 1.6 0 0 106 9 1.5 Snelting00understanding =-=[57]-=- 0 12 Streckenbach99understanding [59] 0 12 Tilley03software [63] 0 Tilley03towards [62] 0 Tonella99object [65] 21 Tonella99object [64] 249 vanDeursen98identifying [66] 100 Table 1. A Formal Context s...

Citation Context

...au Fakultät für Informatik, Innstr. 33, 94032 Passau, Germany strecken@infosun.fmi.uni-passau.de Abstract KABA is a system for refactoring Java class hierarchies. KABA uses the Snelting/Tip algorith=-=m [10]-=- in order to determine a behaviour-preserving refactoring which is optimal with respect to a given set of client programs. KABA then allows interactive manipulation of the refactored hierarchy, while ...

Citation Context

...4(a), it is easy to see that Stack≤[s2]≤[s5]≤Stack and hence that the types of s2 and s5 have to remain Refactoring Using Type Constraints 5 [1] class Client { [2] public static void main(String[] args){ [3] Stack s1 = new Stack(); [4] s1.push(new Integer(1)); [5] Stack s2 = new Stack(); [6] s2.push(new Float(2.2)); [7] s2.push(new Float(3.3)); [8] s1.moveFrom(s2); [9] s2.moveTo(s1); [10] Stack.print(s2); [11] Vector v1 = new Vector(); /* A1 */ [12] while (!s1.isEmpty()){ [13] Number n = (Number)s1.pop(); [14] v1.add(n); [15] } [16] JFrame frame = new JFrame(); [17] frame.setTitle("Example"); [18] frame.setSize(300, 100); [19] JTree tree = new JTree(v1); [20] frame.add(tree, BorderLayout.CENTER); [21] frame.setVisible(true); [22] } [23] } [24] class Stack { [25] private Vector v2; [26] public Stack(){ [27] v2 = new Vector(); /* A2 */ [28] } [29] public void push(Object o){ [30] v2.addElement(o); [31] } [32] public Object pop(){ [33] return v2.remove(v2.size()-1); [34] } [35] public void moveFrom(Stack s3){ [36] this.push(s3.pop()); [37] } [38] public void moveTo(Stack s4){ [39] s4.push(this.pop()); [40] } [41] public boolean isEmpty(){ [42] return v2.isEmpty(); [43] } [44] public stati...

Citation Context

...iterion that implies E(H1,K,I,σ0) =E(H1⊕H2,K,I,σ0) that is based on static analysis information. This approach is also used in our earlier work on semantics-preserving class hierarchy transformations =-=[17, 18]-=-. Being a sufficient, but not a necessary condition, our criterion may occasionally generate false alarms. However, we believe that the impact analysis of Section 4 will provide the user with sufficie...

Citation Context

...l for OO programming prevent the approach from being eective in Java. Let ussnally consider the eect of the two dierent methods on a specic client analysis, namely the KABA system as described in [21,=-= 20]-=-. KABA starts out with a table containing all method accesses for every program variable, and in order to compute the table, points-to information is needed for every program variable. The better the ...

Citation Context

...omponents. However, the number of reusable components in a repository is potentially huge and developing such a system would be complex. A RECOMMENDER AGENT FOR AGILE REUSE 273 Concept Analysis (CA) (=-=Snelting and Tip, 2000-=-) is one possible solution to developing such a large scale recommender system. The CA could be used to categorise users; for example there may be a category for database component users and another f...

Citation Context

...the same set of “attributes” (here, test suites). Concept analysis has been used in other software engineering projects for program refactoring such as that of Siff and Reps [36] and Tip and Snelting =-=[38]-=-. Most changes should carry enough information in the matrix of 0’s and 1’s to construct concept lattices. We show in Figure 3 the concept lattice that ensues from adding deep object comparison to Pyt...

Citation Context

...ity of these tools is limited to obfuscation of variable and class names and, in some cases, obfuscation of control flow. The closest work to ours is Snelting and Tip’s class hierarchy re-engineering =-=[17]-=-. They use concept analysis [12] to classify the usage of visible methods and fields of a class into usage profiles. Given this classification, a user of a tool based on this analysis can decide to re...

Citation Context

...from whose context it was derived.s1407 Tip & Snelting have presented an algorithm based on formal concept analysis that computes for a given program a new type hierarchy containing all minimal types =-=[13]-=-. Its effect appears to besroughly the same as that of global type inference in the spirit ofs[12]. Streckenbach & Snelting have only recently applied this algorithm to the refactoring of JAVA program...

Citation Context

...y within the software process whereas large efforts are currently spent in developing automated tools to assist it. Formal Concept Analysis (FCA) has already been successfully applied to the analysis =-=[1]-=- and restructuring [2–7] of conceptual class models: it helps reach optimal hierarchical organization of the initial classes by discovering relevant new abstractions. However, providing far-reaching a...