1291 search results - page 122 / 259 » Arithmetic program paths |
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
PPOPP
2003
ACM
14 years 3 months ago
2003
ACM
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
DAGSTUHL
1996
13 years 11 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
ICSE
2008
IEEE-ACM
14 years 10 months ago
2008
IEEE-ACM
We present a novel technique that speeds up state-space exploration (SSE) for evolving programs with dynamically allocated data. SSE is the essence of explicit-state model checkin...