144 search results - page 11 / 29 » Automatic generation of polynomial loop |
FATES
2003
Springer
14 years 23 days ago
2003
Springer
Generating effective tests and inferring likely program specifications are both difficult and costly problems. We propose an approach in which we can mutually enhance the tests and...
KBSE
2008
IEEE
14 years 1 months ago
2008
IEEE
Many approaches to software verification are currently semi-automatic: a human must provide key logical insights — e.g., loop invariants, class invariants, and frame axioms tha...
IEEEPACT
1998
IEEE
13 years 11 months ago
1998
IEEE
We study in this paper the problem of polyhedron scanning which appears for example when generating code for transformed loop nests in automatic parallelization. After a review of...
FCCM
2000
IEEE
13 years 12 months ago
2000
IEEE
Mapping computations written in high-level programming languages to FPGA-based computing engines requires programmers to generate the datapath responsible for the core of the comp...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...