Sciweavers

1702 search results - page 75 / 341
» Doomed program points
Sort
View
SIGSOFT
2004
ACM
16 years 5 months ago
PSE: explaining program failures via postmortem static analysis
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
Roman Manevich, Manu Sridharan, Stephen Adams, Man...
ICFP
2003
ACM
16 years 4 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
IJCAI
2007
15 years 6 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
AMOST
2005
ACM
15 years 10 months ago
Using information about functions in selecting test cases
We consider the problem of generating a set of test cases from a black box specification. We focus on stress testing, i.e. picking test cases that seem most likely to reveal prog...
Markus Clermont, David Lorge Parnas
SCAM
2003
IEEE
15 years 10 months ago
Improving the Static Analysis of Loops by Dynamic Partitioning Techniques
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...
Matthieu Martel