|
|
|
|
| Bachelorprojekt - Softwareteknologi | Project No. 0218: Code Generation from Program Graphs |
| Aktuelle | Tidligere |
In "Formal Methods - An Appetizer" we saw that program graphs are a useful model of programs for a number of imperative programming languages. We also saw how to develop interpreters as well as how to perform verification, program analysis and impose language based security policies for programs modelled as program graphs.
We did not consider how to generate code for a suitable abstract machine for program graphs, and this is the topic of the present project.
One would need to define a suitable abstract machine taking inspiration from Java byte code or simple stack-based machines. The construction of program graphs would need to be modified slightly so as to make it clear in which order the edges leaving a node should be analysed. Next an interpreter for the abstract machine code would need to be built. The entire development should be packaged in a suitable manner. For inspiration you may take a look at the systems on FormalMethods.dk but it is not required to follow this format.
| Prerequisites: | 02141 Computer Science Modelling |
Supervisor(s) Flemming Nielson
| Sidst opdateret: Nov 27, 2017 af Hans Henrik Løvengreen |