A new numerical abstract domain based on difference-bound matrices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2053 LNCS, Issue , 2001, Pages 155-172

  Miné, Antoine ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; GRAPHIC METHODS; MODEL CHECKING; STATIC ANALYSIS;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; COMPLETE LATTICES; DIFFERENCE BOUND MATRICES; INTERVAL DOMAIN; NON-TRIVIAL ALGORITHMS; PARALLEL LANGUAGES; REAL CONSTANTS;

MATRIX ALGEBRA;

EID: 84888254089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44978-7_10     Document Type: Conference Paper

References (14)

1. F. Bourdoncle. Efficient chaotic iteration strategies with widenings. In FMPA'93, number 735 in LNCS, pages 128-141. Springer-Verlag, 1993.
2. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, 1990.
3. P. Cousot. Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique de programmes. Thèse d'état ès sciences mathématiques, Université scientifique et médicale de Grenoble, France, 1978.
4. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proc. of the 2 Int. Symposium on Programming, pages 106-130. Dunod, Paris, France, 1976.
5. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In ACM POPL'79, pages 269-282. ACM Press, 1979.
6. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2-3):103-179, 1992.
7. P. Cousot and R. Cousot. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, invited paper. In PLILP'92, number 631 in LNCS, pages 269-295. Springer-Verlag, August 1992.
8. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In ACM POPL'78, pages 84-97. ACM Press, 1978.
9. L. Lamport. A new solution of dijkstra's concurrent programming problem. Communications of the ACM, 8(17):453-455, August 1974.
10. K. Larsen, F. Larsson, P. Pettersson, and W. Yi. Efficient verification of real-time systems: Compact data structure and state-space reduction. In IEEE RTSS'97, pages 14-24. IEEE CS Press, December 1997.
11. K. Larsen, C. Weise, W. Yi, and J. Pearson. Clock difference diagrams. Nordic Journal of Computing, 6(3):271-298, October 1999.
12. A. Miné. Representation of Two-Variable Difference or Sum Constraint Set and Application to Automatic Program Analysis. Master's thesis, ENS, 2000. http://www.eleves.ens.fr:8080/home/mine/stage-dea/index.shtml.en.
13. J. Møller, J. Lichtenberg, R. Andersen, H., and H. Hulgaard. Difference decision diagrams. In CSL'99, Volume 1683 of LNCS, pages 111-125. Springer-Verlag, September 1999.
14. S. Yovine. Model-checking timed automata. In Embedded Systems, number 1494 in LNCS, pages 114-152. Springer-Verlag, October 1998.