-
1
-
-
24644450827
-
The astreé analyzer
-
Lecture Notes in Computer Science
-
P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival The astreé analyzer S. Sagiv, ESOP Lecture Notes in Computer Science vol. 3444 2005 Springer 21 30
-
(2005)
ESOP
, vol.3444
, pp. 21-30
-
-
Cousot, P.1
Cousot, R.2
Feret, J.3
Mauborgne, L.4
Miné, A.5
Monniaux, D.6
Rival, X.7
-
2
-
-
0022091645
-
Computational complexity of the range of the polynomial in several variables
-
A. Gaganov Computational complexity of the range of the polynomial in several variables Cybernetics and Systems Analysis 21 4 July 1985 418 421
-
(1985)
Cybernetics and Systems Analysis
, vol.21
, Issue.4
, pp. 418-421
-
-
Gaganov, A.1
-
3
-
-
85025493187
-
Solving systems of polynomial inequalities in subexponential time
-
D. Grigoriev, and N. Vorobjov Solving systems of polynomial inequalities in subexponential time J. Symb. Comput. 5 1/2 1988 37 64
-
(1988)
J. Symb. Comput.
, vol.5
, Issue.1-2
, pp. 37-64
-
-
Grigoriev, D.1
Vorobjov, N.2
-
4
-
-
85035043897
-
Generalized interval arithmetic
-
Lecture Notes in Computer Science, Springer Berlin / Heidelberg
-
E. Hansen Generalized interval arithmetic Interval Mathematics Lecture Notes in Computer Science vol. 29 1975 Springer Berlin / Heidelberg 7 18
-
(1975)
Interval Mathematics
, vol.29
, pp. 7-18
-
-
Hansen, E.1
-
5
-
-
33745655841
-
Symbolic methods to enhance the precision of numerical abstract domains
-
Charleston, South Carolina, USA, January 2006. Springer
-
A. Miné. Symbolic methods to enhance the precision of numerical abstract domains. In Proc. of the 7th Int. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI'06), volume 3855 of Lecture Notes in Computer Science, pages 348-363, Charleston, South Carolina, USA, January 2006. Springer.
-
Proc. of the 7th Int. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI'06), Volume 3855 of Lecture Notes in Computer Science
, pp. 348-363
-
-
Miné, A.1
-
6
-
-
0002470473
-
Computational Complexity of Interval Algebraic Problems: Some Are Feasible and Some Are Computationally Intractable - A Survey
-
A.L.V. Kreinovich, and J. Rohn Computational Complexity of Interval Algebraic Problems: Some Are Feasible and Some Are Computationally Intractable - A Survey G. Alefeld, A. Frommer, B. Lang, Scientific Computing and Validated Numerics 1996 Akademie Verlag 293 306
-
(1996)
Scientific Computing and Validated Numerics
, pp. 293-306
-
-
Kreinovich, A.L.V.1
Rohn, J.2
|