F. Bourdoncle. Semantique des langages imperatifs d'ordre superieur et interpretation abstraite. PhD thesis, Ecole Polytechnique, Paris, 1992. 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 ....
.... k greater than 4, our experiments show that the new widening captures growth patterns that do happen in practice and that for the China uses the recursive fixpoint iteration strategy on the weak topological ordering defined by partitioning of the call graph into strongly connected subcomponents [8]. 19 standard widening (no matter how delayed) are out of reach. This is important since the results obtained in practice are, besides correctness, what really matters when evaluating widening operators. The experimentation also shows that the idea of delaying the widening [12] maintains its ....
F. Bourdoncle. Semantiques des langages imperatifs d'ordre superieur et interpr etation abstraite. PRL Research Report 22, DEC Paris Research Laboratory, 1993.
Dynamic Partitioning in Analyses of Numerical Properties - Jeannet, Halbwachs, Raymond (1999) (8 citations) (Correct)
....than F , and that the system can be more efficiently solved, using chaotic iterations. It can be even more interesting in two common cases: When a widening is necessary to ensure the termination of iterations, the widening only needs to be applied on some equations (cutting dependence loops [Bou92b,CC92b]) Thus, less information is lost because of the widening. This work was partially supported by the ESPRIT LTR project SYRF . Verimag is a joint laboratory of Universit e Joseph Fourier (Grenoble I) CNRS and INPG associated with IMAG. initial not b0 and not b1 and (x=0) and (y=0) ....
F. Bourdoncle. S'emantique des langages imp'eratifs d'ordre sup'erieur et interpr 'etation abstraite. Thesis Ecole Polytechnique, Paris, 1992.
Semantic Analysis of a Concurrent Pascal (Extended Abstract) - Cridlig (Correct)
....WRITE gives an abstract state whose abstract value for variable x is [11; 16] This kind of analysis is helpful for computing the range of integer values a given variable or expression can take during the execution of the program. This has already been applied to abstract debugging for PASCAL [Bou92]. Notice that the abstract lattice of intervals has infinite height, so it is necessary to use widening operators while joining configurations to speed up the fixpoint iteration [CC92] 5 Abstract model checking The idea of abstract model checking is to do traditional model checking on the ....
F. Bourdoncle. S'emantique des langages imp'eratifs d'ordre sup'erieur et interpr'etation abstraite. PhD thesis, ' Ecole polytechnique, 1992.
Semantic Analysis of Shared-Memory Concurrent Languages using.. - Cridlig (1995) (14 citations) (Correct)
.... that Hoare Logic is incomplete for the sequential Pascal language, for Hoare Logic is inherently compositional) Therefore, we choose to analyze relations between values (or frames) of the stack; this is the only method known to us that permits precise results for this class of languages [Bou92]. The last part of the paper will establish a link between abstract interpretation and the world of model checking: the properties considered there are terms of a temporal logic suited to the states and actions of a given program to validate. A model checking algorithm decides the validity of the ....
F. Bourdoncle. S'emantique des langages imp'eratifs d'ordre sup'erieur et interpr'etation abstraite. PhD thesis, ' Ecole polytechnique, 1992.
Integrity Constraint Checking Optimization Based on.. - Benzaken, Doucet.. (1995) (1 citation) (Correct)
....given sub graph of a database. The abstract interpretation of the transaction represents partially all the possible executions of the transactions. We restrict ourselves to simple program analysis techniques in interpreting transaction rather than using pure abstract interpretation in the sense of [Bou93]. Databases before and after the execution of the transaction are given an abstract representation too, in what we call abstract databases. The application to integrity constraint will be seen in the next section. Meanwhile, we must define the tools that we use, and their properties. 3.1 The data ....
F. Bourdoncle. S'emantiques des langages imp'eratifs d'ordre sup'erieur et interpr'etation abstraite. PhD thesis, ' Ecole Polytechnique, 1993.
Implementing a Static Analyzer of Concurrent Programs: Problems.. - Cridlig (1996) (4 citations) (Correct)
....the user to ask for computed invariants at given program points. 1 Introduction 1.1 Motivation Abstract interpretation is aimed at producing tools that automatically produce invariant properties of computer programs. Such tools have already been demonstrated for imperative languages (Syntox [Bou92]) functional and logical ones. Besides the intrinsic technical difficulties of program analysis these tools must provide useful information to be successful. One thing is to equip a compiler with a strictness analyzer, another thing is to build a interactive system for abstract debugging. 1.2 ....
F. Bourdoncle. S'emantique des langages imp'eratifs d'ordre sup'erieur et interpr 'etation abstraite. PhD thesis, ' Ecole polytechnique, 1992.
Efficient Chaotic Iteration Strategies With Widenings - Bourdoncle (1993) (23 citations) Self-citation (Bourdoncle) (Correct)
....and interprocedural abstract interpretation of higher order programs based on the structure of their control flow graph. 1 Introduction Abstract interpretation [7, 10, 11] is a formal method that enables the static and automatic determination of run time properties of programs, such as the range [2, 4, 5] or congruence properties [15] of integer variables, linear inequalities [9] between variables, data aliasing [2, 4, 12, 13] etc. This method is based on a characterization of programs invariants as either least or greatest fixed points of continuous functions over complete lattices, which are ....
.... 1 Introduction Abstract interpretation [7, 10, 11] is a formal method that enables the static and automatic determination of run time properties of programs, such as the range [2, 4, 5] or congruence properties [15] of integer variables, linear inequalities [9] between variables, data aliasing [2, 4, 12, 13], etc. This method is based on a characterization of programs invariants as either least or greatest fixed points of continuous functions over complete lattices, which are classically computed by iterative computations starting from either the smallest element or the largest element of the ....
[Article contains additional citation context not shown here]
Francois Bourdoncle: "Semantiques des langages imperatifs d'ordre superieur et interpretation abstraite", Ph.D. dissertation, Ecole Polytechnique (1992)
Improving the Static Analysis of Loops - Dynamic Partitioning Techniques (2003) (Correct)
No context found.
F. Bourdoncle. Semantique des langages imperatifs d'ordre superieur et interpretation abstraite. PhD thesis, Ecole Polytechnique, Paris, 1992.
Software Verification for Programmable Logic Controllers - Huuck (2003) (Correct)
No context found.
Francois Bourdoncle. Semantiques des Langages Imperatifs d'Ordre Superieur et Interpretation Abstraite. PhD thesis, Ecole Polytechnique, 1992.
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (1 citation) (Correct)
No context found.
F. Bourdoncle, Semantiques des langages imperatifs d'ordre superieur et interpretation abstraite, PRL Research Report 22, DEC Paris Research Laboratory (1993).
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (1 citation) (Correct)
No context found.
F. Bourdoncle, Semantiques des langages imperatifs d'ordre superieur et interpretation abstraite, PRL Research Report 22, DEC Paris Research Laboratory (1993).
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
F. Bourdoncle, Semantiques des langages imperatifs d'ordre superieur et interpretation abstraite, PRL Research Report 22, DEC Paris Research Laboratory (1993).
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (1 citation) (Correct)
No context found.
F. Bourdoncle, Semantiques des langages imperatifs d'ordre superieur et interpretation abstraite, PRL Research Report 22, DEC Paris Research Laboratory (1993).
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
F. Bourdoncle. Semantiques des langages imperatifs d'ordre superieur et interpr etation abstraite. PRL Research Report 22, DEC Paris Research Laboratory, 1993.
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (1 citation) (Correct)
No context found.
F. Bourdoncle, Semantiques des langages imperatifs d'ordre superieur et interpretation abstraite, PRL Research Report 22, DEC Paris Research Laboratory (1993).
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
F. Bourdoncle, Semantiques des langages imperatifs d'ordre superieur et interpretation abstraite, PRL Research Report 22, DEC Paris Research Laboratory (1993).
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
F. Bourdoncle. Semantiques des langages imperatifs d'ordre superieur et interpr etation abstraite. PRL Research Report 22, DEC Paris Research Laboratory, 1993.
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