Sciweavers

12 search results - page 3 / 3
» Finding Loop Invariants for Programs over Arrays Using a The...
Sort
View
PLDI
2010
ACM
14 years 2 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
SIGSOFT
2010
ACM
13 years 2 months ago
Scalable SMT-based verification of GPU kernel functions
Interest in Graphical Processing Units (GPUs) is skyrocketing due to their potential to yield spectacular performance on many important computing applications. Unfortunately, writ...
Guodong Li, Ganesh Gopalakrishnan