Polynomial precise interval analysis revisited

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

Volumn 5760 LNCS, Issue , 2009, Pages 422-437

  Gawlitza, Thomas ^a   Leroux, Jérôme ^b   Reineke, Jan ^c   Seidl, Helmut ^a   Sutre, Grégoire ^b   Wilhelm, Reinhard ^c  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BELLMAN-FORD ALGORITHMS; COMPLETE LATTICES; CONSTANT INTERVALS; INTERVAL ANALYSIS; INTERVAL EQUATIONS; POLYNOMIAL-TIME ALGORITHMS; SINGLE SOURCE SHORTEST PATHS; SYSTEMS OF EQUATIONS;

POLYNOMIAL APPROXIMATION;

EID: 70349884032     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03456-5_28     Document Type: Conference Paper

References (11)

1. Cousot, P., Cousot, R.: Static Determination of Dynamic Properties of Programs. In: Second Int. Symp. on Programming, Dunod, Paris, France, pp. 106-130 (1976)
2. Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., Rival, X.: The ASTRÉE Analyser. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.3444, pp. 21-30. Springer, Heidelberg (2005)
3. Cousot, P., Cousot, R.: Comparison of the Galois Connection and Widening/ Narrowing Approaches to Abstract Interpretation. In: JTASPEFL 1991, Bordeaux, vol.74, pp. 107-110. BIGRE (1991)
4. Miné, A.: Relational Abstract Domains for the Detection of Floating-Point Run- Time Errors. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.2986, pp. 3-17. Springer, Heidelberg (2004)
5. Miné, A.: Symbolic Methods to Enhance the Precision of Numerical Abstract Domains. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.3855, pp. 348-363. Springer, Heidelberg (2006)
6. Su, Z.,Wagner, D.: A Class of Polynomially Solvable Range Constraints for Interval Analysis Without Widenings. Theor. Comput. Sci. (TCS) 345(1), 122-138 (2005)
7. Knuth, D.E.: A Generalization of Dijkstra's algorithm. Information Processing Letters (IPL) 6(1), 1-5 (1977)
8. Gawlitza, T., Seidl, H.: Precise Fixpoint Computation Through Strategy Iteration. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.4421, pp. 300-315. Springer, Heidelberg (2007)
9. Leroux, J., Sutre, G.: Accelerated Data-Flow Analysis. In: Riis Nielson, H., Filé, G. (eds.) SAS 2007. LNCS, vol.4634, pp. 184-199. Springer, Heidelberg (2007)
10. Seidl, H.: Least and Greatest Solutions of Equations over N. Nordic Journal of Computing (NJC) 3(1), 41-62 (1996)
11. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)