4719 search results - page 253 / 944 » Newtonian program analysis |
156
click to vote
APLAS
2000
ACM
15 years 10 months ago
2000
ACM
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
136
click to vote
SIGSOFT
2005
ACM
16 years 6 months ago
2005
ACM
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...
172
click to vote
PLDI
2009
ACM
16 years 19 days ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
160
click to vote
POPL
1994
ACM
15 years 10 months ago
1994
ACM
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
160
click to vote
CORR
2010
Springer
15 years 24 days ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...