F. Bourdoncle. E#cient chaotic iteration strategies with widenings. In FMPA'93, volume 735 of LNCS, pages 128--14. Springer, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
....benchmarks to real world applications. They define 23279 predicates whose analysis with China requires the direct use of a widening and about as many predicates for which no widening is used. In this respect, it must be noted that China employs a sophisticate chaotic iteration strategy proposed in [7, 8] that, among other benefits, allows to greatly reduce the number of widenings applications. This is an important point, since it would be quite easy to improve on an iteration strategy applying widenings everywhere or improperly [7] The results of this experimental evaluation are summarized ....
....a sophisticate chaotic iteration strategy proposed in [7, 8] that, among other benefits, allows to greatly reduce the number of widenings applications. This is an important point, since it would be quite easy to improve on an iteration strategy applying widenings everywhere or improperly [7]. The results of this experimental evaluation are summarized in Table 1, where each row corresponds to a di#erent choice for the value of the extrapolation threshold k, controlling the delay before the applications of both the standard and the new widening operators. Precision Time # programs # ....
F. Bourdoncle. E#cient chaotic iteration strategies with widenings. In D. Bjrner, M. Broy, and I. V. Pottosin, editors, Proceedings of the International Conference on "Formal Methods in Programming and Their Applications", volume 735 of Lecture Notes in Computer Science, pages 128--141, Academgorodok, Novosibirsk, Russia, 1993. Springer-Verlag, Berlin.
Time Stamps for Fixed-Point Approximation - Damian (Correct)
.... to compute approximation using widenings or narrowings [6] O Keefe s bottomup algorithm [14] has inspired a significant number of articles, where the convergence speed is improved using refined strategies on choosing the next iteration, or exploiting locality properties of the specifications [1,11,15]. Such algorithms have also been applied to languages with dynamic control flow. Chen, Harrison and Yi [4] developed advanced techniques such as waiting for all successors , leading edge first , suspend evaluation , which improve the behavior of the bottom up algorithm when applied to such ....
Bourdoncle, F., E#cient chaotic iteration strategies with widenings, in: Proceedings of the International Conference on Formal Methods in Programming and their Applications, Lecture Notes in Computer Science 735 (1993), pp. 128--141.
A Practical and Flexible Flow Analysis for Higher-Order Languages - Ashley, Dybvig (1997) (20 citations) (Correct)
....projections to values, and we apply them to the entire computation state. Furthermore, they always project a value to the top of the value lattice, while we permit the operator to project a value to any other value above it in the lattice. Cousot and Cousot [Cousot and Cousot 1977] and Bourdoncle [Bourdoncle 1992; 1993] use widening operators in a theoretical context as a means of building computable analyses over lattices with infinite height and accelerating analyses over lattices with finite height. A widening operator # is a substitute for the least upper bound operator. The constraint is that given two ....
Bourdoncle, F. 1993. E#cient chaotic iteration strategies with widening. In Proceedings of the International Conference on Formal Methods in Programming and their Applications. Lecture Notes in Computer Science, vol. 735. Springer-Verlag, 128--141.
A Practical and Flexible Flow Analysis for Higher-Order Languages - Ashley (1996) (20 citations) (Correct)
....to ours. The di#erence is that they apply projections to values, and we apply them to the entire computation state. Furthermore, they always project a value to the top of the value lattice, while we permit the operator to project a value to any other value above it in the lattice. Bourdoncle [4, 5] uses widening operators in a theoretical setting to accelerate convergence to a solution. A widening operator # is a substitute for the least upper bound operator. The constraint is that given two points x and y, x#y # x#y. Both of these approaches the promise the potential to accelerate the ....
Francois Bourdoncle. E#cient chaotic iteration strategies with widening. In Proceedings of the International Conference on Formal Methods in Programming and their Applications, volume 735 of Lecture Notes in Computer Science, pages 128--141. Springer-Verlag, 1993.
Interprocedural Control Flow Analysis - Nielson, Nielson (1999) (6 citations) (Correct)
....software in new environments: one merely needs to check that the new libraries or environments satisfy the solution used to optimize the program. It can also be used as the basis for generating a set of constraints [21] whose least solution can be obtained using standard techniques (e.g. [2]) Given a program e and the ve caches (R d F ; R c F ; M F ; W F ; S F ) the purpose of the analysis is to check whether or not the caches are acceptable solutions to the Data and Control Flow Analysis. The rst step is to nd (or guess) the following auxiliary information: an abstract ....
F. Bourdoncle. EÆcient chaotic iteration strategies with widenings. In Proc. Formal Methods in Programming and Their Applications, volume 735 of Lecture Notes in Computer Science, pages 128-141. Springer, 1993.
Symbolic Methods to Enhance the Precision of - Numer Ic Al (Correct)
No context found.
F. Bourdoncle. E#cient chaotic iteration strategies with widenings. In FMPA'93, volume 735 of LNCS, pages 128--14. Springer, 1993.
Precise and Efficient Static Array Bound Checking for Large.. - Venet, Brat (2004) (Correct)
No context found.
F. Bourdoncle. E#cient chaotic iteration strategies with widenings. In Proceedings of the International Conference on Formal Methods in Programming and their Applications, volume 735 of Lecture Notes in Computer Science, pages 128--141. Springer Verlag, 1993.
Timing Verification with Crosstalk for Transparently - Latched Circuits Hai (2003) (Correct)
No context found.
Francois Bourdoncle. E#cient chaotic iteration strategies with widening. In International Conf. on Formal Methods in Programming and Their Applications, LNCS 735, number 735 in LNCS, pages 128--141, 1993.
Software Verification for Programmable Logic Controllers - Huuck (2003) (Correct)
No context found.
Francois Bourdoncle. E#cient chaotic iteration strategies with widenings. In Proc. of the International Conference on Formal Methods in Programming and their Applications, volume 735 of LNCS, pages 128--141, 1993.
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (1 citation) (Correct)
No context found.
F. Bourdoncle, E#cient chaotic iteration strategies with widenings, in: D. Bjrner, M. Broy, I. V. Pottosin (Eds.), Proceedings of the International Conference on "Formal Methods in Programming and Their Applications", Vol. 735 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Academgorodok, Novosibirsk, Russia, 1993, pp. 128--141.
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (1 citation) (Correct)
No context found.
F. Bourdoncle, E#cient chaotic iteration strategies with widenings, in: D. Bjrner, M. Broy, I. V. Pottosin (Eds.), Proceedings of the International Conference on "Formal Methods in Programming and Their Applications", Vol. 735 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Academgorodok, Novosibirsk, Russia, 1993, pp. 128--141.
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
F. Bourdoncle, E#cient chaotic iteration strategies with widenings, in: D. Bjrner, M. Broy, I. V. Pottosin (Eds.), Proceedings of the International Conference on "Formal Methods in Programming and Their Applications", Vol. 735 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Academgorodok, Novosibirsk, Russia, 1993, pp. 128--141.
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (1 citation) (Correct)
No context found.
F. Bourdoncle, E#cient chaotic iteration strategies with widenings, in: D. Bjrner, M. Broy, I. V. Pottosin (Eds.), Proceedings of the International Conference on "Formal Methods in Programming and Their Applications", Vol. 735 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Academgorodok, Novosibirsk, Russia, 1993, pp. 128--141.
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
F. Bourdoncle. E#cient chaotic iteration strategies with widenings. In D. Bjrner, M. Broy, and I. V. Pottosin, editors, Proceedings of the International Conference on "Formal Methods in Programming and Their Applications", volume 735 of Lecture Notes in Computer Science, pages 128--141, Academgorodok, Novosibirsk, Russia, 1993. Springer-Verlag, Berlin.
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (1 citation) (Correct)
No context found.
F. Bourdoncle, E#cient chaotic iteration strategies with widenings, in: D. Bjrner, M. Broy, I. V. Pottosin (Eds.), Proceedings of the International Conference on "Formal Methods in Programming and Their Applications", Vol. 735 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Academgorodok, Novosibirsk, Russia, 1993, pp. 128--141.
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
F. Bourdoncle, E#cient chaotic iteration strategies with widenings, in: D. Bjrner, M. Broy, I. V. Pottosin (Eds.), Proceedings of the International Conference on "Formal Methods in Programming and Their Applications", Vol. 735 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Academgorodok, Novosibirsk, Russia, 1993, pp. 128--141.
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
F. Bourdoncle. E#cient chaotic iteration strategies with widenings. In D. Bjrner, M. Broy, and I. V. Pottosin, editors, Proceedings of the International Conference on "Formal Methods in Programming and Their Applications", volume 735 of Lecture Notes in Computer Science, pages 128--141, Academgorodok, Novosibirsk, Russia, 1993. Springer-Verlag, Berlin.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC