184 search results - page 7 / 37 » Integer Polyhedra for Program Analysis |
SAS
2007
Springer
14 years 1 months ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
IOR
2006
13 years 7 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Techniques for test-case prioritization re-order test cases to increase their rate of fault detection. When there is a fixed time budget that does not allow the execution of all ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
ASIAN
2006
Springer
13 years 11 months ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...