Sciweavers

207 search results - page 4 / 42
» Using Clustering Technique to Restructure Programs
Sort
View
OOPSLA
2004
Springer
14 years 3 months ago
Deriving refactorings for aspectJ
In this paper we present aspect-oriented programming laws that are useful for deriving refactorings for AspectJ. The laws help developers to verify if the transformations they deļ...
Leonardo Cole, Paulo Borba
KBSE
2007
IEEE
14 years 4 months ago
Using information retrieval to support design of incremental change of software
The proposed research defines an approach to combine Information Retrieval based analysis of the textual information embedded in software artifacts with program static and dynamic...
Denys Poshyvanyk, Andrian Marcus
SCP
2008
115views more  SCP 2008»
13 years 9 months ago
Goto elimination in program algebra
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...
Thuy Duong Vu
GLVLSI
2006
IEEE
124views VLSI» more  GLVLSI 2006»
14 years 3 months ago
Dominator-based partitioning for delay optimization
Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techn...
David Bañeres, Jordi Cortadella, Michael Ki...
SIGADA
2004
Springer
14 years 3 months ago
A refactoring tool for Ada 95
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
Paul Anderson