1023 search results - page 113 / 205 » A Formal Method for Program Slicing |
102
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
115
click to vote
IFL
2005
Springer
15 years 7 months ago
2005
Springer
With-loops are versatile array comprehensions used in the functional array language SaC to implement universally applicable array operations. We describe the fusion of with-loops a...
112
click to vote
CAV
2004
Springer
15 years 7 months ago
2004
Springer
The counterexamples produced by model checkers are often lengthy and difficult to understand. In practical verification, showing the existence of a (potential) bug is not enough: ...
168
click to vote
TLDI
2010
ACM
15 years 10 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
100
click to vote
CAV
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...