Under-approximations of computations in real numbers based on generalized affine arithmetic

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

Volumn 4634 LNCS, Issue , 2007, Pages 137-152

  Goubault, Eric ^a   Putot, Sylvie ^a  

^a DIF   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DIGITAL ARITHMETIC; NUMERICAL METHODS; STATIC ANALYSIS;

ABSTRACT DOMAINS; PROGRAM VARIABLES;

COMPUTER SOFTWARE;

EID: 38149035184     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74061-2_9     Document Type: Conference Paper

References (17)

1. Chapoutot, A., Martel, M.: Differentiation automatique et formes de Taylor en analyse statique de programmes numériques (in French). In: AFADL'07 (2007)
2. Costan, A., Gaubert, S., Goubault, E., Martel, M., Putot, S.: A policy iteration algorithm for computing fixed points in static analysis of programs. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, Springer, Heidelberg (2005)
3. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points. Principles of Programming Languages 4, 238-252 (1977)
4. Cousot, P., Cousot, R.: Abstract interpretation frameworks. Journal of Logic and Computation 2(4), 511-547 (1992)
5. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL'78, pp. 84-97 (1978)
6. Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems. ACM Trans. Prog. Lang. Systems 19, 253-291 (1997)
7. Goldsztejn, A.: Modal intervals revisited. Submitted to Reliable Computing
8. Goldsztejn, A., Daney, D., Rueher, M., Taillibert, P.: Modal intervals revisited: a mean-value extension to generalized intervals. In: QCP'05 (2005)
9. Goubault, E., Putot, S.: Static analysis of numerical algorithms. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 18-34. Springer, Heidelberg (2006)
10. Grumberg, O., Lerda, F., Strichman, O., Theobald, M.: Proof-guided underapproximation-widening for multi-process systems. In: POPL (2005)
11. Kaucher, E.W.: Interval analysis in the extended interval space IR. Computing (Supplementum) 2, 33-49 (1980)
12. Kaucher, E.W.: Uber metrische und algebraische eigenshaften einiger beim numerischen rechnen auftretender raume, PhD thesis, Karlsruhe (1973)
13. Miné, A.: A new numerical abstract domain based on difference-bound matrices. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol. 2053, pp. 155-172. Springer, Heidelberg (2001)
14. Pasareanu, C.S., Pelánek, R., Visser, W.: Concrete model checking with abstract matching and refinement. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 52-66. Springer, Heidelberg (2005)
15. Schmidt, D.A.: A calculus of logical relations for over- and underapproximating static analyses. Sci. Comput. Program. 64(1), 29-53 (2007)
16. Schmidt, D.A.: Underapproximating predicate transformers. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 127-143. Springer, Heidelberg (2006)
17. Stolfi, J., de Figueiredo, L.H.: An introduction to affine arithmetic, TEMA (2003)