Nonlinear and Symbolic Data Dependence Testing
IEEE Transactions on Parallel and Distributed Systems
Cache-conscious structure layout
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Dynamically discovering likely program invariants to support program evolution
Proceedings of the 21st international conference on Software engineering
Simplifying Polynominal Constraints Over Integers to Make Dependence Analysis More Precise
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
Automatic Parallelization in the Polytope Model
The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
| Hi-index | 0.01 |
Mathematical packages for static analysis of programs have recently been developed. Although these packages are widely used, they have a number of limitations. In particular, they do not support multivariate polynomials with integer coefficients, which are often met in programs and used for the analysis of systems. Some methods to overcome this difficulty have already been suggested, but, unfortunately, they can be applied to only a subclass of such expressions. In this paper, we suggest a more general approach based on the Bernstein expansion, which facilitates the analysis of integer multivariate polynomials.