Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In Proceedings of the International Conference on Software Maintenance, pages 736--743. IEEE Computer Society Press, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Towards a Taxonomy of Software Evolution - Tom Mens Jim (2003) (5 citations) (Correct)
....its weaknesses . To overcome these current limitations, the tool could be complemented with a variety of other tools: To overcome its reactiveness and semi automated nature, the Refactoring Browser could be complemented with a tool that detects where and when refactorings should be applied [21]. Its strengths are well known so we will not discuss those here. 11 . To improve its change propagation support, the Refactoring Browser could be complemented with a tool that ensures that source code refactorings are propagated to the design documents so that these can be kept consistent. ....
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In Proc. Int'l Conf. Software Maintenance, pages 736--743. IEEE Computer Society Press, 2001.
Identifying Refactoring Opportunities Using Logic Meta.. - Tourwé, Mens (2003) (2 citations) (Correct)
....a result be less readable. Furthermore, the Code Critic tool does not propose refactorings that can be applied to remedy the bad smells. More recently, some techniques are being developed with the specific goal of identifying refactoring opportunities and proposing the corresponding refactorings [15], 7] 24] 13] 15] reports on a tool that is able to derive program invariants from the source code automatically, and that uses these invariants to identify when a refactoring could be necessary. For example, one invariant may be that a certain parameter of a method is always constant, or ....
....Furthermore, the Code Critic tool does not propose refactorings that can be applied to remedy the bad smells. More recently, some techniques are being developed with the specific goal of identifying refactoring opportunities and proposing the corresponding refactorings [15] 7] 24] 13] [15] reports on a tool that is able to derive program invariants from the source code automatically, and that uses these invariants to identify when a refactoring could be necessary. For example, one invariant may be that a certain parameter of a method is always constant, or is a function of the ....
[Article contains additional citation context not shown here]
Yoshio Kataoka, Michael D. Ernst, William G. Griswold, and David Notkin. Automated Support for Program Refactoring using Invariants. In Proc. Int. Conf. on Software Maintenance, pages 736--743, 2001.
Using Declarative Metaprogramming To Detect Possible.. - Tourwe, Brichau, Mens (2002) (Correct)
.... good object oriented design principles [1, 10] At the same time, much research has been devoted to identifying refactorings, e.g. high level transformations, that can help in transforming an inflexible, lowquality design into a more flexible one [4, 9] Although some primitive tools exist [5], recognizing when a design guideline is violated, and when refactorings may thus be necessary, remains a manual process, as is identifying which refactorings in particular could be used to remedy the situation. In this paper, we advocate the use of declarative metaprogramming (DMP) 3, 11] to ....
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In Proc. Int'l Conf. Software Maintenance, pages 736--743. IEEE Computer Society Press, 2001.
Discovering Algebraic Specifications from Java Classes - Henkel, Diwan (2003) (5 citations) (Correct)
....specifications [27, 20] Daikon is useful for understanding how something is implemented, but also exposes the full complexity of a given implementation. Daikon has been improved in many ways [16, 17, 13] and has been used for various applications including program evolution [15] refactoring [32], test suite quality evaluation [24] bug detection [23] and as a generator of specifications that are then checked statically [36] Whaley et al. 44] describe how to discover specifications that are finite state machines describing in which order method calls can be made to a given object. ....
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In International Conference on Software Maintenance, Florence, Italy, 2001.
Automatic Generation and Checking of Program Specifications - Nimmer (2001) (2 citations) (Correct)
....can be corrected to be verifiable with the help of a static checker, guaranteeing the absence of certain errors and adding confidence to future maintenance tasks. In addition to the results contained in this work, generated specifications have been shown to be useful for program refactoring [KEGN01] theorem proving [NWE02] test suite generation [Har02] and anomaly and bug detection [ECGN01, Dod02] In many of these tasks, the accuracy of the generated specification (the degree to which it matches the code) affects the effort involved in performing the task. One of the contributions of ....
....some of the code across the function boundary into the caller. Static analysis may be able to effect these optimizations when the parameters are literal constants, but exploiting dynamic information may give the programmer a deeper insight than is possible with a static analysis (such as with [KEGN01] Granularity We can change the character of the analysis by varying the level of abstraction, or granularity, with which we distinguish different callers during inference. At the finest level, every 30 call site is considered a distinct caller; at an intermediate level, all calls made from ....
[Article contains additional citation context not shown here]
Yoshio Kataoka, Michael D. Ernst, William G. Griswold, and David Notkin. Automated support for program refactoring using invariants. In ICSM, pages 736-- 743, November 2001.
An overview of JML tools and applications - Burdy, Cheon, Cok, Ernst.. (2004) (16 citations) Self-citation (Ernst) (Correct)
No context found.
Kataoka Y, Ernst MD, Griswold WG, Notkin D (2001) Automated support for program refactoring using invariants. In: Proceedings of the international conference on software maintenance (ICSM 2001), Florence, Italy, 6--10 November 2001, pp 736--743
Automatic Generation of Program Specifications - Nimmer, Ernst (2002) (4 citations) Self-citation (Ernst) (Correct)
No context found.
Yoshio Kataoka, Michael D. Ernst, William G. Griswold, and David Notkin. Automated support for program refactoring using invariants. In ICSM, pages 736--743, November 2001.
Efficient Incremental Algorithms for Dynamic Detection of.. - Perkins, Ernst (2004) (2 citations) Self-citation (Ernst) (Correct)
No context found.
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In ICSM, pages 736--743, Nov. 2001.
Finding Latent Code Errors via Machine Learning over Program.. - Brun, Ernst (2004) (4 citations) Self-citation (Ernst) (Correct)
No context found.
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In ICSM, pages 736--743, Nov. 2001.
An Overview of JML Tools and Applications - Burdy, Cheon, Cok, Ernst.. (2003) (16 citations) Self-citation (Ernst) (Correct)
No context found.
Yoshio Kataoka, Michael D. Ernst, William G. Griswold, and David Notkin. Automated support for program refactoring using invariants. In ICSM 2001, Proceedings of the International Conference on Software Maintenance, pages 736--743, Florence, Italy, November 6--10, 2001.
Predicting Problems Caused by Component Upgrades - McCamant, Ernst (2003) (9 citations) Self-citation (Ernst) (Correct)
No context found.
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In ICSM 2001.
Automatic Generation of Program Specifications - Nimmer, Ernst (2002) (4 citations) Self-citation (Ernst) (Correct)
No context found.
Yoshio Kataoka, Michael D. Ernst, William G. Griswold, and David Notkin. Automated support for program refactoring using invariants. In ICSM, pages 736--743, November 2001.
Exploiting Synergy Between Testing and Inferred Partial.. - Xie, Notkin (2003) (1 citation) Self-citation (Notkin) (Correct)
.... and that the specifications are often absent from a program, dynamically inferring program specifications from its executions is a useful technique [3] The output of the dynamic specification inference has been used to aid program evolution in general [3] and program refactoring in particular [7]. Most of the applications can achieve better results if the inferred specifications are closer to the oracle specifications. Like other dynamic analysis techniques, the dynamic specification inference is also constrained by the quality of the test suite for the program. Usually it is unlikely ....
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In Proceedings of ICSM 2001.
A Discussion of Refactoring in Research and Practice - Bart Du Bois (2004) (Correct)
No context found.
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In Proceedings of the International Conference on Software Maintenance, pages 736--743. IEEE Computer Society Press, 2001.
Refactoring: Current Research and Future Trends - Mens, Demeyer, Bois.. (2003) (1 citation) (Correct)
No context found.
Kataoka, Y., M. D. Ernst, W. G. Griswold and D. Notkin, Automated support for program refactoring using invariants, in: Proceedings of the International Conference on Software Maintenance (2001), pp. 736--743.
Isolating Idiomatic Crosscutting Concerns - Bruntink, van Deursen, Tourwe (Correct)
No context found.
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated Support for Program Refactoring using Invariants. In Proceedings of the International Conference on Software Maintenance (ICSM), pages 736--743. IEEE Computer Society, 2001.
Towards a Taxonomy of Software Evolution - Mens, Buckley, Zenger, Rashid (2002) (5 citations) (Correct)
No context found.
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In Proc. Int'l Conf. Software Maintenance, pages 736--743. IEEE Computer Society Press, 2001.
Refactoring Class Hierarchies with KABA - Streckenbach, Snelting (2004) (2 citations) (Correct)
No context found.
Y. Kataoka, M. Ernst, W. Griswold, and D. Notkin. Automated support for program refactoring using invariants. In Proc. International Conference of Software Maintenance (ICSM'01), 2001.
An Initial Experiment in Reverse Engineering.. - Bruntink, van.. (2004) (1 citation) (Correct)
No context found.
Yoshio Kataoka, Michael D. Ernst, William G. Griswold, and David Notkin. Automated Support for Program Refactoring using Invariants. In Proceedings of the International Conference on Software Maintenance (ICSM), pages 736--743. IEEE Computer Society, 2001.
Conceptual Code Mining - Mining for Source-Code.. - Mens, Tourwé (2004) (Correct)
No context found.
Y. Kataoka, M. D. Ernst, W. G. Griswold, and D. Notkin. Automated Support for Program Refactoring using Invariants. In Proc. Int. Conf. on Software Maintenance, pages 736--743, 2001.
A Logic Meta-Programming Framework for Supporting the Refactoring.. - Bravo (2003) (Correct)
No context found.
Yoshio Kataoka, Michael D. Ernst, William G. Griswold, and David Notkin. Automated support for program refactoring using invariants. In Proceedings of the International Conference on Software Maintenance ICSM 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC