The Turner 2-Strings Machines
Resumo
This paper presents an abstract machine that can be easily used to teach intermediate and source code optimization, fundamental issues in a course on compiler construction techniques, bringing together theory and practice of computer science in a simple way.
Palavras-chave:
Reports on teaching formal methods, Abstract machines, Intermediate code optimization, Source code optimization, code performance, benchmarking
Publicado
03/12/2025
Como Citar
LINS, Rafael Dueire.
The Turner 2-Strings Machines. In: SIMPÓSIO BRASILEIRO DE MÉTODOS FORMAIS (SBMF), 28. , 2025, Recife/PE.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2025
.
p. 209-224.
