1702 search results - page 127 / 341 » Doomed program points |
153
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
In global computing applications the availability of a mechanism for some form of committed choice can be useful, and sometimes necessary. It can conveniently handle, e.g., distrib...
128
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
In this paper, we present an algorithm to propagate an n-ary constraint (with n greater than 2) specifying the relative positions of points in a three-dimensional rigid group. The ...
134
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
148
click to vote
RTCSA
2000
IEEE
15 years 9 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
144
click to vote
SAS
1999
Springer
15 years 9 months ago
1999
Springer
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...