Sciweavers

84 search results - page 9 / 17
» ALMOST: Exploring Program Traces
Sort
View
SIGSOFT
2004
ACM
14 years 10 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...
SOFTVIS
2003
ACM
14 years 3 months ago
Visualization of Program-Execution Data for Deployed Software
Software products are often released with missing functionality, errors, or incompatibilities that may result in failures in the field, inferior performances, or, more generally,...
Alessandro Orso, James A. Jones, Mary Jean Harrold
ASPLOS
1991
ACM
14 years 1 months ago
NUMA Policies and Their Relation to Memory Architecture
Multiprocessor memory reference traces provide a wealth of information on the behavior of parallel programs. We have used this information to explore the relationship between kern...
William J. Bolosky, Michael L. Scott, Robert P. Fi...
POPL
2010
ACM
13 years 10 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
CAV
2010
Springer
201views Hardware» more  CAV 2010»
14 years 1 months ago
Contessa: Concurrency Testing Augmented with Symbolic Analysis
Testing of multi-threaded programs poses enormous challenges. To improve the coverage of testing, we present a framework named CONTESSA that augments conventional testing (concrete...
Sudipta Kundu, Malay K. Ganai, Chao Wang