Sciweavers

1246 search results - page 105 / 250
» Online testing with model programs
Sort
View
106
Voted
ESA
2001
Springer
75views Algorithms» more  ESA 2001»
15 years 5 months ago
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
Alexander Gaysinsky, Alon Itai, Hadas Shachnai
PPOPP
2009
ACM
16 years 1 months ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
149
Voted
SOQUA
2007
15 years 2 months ago
Faults' context matters
When choosing a testing technique, practitioners want to know which one will detect the faults that matter most to them in the programs that they plan to test. Do empirical evalua...
Jaymie Strecker, Atif M. Memon
92
Voted
CHI
2007
ACM
16 years 1 months ago
Dynamic detection of novice vs. skilled use without a task model
If applications were able to detect a user's expertise, then software could automatically adapt to better match expertise. Detecting expertise is difficult because a user...
Amy Hurst, Scott E. Hudson, Jennifer Mankoff
OOPSLA
2010
Springer
14 years 10 months ago
Efficient modular glass box software model checking
Glass box software model checking incorporates novel techniques to identify similarities in the state space of a model checker and safely prune large numbers of redundant states w...
Michael Roberson, Chandrasekhar Boyapati