184 search results - page 12 / 37 » Integer Polyhedra for Program Analysis |
ICLP
1997
Springer
13 years 12 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
ISSRE
2003
IEEE
14 years 1 months ago
2003
IEEE
Partition testing is a well-known software testing technique. This paper shows that partition testing strategies are relatively ineffective in detecting faults related to small sh...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
ESORICS
2004
Springer
14 years 1 months ago
2004
Springer
Parameters of a program’s runtime environment such as the machine architecture and operating system largely determine whether a vulnerability can be exploited. For example, the m...
ISPAN
2002
IEEE
14 years 19 days ago
2002
IEEE
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...