Geodesic
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/}
}
TY  - JOUR
AU  - N. V. Sorokovikov
TI  - Creating a~type system for a~family of assembly languages
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2018
SP  - 136
EP  - 138
IS  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2018_11_a41/
LA  - ru
ID  - PDMA_2018_11_a41
ER  - 
%0 Journal Article
%A N. V. Sorokovikov
%T Creating a~type system for a~family of assembly languages
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2018
%P 136-138
%N 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2018_11_a41/
%G ru
%F 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/

[1] Caballero J., Zhiqiang L., “Type inference on executables”, ACM Computing Surveys, 48:4 (2016), Article 65, 35 pp. | DOI

[2] Cardelli L., Type Systems, CRC Press, N.Y., 2004

[3] Pierce B. C., Types and Programming Languages, MIT Press, Cambridge, 2002 | MR