2040 search results - page 126 / 408 » On the Complexity of Error Explanation |
VLSID
2002
IEEE
14 years 9 months ago
2002
IEEE
Directed test program-based verification or formal verification methods are usually quite ineffective on large cachecoherent, non-uniform memory access (CC-NUMA) multiprocessors b...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
SOSP
2003
ACM
14 years 6 months ago
2003
ACM
This paper describes RacerX, a static tool that uses flowsensitive, interprocedural analysis to detect both race conditions and deadlocks. It is explicitly designed to find erro...
DATE
2009
IEEE
14 years 4 months ago
2009
IEEE
—In embedded computing we face a continuously growing algorithm complexity combined with a constantly rising number of applications running on a single system. Multi-core systems...
ETS
2007
IEEE
14 years 3 months ago
2007
IEEE
— The growth in System-on-Chip complexity puts pressure on system verification. Due to limitations in the pre-silicon verification process, errors in hardware and software slip...