Creating a~type system for a~family of assembly languages
Prikladnaya Diskretnaya Matematika. Supplement, no. 11 (2018), pp. 136-138
Voir la notice de l'article provenant de la source Math-Net.Ru
We create a formal type system for a family of assembly languages, we also formally define commands, programs and terms of the language. We show that type inhabitance and type checking problems can be solved within the system for a language with mov and jz commands.
Keywords:
type system, assembly, static analysis, binary applications.
@article{PDMA_2018_11_a41,
author = {N. V. Sorokovikov},
title = {Creating a~type system for a~family of assembly languages},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {136--138},
publisher = {mathdoc},
number = {11},
year = {2018},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2018_11_a41/}
}
N. V. Sorokovikov. Creating a~type system for a~family of assembly languages. Prikladnaya Diskretnaya Matematika. Supplement, no. 11 (2018), pp. 136-138. http://geodesic.mathdoc.fr/item/PDMA_2018_11_a41/