163 search results - page 21 / 33 » Improving the Context-sensitive Dependency Graph |
ICCD
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— This paper presents techniques that enhance automatically generated hardware assertion checkers to facilitate debugging within the assertion-based verification paradig...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
ICS
1995
Tsinghua U.
13 years 11 months ago
1995
Tsinghua U.
In this paper, we present a GSA-based technique that performs more e cient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The e ciency...
IJCAI
2007
13 years 9 months ago
2007
Some Statistical Software Testing approaches rely on sampling the feasible paths in the control flow graph of the program; the difficulty comes from the tiny ratio of feasible p...
ICAT
2003
IEEE
14 years 23 days ago
2003
IEEE
Any VR scenario should offer a certain degree of nonlinearity or openness regarding the story progress as a consequence of the interaction with the user. In this paper we propose ...