AbstractIn this paper we demonstrate how to use a semantics-directed generator to systematically design abstract machines. The main novelty of the generator is that it generates compilers and abstract machines. The generator is fully automated and its core transformations are proved correct. In this paper we propose a design methodology based on our generator and as an example we design a functional abstract machine which turns out to be very similar to the categorial abstract machine
AbstractWe show how the problem of code generation for a simple language can be treated fully algebr...
International audienceCan machines design? Can they come up with creative solutions to problems and ...
A compiler generator is described which produces compilers competitive with handwritten ones in comp...
AbstractIn this paper we demonstrate how to use a semantics-directed generator to systematically des...
We present a system, that generates a compiler and abstract machine from a Natural Semantics specifi...
Because of the increasing gap between modern high-level programming languages and existing hardware,...
AbstractA number of constituents of a methodology for the systematic design of abstract machines for...
We present an extensive, annotated bibliography of the abstract machines designed for each of the ma...
We consider the problem of mechanically constructing abstract machines from operational semantics, p...
MACHINE Evgeniy Gabrilovich and Nissim Francez Shuly Wintner Computer Science Department Seminar fu...
We describe a derivational approach to abstract interpretation that yields novel and trans-parently ...
Given a complete, formal description of the semantics of a programming language, it should be possib...
AbstractA major problem in deriving a compiler from a formal definition is the production of correct...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...
Based on Danvy et al.'s functional correspondence, we give a further example of gradual re finement ...
AbstractWe show how the problem of code generation for a simple language can be treated fully algebr...
International audienceCan machines design? Can they come up with creative solutions to problems and ...
A compiler generator is described which produces compilers competitive with handwritten ones in comp...
AbstractIn this paper we demonstrate how to use a semantics-directed generator to systematically des...
We present a system, that generates a compiler and abstract machine from a Natural Semantics specifi...
Because of the increasing gap between modern high-level programming languages and existing hardware,...
AbstractA number of constituents of a methodology for the systematic design of abstract machines for...
We present an extensive, annotated bibliography of the abstract machines designed for each of the ma...
We consider the problem of mechanically constructing abstract machines from operational semantics, p...
MACHINE Evgeniy Gabrilovich and Nissim Francez Shuly Wintner Computer Science Department Seminar fu...
We describe a derivational approach to abstract interpretation that yields novel and trans-parently ...
Given a complete, formal description of the semantics of a programming language, it should be possib...
AbstractA major problem in deriving a compiler from a formal definition is the production of correct...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...
Based on Danvy et al.'s functional correspondence, we give a further example of gradual re finement ...
AbstractWe show how the problem of code generation for a simple language can be treated fully algebr...
International audienceCan machines design? Can they come up with creative solutions to problems and ...
A compiler generator is described which produces compilers competitive with handwritten ones in comp...
DOI
Add to ORKG