Sciweavers

514 search results - page 22 / 103
» Dependency Analysis of Ada Programs
Sort
View
135
Voted
JUCS
2007
80views more  JUCS 2007»
15 years 2 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa
142
Voted
ICMLA
2010
15 years 22 days ago
Boosting Multi-Task Weak Learners with Applications to Textual and Social Data
Abstract--Learning multiple related tasks from data simultaneously can improve predictive performance relative to learning these tasks independently. In this paper we propose a nov...
Jean Baptiste Faddoul, Boris Chidlovskii, Fabien T...
SCAM
2002
IEEE
15 years 7 months ago
Dynamic Slicing Object-Oriented Programs for Debugging
Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains...
Baowen Xu, Zhenqiang Chen, Hongji Yang
139
Voted
ICLP
1997
Springer
15 years 7 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
105
Voted
SIGSOFT
2005
ACM
16 years 3 months ago
Automatic generation of suggestions for program investigation
Before performing a modification task, a developer usually has to investigate the source code of a system to understand how to carry out the task. Discovering the code relevant to...
Martin P. Robillard