This paper describes context analysis, an extension to strictness analysis for lazy functional languages. In particular it extends Wadler's four point domain and permits in nitely many abstract values. A calculus is presented based on abstract reduction which given the abstract values for the result automatically finds the abstract values for the arguments. The results of the analysis are useful for veri fication purposes and can also be used in compilers which require strictness information
To compute accurate information efficiently for programs that use pointer variables, a program analy...
Abstract interpreters rely on the existence of a nxpoint algorithm that calculates a least upper bou...
The Theory of Specifications is an extension of the Calculus of Constructions where the specificatio...
The extraction of strictness information marks an indispensable element of an efficient compilation ...
A context-sensitive analysis is an analysis in which program elements are interpreted with respect ...
This thesis describes an implementation of abstract interpretation and its application to strictness...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
Since Sharir and Pnueli, algorithms for context-sensitivity have been defined in terms of 'valid' pa...
AbstractA theory of abstract interpretation (P. Cousot and R. Cousot, in “Conf. Record, 4th ACM Symp...
A substantial amount of work has been devoted to the proof of correctness of various program analyse...
. In this paper a method is proposed for carrying out analysis of imperative programs. We achieve th...
This paper presents and illustrates a practical approach to the dataflow analysis of constraint logi...
A problem arises when the usual rules of fold/unfold transformation are applied in a non--strict pro...
We describe a simple strictness analyser for purely-functional programs, show how its results are us...
Context analysis calculates which components of arguments to functions may be evaluated eagerly with...
To compute accurate information efficiently for programs that use pointer variables, a program analy...
Abstract interpreters rely on the existence of a nxpoint algorithm that calculates a least upper bou...
The Theory of Specifications is an extension of the Calculus of Constructions where the specificatio...
The extraction of strictness information marks an indispensable element of an efficient compilation ...
A context-sensitive analysis is an analysis in which program elements are interpreted with respect ...
This thesis describes an implementation of abstract interpretation and its application to strictness...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
Since Sharir and Pnueli, algorithms for context-sensitivity have been defined in terms of 'valid' pa...
AbstractA theory of abstract interpretation (P. Cousot and R. Cousot, in “Conf. Record, 4th ACM Symp...
A substantial amount of work has been devoted to the proof of correctness of various program analyse...
. In this paper a method is proposed for carrying out analysis of imperative programs. We achieve th...
This paper presents and illustrates a practical approach to the dataflow analysis of constraint logi...
A problem arises when the usual rules of fold/unfold transformation are applied in a non--strict pro...
We describe a simple strictness analyser for purely-functional programs, show how its results are us...
Context analysis calculates which components of arguments to functions may be evaluated eagerly with...
To compute accurate information efficiently for programs that use pointer variables, a program analy...
Abstract interpreters rely on the existence of a nxpoint algorithm that calculates a least upper bou...
The Theory of Specifications is an extension of the Calculus of Constructions where the specificatio...