Programming style based program partition

Traditional program partitioning methods are nonlinear, and their computational efforts increase exponentially with the size of the source program. The NP-hard complexity constitutes a computational barrier for partitioning legacy software systems properly and effciently. We propose a new method that can partition a source program into program modules within a timescale that is linear with the size of the program. Our method uses special heuristic knowledge, based on psychological analysis on human programming styles, to partition a source program into domain-oriented program modules. The paper has been showcased as one of the five top access articles in IJSEKE