773 search results - page 77 / 155 » Program Slicing by Calculation |
107
click to vote
HPCA
1995
IEEE
15 years 4 months ago
1995
IEEE
Information on the behavior of programs is essential for deciding the number and nature of functional units in high performance architectures. In this paper, we present studies on...
114
Voted
CANDC
2005
ACM
15 years 13 days ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
ICFEM
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...
107
Voted
JSC
2010
14 years 11 months ago
2010
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
106
Voted
AMAST
2008
Springer
15 years 2 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...