198 search results - page 28 / 40 » Reachability on prefix-recognizable graphs |
ISSTA
2012
ACM
12 years 9 days ago
2012
ACM
We introduce a static detector, Saber, for detecting memory leaks in C programs. Leveraging recent advances on sparse pointer analysis, Saber is the first to use a full-sparse va...
VLSID
2002
IEEE
14 years 10 months ago
2002
IEEE
| This paper reports the design of BIST structures for sequential machines. Testability of an FSM is limited due to the fact that some machine states remain unreachable and some ac...
SPIN
2009
Springer
14 years 4 months ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
ECBS
2008
IEEE
14 years 4 months ago
2008
IEEE
Network designers perform challenging tasks with so many configuration options that it is often hard or even impossible for a human to predict all potentially dangerous situation...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....