360 search results - page 43 / 72 » A Method for the Verification of Haptic Algorithms |
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
DAC
2005
ACM
15 years 11 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
SAS
2009
Springer
15 years 10 months ago
2009
Springer
ion Refinement for Quantified Array Assertions Mohamed Nassim Seghir1, , Andreas Podelski1 , and Thomas Wies1,2 1 University of Freiburg, Germany 2 EPFL, Switzerland Abstract. We p...
AISC
2006
Springer
15 years 1 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
101
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Adaptive Random Testing subsumes a class of algorithms that detect the first failure with less test cases than Random Testing. The present paper shows that a "reference metho...