Abstract. We propose a new way of thinking about abstract interpre-tation with a method we term environment unrolling. Model checkers for imperative languages will often apply loop unrolling to make their state space finite in the presence of loops and recursion. We propose handling environments in a similar fashion by putting a bound on the number of environments to which a given closure can transitively refer. We present how this idea relates to a normal model of abstract interpretation, give a general overview of its soundness proof in regards to a concrete seman-tics, and show empirical results demonstrating the effectiveness of our approach.
Graduation date: 1985In von Neumann Languages, side effects occur if one or more non local variables...
Abstract. Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using t...
In this paper we study the relation between the lack of completeness in abstract interpretation of m...
Standard abstract model checking relies on abstract Kripke structures which approximate concrete mod...
International audienceAbstract machines for functional languages rely on the notion of environment, ...
AbstractWe present a nondeterministic calculus of closures for the evaluation of λ-calculus, which i...
Many algorithms have been proposed to minimally refine abstract transition systems in order to get s...
Standard abstract model checking relies on abstract Kripke structures which approximate concrete mod...
Usually, abstract model checking is not strongly preserving: it may well exist a temporal specificat...
Taha and Nielsen have developed a multi-stage calculus {\lambda}{\alpha} witha sound type system usi...
AbstractWe show how abstract interpretation can be expressed in a constraint-based formalism that is...
Abstract. Abstraction is a key technique to combat the state space explosion problem in model checki...
Abstract. Formal methods combining abstract interpretation and model-checking have been considered f...
In abstract interpretation-based static analysis, approximation is encoded by abstract domains. They...
In abstract interpretation-based static analysis, approximation is encoded by abstract domains. They...
Graduation date: 1985In von Neumann Languages, side effects occur if one or more non local variables...
Abstract. Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using t...
In this paper we study the relation between the lack of completeness in abstract interpretation of m...
Standard abstract model checking relies on abstract Kripke structures which approximate concrete mod...
International audienceAbstract machines for functional languages rely on the notion of environment, ...
AbstractWe present a nondeterministic calculus of closures for the evaluation of λ-calculus, which i...
Many algorithms have been proposed to minimally refine abstract transition systems in order to get s...
Standard abstract model checking relies on abstract Kripke structures which approximate concrete mod...
Usually, abstract model checking is not strongly preserving: it may well exist a temporal specificat...
Taha and Nielsen have developed a multi-stage calculus {\lambda}{\alpha} witha sound type system usi...
AbstractWe show how abstract interpretation can be expressed in a constraint-based formalism that is...
Abstract. Abstraction is a key technique to combat the state space explosion problem in model checki...
Abstract. Formal methods combining abstract interpretation and model-checking have been considered f...
In abstract interpretation-based static analysis, approximation is encoded by abstract domains. They...
In abstract interpretation-based static analysis, approximation is encoded by abstract domains. They...
Graduation date: 1985In von Neumann Languages, side effects occur if one or more non local variables...
Abstract. Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using t...
In this paper we study the relation between the lack of completeness in abstract interpretation of m...