previous_group previous up next next_group
Previous: 4. Conclusion Up: Towards a Multi-Domain Interface Next: About this document ...

Bibliography

AI91
Corinne Ancourt and François Irigoin.
Scanning polyhedra with DO loops.
In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 39-50, April 1991.
inproceeding.

ALV
ALV.
Action language verifier.
http://www.cs.ucsb.edu/ bultan/composite.
Project.

APRa
APRON.
Apron compte rendu.
http://apron.cri.ensmp.fr.
APRON site.

APRb
APRON.
Numerical program analysis.
http://www.cri.ensmp.fr/apron.
Project APRON.

AST
ASTREE.
Analyseur statique de logiciels temps-reel embarques.
www.astree.ens.fr/.
Project ASTREE.

BCC$^$03
B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival.
A static analyzer for large safety-critical software.
In PLDI. ACM, 2003.

BRZaH02
R. Bagnara, E. Ricci, E. Za, and a Hill.
Possibly not closed convex polyhedra and the parma polyhedra library, 2002.
citeseer.nj.nec.com/bagnara02possibly.html.

BYK01
T. Bultan and T. Yavuz-Kahveci.
Action language verifier, 2001.

CAI00
Fabien COELHO Corinne ANCOURT and François IRIGOIN.
Linear algebra as a proof engine.
Technical report, Centre de Recherche en Informatique, École des Mines de PARIS, November 2000.
tech.

CH78
Patrick COUSOT and Nicolas HALBWACHS.
Automatic discovery of linear restraints among variables of a program.
In ACM Symposium on Principles of Programming Languages, pages 84-96, January 1978.

CHI
CHINA.
A data-flow analyzer for clp languages.
http://www.cs.unipr.it/China/.
Project.

CI96
Béatrice Creusillet and François Irigoin.
Exact vs. approximate array region analyses.
In International Workshop on Languages and Compilers for Parallel Computing, volume 1239 of Lecture Notes in Computer Science, pages 86-100. Springer-Verlag, 1996.

Cla96
Philippe Clauss.
Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientific programs.
In International Conference on Supercomputing, pages 278-285, 1996.

FER05
Jérôme FERET.
Numerical abstract domains for digital filters.
In International workshop on Numerical & Symbolic Abstract Domains (NSAD 2005), number ?? in ENTCS, page ?? Elsevier, 2005.
To appear, ? Elsevier.

HAL79
Nicolas HALBWACHS.
Determination automatique de relations lineares verifiees par les variables d'un programe.
PhD thesis, Universite Scientifique et Medicale de Grenoble, France, Mars 1979.
thesis.

HK91
Paul Havlak and Ken Kennedy.
An implementation of interprocedural bounded regular section analysis.
IEEE Transactions on Parallel and Distributed Systems, 2(3):350-360, 1991.

HMPV03
N. Halbwachs, D. Merchat, and C. Parent-Vigouroux.
Cartesian factoring of polyhedra in linear relation analysis.
In Static Analysis Symposium, SAS'03, San Diego, June 2003. LNCS 2694, Springer Verlag.

IJT91
François Irigoin, Pierre Jouvelot, and Rémi Triolet.
Semantical interprocedural parallelization: an overview of the pips project.
In ICS, pages 144-151, June 1991.

JEA
Bertrand JEANNET.
New polka.
www.irisa.fr/prive/bjeannet/newpolka.html.
Library Polka.

JEA00
Bertrand JEANNET.
Partitionnement Dynamique dans l'Analyse de Relations Linéaires et Application à la Vérification de Programmes Synchrones.
PhD thesis, Institut National Polytechnique de Grenoble, September 2000.

LES96
Arnauld LESERVOT.
Analyse interprocédurale du flot des données.
PhD thesis, Université PARIS VI, March 1996.

LOE
Vincent LOECHNER.
Polylib.
Web site: icps.u-strasbg.fr/polylib/.
Project.

Mer05
David Merchat.
Réduction du nombre de variables en analyse de relations linéaires.
PhD thesis, Université Joseph Fourier Grenoble I, May 2005.

MIN
Antoine MINÉ.
The octagon abstract domain library.
www.di.ens.fr/mine/oct.
Library Octagon.

MIN01
Antoine MINÉ.
The octagon abstract domain.
In AST 2001 in WCRE 2001, IEEE, pages 310-319. IEEE CS Press, October 2001.
www.di.ens.fr/ mine/publi/article-mine-ast01.pdf.

MIN04
Antoine MINÉ.
Domaines numériques abstraits faiblement relationnels: Weakly Relational Numerical Abstract Domains.
PhD thesis, École Normale Supérieure de PARIS, December 2004.

NBA
NBAC.
Nbac.
www.irisa.fr/prive/bjeannet/nbac/nbac.html.
Project NBAC.

Ome
Omega.
Omega.
http://www.cs.umd.edu/projects/omega.
Project.

PAR
PARMA.
Parma polyhedral library.
Web site: http://www.cs.unipr.it/ppl/.
Project.

PIPa
PIPS.
Linear c3.
www.cri.ensmp.fr/pips/.
Project LINEAR C3.

PIPb
PIPS.
Paralleliseur interprocedural de programmes scientifiques.
www.cri.ensmp.fr/pips/.
Project PIPS.

PUG91
William PUGH.
The omega test: a fast and practical integer programming algorithm for dependence analysis.
In Supercomputing, pages 4-13, 1991.

PUG92
William PUGH.
A practical algorithm for exact array dependence analysis.
Communications of the ACM, 35(8):102-114, August 1992.

QUE
Duong NGUYEN QUE.
Hq interface.
www.cri.ensmp.fr/people/duong/HQ_API.
A common interface prototype.

SOG
Jean-Claude SOGNO.
Logiciel janus.
Restricted.
Project Chloé.

Wil
D. K. Wilde.
A library for doing polyhedral operations.
Technical Report RR-2157.
citeseer.nj.nec.com/wilde97library.html.

YAN93
Yi-Qing YANG.
Tests des Dépendances et Transformations de Programme.
PhD thesis, École Nationale Supérieur des Mines de PARIS, November 1993.


Nguyen Que Duong
2006-09-16