1452 search results - page 146 / 291 » Algorithmic Analysis of Array-Accessing Programs |
121
Voted
ICCL
1998
IEEE
15 years 4 months ago
1998
IEEE
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...
95
Voted
EMSOFT
2006
Springer
15 years 4 months ago
2006
Springer
A key problem for effective unit testing is the difficulty of partitioning large software systems into appropriate units that can be tested in isolation. We present an approach th...
138
Voted
CORR
2010
Springer
15 years 21 days ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
96
Voted
TOPLAS
2008
15 years 15 days 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 &...
208
Voted
POPL
2005
ACM
16 years 27 days ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...