Creating a type system for a family of assembly languages | Applied Discrete Mathematics. Supplement. 2018. № 11. DOI: 10.17223/2226308X/11/42

HomeIssuesCreating a type system for a family of assembly languages | Applied Discrete Mathematics. Supplement. 2018. № 11. DOI: 10.17223/2226308X/11/42

Creating a type system for a family of assembly languages

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.

Download file
Counter downloads: 145

Keywords

система типов, ассемблер, статический анализ, бинарные приложения, type system, assembly, static analysis, binary applications

Authors

NameOrganizationE-mail
Sorokovikov N. V.Tomsk State Universityd86leader@yandex.ru
Всего: 1

References

Caballero J. and Zhiqiang L. Type inference on executables // ACM Computing Surveys. 2016. V. 48. No. 4. С. 65:1-65:35.
Cardelli L. Type Systems. N.Y.: CRC Press, 2004.
Pierce B. C. Types and Programming Languages. Cambridge: MIT Press, 2002.
Creating a type system for a family of assembly languages | Applied Discrete Mathematics. Supplement. 2018. № 11. DOI: 10.17223/2226308X/11/42

Creating a type system for a family of assembly languages | Applied Discrete Mathematics. Supplement. 2018. № 11. DOI: 10.17223/2226308X/11/42