Sciweavers

12519 search results - page 2249 / 2504
» Approximation Problems Categories
Sort
View
SIGSOFT
2004
ACM
16 years 7 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...
SIGSOFT
2004
ACM
16 years 7 months ago
Heuristic-guided counterexample search in FLAVERS
One of the benefits of finite-state verification (FSV) tools, such as model checkers, is that a counterexample is provided when the property cannot be verified. Not all counterexa...
Jianbin Tan, George S. Avrunin, Lori A. Clarke, Sh...
SIGSOFT
2003
ACM
16 years 7 months ago
Regression testing of GUIs
Although graphical user interfaces (GUIs) constitute a large part of the software being developed today and are typically created using rapid prototyping, there are no effective r...
Atif M. Memon, Mary Lou Soffa
SIGSOFT
2002
ACM
16 years 7 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...
SIGSOFT
2001
ACM
16 years 7 months ago
WREN---an environment for component-based development
Prior research in software environments focused on three important problems-- tool integration, artifact management, and process guidance. The context for that research, and hence...
Chris Lüer, David S. Rosenblum
« Prev « First page 2249 / 2504 Last » Next »