390 search results - page 41 / 78 » Using Graph Transformations and Graph Abstractions for Softw... |
FSTTCS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
TOPLAS
2008
13 years 8 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
CAV
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
HYBRID
1998
Springer
14 years 26 days ago
1998
Springer
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
HIPEAC
2009
Springer
14 years 15 days ago
2009
Springer
Abstract. Exposing more instruction-level parallelism in out-of-order superscalar processors requires increasing the number of dynamic in-flight instructions. However, large instru...