We describe a derivational approach to abstract interpretation that yields novel and trans-parently sound static analyses when applied to well-established abstract machines for higher-order and imperative programming languages. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman (Proc. of the 14th ACM SIGACT-SIGPLAN Symp. Prin. Program. Langs, 1987, pp. 314–325), a lazy variant o
he central idea of the technique of Abstract Interpretation is that the analysis of a program consis...
Abstraction in programming uses the facilities of a given programming lan- guage to customize the ab...
We consider the problem of mechanically constructing abstract machines from operational semantics, p...
We trace the roots of abstract interpretation and its role as a foundational principle to understand...
Based on Danvy et al.'s functional correspondence, we give a further example of gradual re finement ...
We present an extensive, annotated bibliography of the abstract machines designed for each of the ma...
AbstractA number of constituents of a methodology for the systematic design of abstract machines for...
Machine Peter Sestoft Department of Mathematics and Physics Royal Veterinary and Agricultural Univ...
AbstractIn this paper we demonstrate how to use a semantics-directed generator to systematically des...
Abstract. In order to contribute to the solution of the software reliability problem, tools have bee...
In David Schmidts PhD work he explored the use of denotational semantics as a programming lan-guage....
International audienceThe λ-calculus is a peculiar computational model whose definition does not com...
Any parallel programming language provides a model of parallelism, which is accepted implicitly when...
AbstractInterpretational abstraction is proposed as a means to overcome dificiencies in cases where ...
Abstract interpretation [7] is a systematic methodology to design static program analysis which has ...
he central idea of the technique of Abstract Interpretation is that the analysis of a program consis...
Abstraction in programming uses the facilities of a given programming lan- guage to customize the ab...
We consider the problem of mechanically constructing abstract machines from operational semantics, p...
We trace the roots of abstract interpretation and its role as a foundational principle to understand...
Based on Danvy et al.'s functional correspondence, we give a further example of gradual re finement ...
We present an extensive, annotated bibliography of the abstract machines designed for each of the ma...
AbstractA number of constituents of a methodology for the systematic design of abstract machines for...
Machine Peter Sestoft Department of Mathematics and Physics Royal Veterinary and Agricultural Univ...
AbstractIn this paper we demonstrate how to use a semantics-directed generator to systematically des...
Abstract. In order to contribute to the solution of the software reliability problem, tools have bee...
In David Schmidts PhD work he explored the use of denotational semantics as a programming lan-guage....
International audienceThe λ-calculus is a peculiar computational model whose definition does not com...
Any parallel programming language provides a model of parallelism, which is accepted implicitly when...
AbstractInterpretational abstraction is proposed as a means to overcome dificiencies in cases where ...
Abstract interpretation [7] is a systematic methodology to design static program analysis which has ...
he central idea of the technique of Abstract Interpretation is that the analysis of a program consis...
Abstraction in programming uses the facilities of a given programming lan- guage to customize the ab...
We consider the problem of mechanically constructing abstract machines from operational semantics, p...
DOI
Add to ORKG