Sciweavers

10899 search results - page 501 / 2180
» The GP Programming System
Sort
View
MSR
2006
ACM
16 years 29 days ago
Using evolutionary annotations from change logs to enhance program comprehension
Evolutionary annotations are descriptions of how source code evolves over time. Typical source comments, given their static nature, are usually inadequate for describing how a pro...
Daniel M. Germán, Peter C. Rigby, Margaret-...
ICLP
2005
Springer
16 years 16 days ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
CC
2005
Springer
153views System Software» more  CC 2005»
16 years 14 days ago
Completeness Analysis for Incomplete Object-Oriented Programs
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
Jingling Xue, Phung Hua Nguyen
CC
2004
Springer
110views System Software» more  CC 2004»
16 years 13 days ago
Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs
In this paper, we show how previous work on escape analysis can be adapted and extended to yield a static analysis that is efficient yet effective for reducing the number of inter...
Venkatesh Prasad Ranganath, John Hatcliff
LOPSTR
2004
Springer
16 years 11 days ago
Determinacy Analysis for Logic Programs Using Mode and Type Information
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
Pedro López-García, Francisco Bueno,...