Sciweavers

2372 search results - page 16 / 475
» Probabilistic calling context
Sort
View
JSC
2010
106views more  JSC 2010»
13 years 6 months ago
Verifying pointer safety for programs with unknown calls
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
Chenguang Luo, Florin Craciun, Shengchao Qin, Guan...
ISSRE
2006
IEEE
14 years 1 months ago
Call Stack Coverage for GUI Test-Suite Reduction
—Graphical user interfaces (GUIs) are used as front ends to most of today’s software applications. The event-driven nature of GUIs presents new challenges for testing. One impo...
Scott McMaster, Atif M. Memon
BPM
2006
Springer
128views Business» more  BPM 2006»
13 years 11 months ago
A Redesign Framework for Call Centers
An important shortcoming in the Business Process Redesign (BPR) literature is the lack of concrete guidance on how to improve an existing business process. Our earlier work has aim...
Monique H. Jansen-Vullers, Mariska Netjes, Hajo A....
OOPSLA
2000
Springer
13 years 11 months ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg
ICS
1999
Tsinghua U.
13 years 12 months ago
Improving virtual function call target prediction via dependence-based pre-computation
We introduce dependence-based pre-computation as a complement to history-based target prediction schemes. We present pre-computation in the context of virtual function calls (v-ca...
Amir Roth, Andreas Moshovos, Gurindar S. Sohi