Sciweavers

215 search results - page 9 / 43
» State-Transition Computation Models and Program Correctness ...
Sort
View
98
Voted
EUROPAR
2009
Springer
15 years 6 months ago
An Extension of the StarSs Programming Model for Platforms with Multiple GPUs
While general-purpose homogeneous multi-core architectures are becoming ubiquitous, there are clear indications that, for a number of important applications, a better performance/p...
Eduard Ayguadé, Rosa M. Badia, Francisco D....
TAP
2010
Springer
134views Hardware» more  TAP 2010»
14 years 9 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney
94
Voted
FOCS
2010
IEEE
14 years 9 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
HPCA
2006
IEEE
16 years 18 hour ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
83
Voted
AADEBUG
1997
Springer
15 years 3 months ago
Bisection Debugging
This paper introduces the bisection debugging model. The key idea is to use a debugger to identify the semantic differences between two versions of the same program. The debugger ...
Thomas R. Gross