Result 1 to 20 from 26 total
Transitive closures of affine integer tuple relations and their overapproximations. (English)
Yahav, Eran (ed.), Static analysis. 18th international symposium, SAS 2011, Venice, Italy, September 14-16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23701-0/pbk). Lecture Notes in Computer Science 6887, 216-232 (2011).
1
Transitive closures of affine integer tuple relations and their overapproximations (English)
SAS, 216-232 (2011).
2
isl: An integer set library for the polyhedral model. (English)
Fukuda, Komei (ed.) et al., Mathematical software ‒ ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13‒17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15581-9/pbk). Lecture Notes in Computer Science 6327, 299-302 (2010).
3
Experience with widening based equivalence checking in realistic multimedia systems (English)
J. Electronic Testing 26, No. 2, 279-292 (2010).
4
{\it isl}: an integer set library for the polyhedral model (English)
ICMS, 299-302 (2010).
5
Equivalence checking of static affine programs using widening to handle recurrences. (English)
Bouajjani, Ahmed (ed.) et al., Computer aided verification. 21st international conference, CAV 2009, Grenoble, France, June 26‒July 2, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02657-7/pbk). Lecture Notes in Computer Science 5643, 599-613 (2009).
6
Experience with widening based equivalence checking in realistic multimedia systems (English)
HLDVT, 122-129 (2009).
7
Equivalence checking of static affine programs using widening to handle recurrences (English)
CAV, 599-613 (2009).
8
Computing parametric rational generating functions with a primal Barvinok algorithm. (English)
Electron. J. Comb. 15, No. 1, Research Paper R16, 19 p. (2008).
9
Guidance of loop ordering for reduced memory usage in signal processing applications. (English)
J. VLSI Signal Process. 53, No. 3, 301-321 (2008).
10
Counting with rational generating functions. (English)
J. Symb. Comput. 43, No. 2, 75-91 (2008).
11
Guidance of loop ordering for reduced memory usage in signal processing applications (English)
Signal Processing Systems 53, No. 3, 301-321 (2008).
12
Algorithms for weighted counting over parametric polytopes: A survey and a practical comparison (English)
ITSL, 60-66 (2008).
13
An implementation of the barvinok‒Woods integer projection algorithm (English)
ITSL, 53-59 (2008).
14
Counting integer points in parametric polytopes using Barvinok’s rational functions. (English)
Algorithmica 48, No. 1, 37-66 (2007).
15
Pn: A tool for improved derivation of process networks (English)
EURASIP J. Emb. Sys. 2007 (2007).
16
Experiences with enumeration of integer projections of parametric polytopes (English)
CC, 91-105 (2005).
17
Optimizing the memory bandwidth with loop morphing (English)
ASAP, 213-223 (2004).
18
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations (English)
CASES, 248-258 (2004).
19
Multi-dimentsional incremetal loops fusion for data locality (English)
ASAP, 17-27 (2003).
20
Result 1 to 20 from 26 total
Start
Contact
Print
General Help
