Sciweavers

1144 search results - page 156 / 229
» Logic programming for combinatorial problems
Sort
View
SIGSOFT
2002
ACM
16 years 3 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
ICFP
2007
ACM
16 years 2 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
139
Voted
SIGOPSE
1998
ACM
15 years 6 months ago
Goal-oriented programming, or composition using events, or threads considered harmful
with this, the thread abstraction was introduced. While threads are handling events, or awaiting specific events, unrelated events can be handled by other threads. Unfortunately, ...
Robbert van Renesse
CADE
2009
Springer
16 years 3 months ago
Integrated Reasoning and Proof Choice Point Selection in the Jahob System - Mechanisms for Program Survival
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
Martin C. Rinard
115
Voted
PLDI
2010
ACM
15 years 7 months ago
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Matthew Might, Yannis Smaragdakis, David Van Horn