Interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity

Bourdoncle, François

doi:10.1007/bfb0024192

Cited by 19 publications

(15 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, xn}. The ordering will affect the iteration strategy, and therefore, as shown by Bourdoncle [3], has a significant impact on performance. Hence, the linear ordering should be chosen in a way that innermost loops would be evaluated before iteration on outer loops.…”

Section: Enforcing Terminationmentioning

confidence: 99%

How to combine widening and narrowing for non-monotonic systems of equations

Apinis¹,

Seidl²,

Vojdani³

2013

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

Non-trivial analysis problems require complete lattices with infinite ascending and descending chains. In order to compute reasonably precise post-fixpoints of the resulting systems of equations, Cousot and Cousot have suggested accelerated fixpoint iteration by means of widening and narrowing [6,7].The strict separation into phases, however, may unnecessarily give up precision that cannot be recovered later. While widening is also applicable if equations are non-monotonic, this is no longer the case for narrowing. A narrowing iteration to improve a given post-fixpoint, additionally, must assume that all right-hand sides are monotonic. The latter assumption, though, is not met in presence of widening. It is also not met by equation systems corresponding to context-sensitive interprocedural analysis, possibly combining context-sensitive analysis of local information with flow-insensitive analysis of globals [1].As a remedy, we present a novel operator that combines a given widening operator with a given narrowing operator . We present adapted versions of round-robin as well as of worklist iteration, local, and side-effecting solving algorithms for the combined operator and prove that the resulting solvers always return sound results and are guaranteed to terminate for monotonic systems whenever only finitely many unknowns (constraint variables) are encountered.

show abstract

Section: Enforcing Terminationmentioning

confidence: 99%

How to combine widening and narrowing for non-monotonic systems of equations

Apinis¹,

Seidl²,

Vojdani³

2013

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

show abstract

“…This has been addressed in [2] for the simpler case of references, and in [31] in for general pointers, but in a less general way that us. Point (ii) is a widely studied problem in compiler optimisation and program verification.…”

Section: Fig 1 Methodology Followed In the Papermentioning

confidence: 99%

“…The idea of this semantics, inspired by [2], is that a procedure works on local copies (called external locations) of the locations that it can reach with its pointer parameters.…”

Section: An Equivalent Local Semanticsmentioning

confidence: 99%

See 1 more Smart Citation

Precise Interprocedural Analysis in the Presence of Pointers to the Stack

Sotin

Jeannet

2011

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. In a language with procedures calls and pointers as parameters, an instruction can modify memory locations anywhere in the call-stack. The presence of such side effects breaks most generic interprocedural analysis methods, which assume that only the top of the stack may be modified. We present a method that addresses this issue, based on the definition of an equivalent local semantics in which writing through pointers has a local effect on the stack. Our second contribution in this context is an adequate representation of summary functions that models the effect of a procedure, not only on the values of its scalar and pointer variables, but also on the values contained in pointed memory locations. Our implementation in the interprocedural analyser PInterproc results in a verification tool that infers relational properties on the value of Boolean, numerical and pointer variables.

show abstract

“…This by no means indicates our method is restricted to imperative languages. There has been much work done, for instance, on the analysis of complex imperative languages [1], and our method can be applied to lift it to probabilistic cases as well.…”

Section: Our Approachmentioning

confidence: 99%

Backwards Abstract Interpretation of Probabilistic Programs

Monniaux

2001

Programming Languages and Systems

View full text Add to dashboard Cite

Interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity

Cited by 19 publications

References 6 publications

How to combine widening and narrowing for non-monotonic systems of equations

How to combine widening and narrowing for non-monotonic systems of equations

Precise Interprocedural Analysis in the Presence of Pointers to the Stack

Backwards Abstract Interpretation of Probabilistic Programs

Contact Info

Product

Resources

About