uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A high-level model for an assembly language attacker by means of reflection
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
Katholieke Univ Leuven, iMinds Distrinet, Leuven, Belgium.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
2015 (English)In: Dependable Software Engineering: Theories, Tools, and Applications, Springer, 2015, 168-182 p.Conference paper, Published paper (Refereed)
Abstract [en]

Many high-level functional programming languages are compiled to or interoperate with, low-level languages such as C and assembly. Research into the security of these compilation and interoperation mechanisms often makes use of high-level attacker models to simplify formalisations. In practice, however, the validity of such high-level attacker models is frequently called into question. In this paper we formally prove that a light-weight ML equipped with a reflection operator can serve as an accurate model for malicious assembly language programs, when reasoning about the security threats such an attacker model poses to the abstractions of ML programs that reside within a protected memory space. The proof proceeds by relating bisimulations over the assembly language attacker and the high-level attacker.

Place, publisher, year, edition, pages
Springer, 2015. 168-182 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 9409
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-267094DOI: 10.1007/978-3-319-25942-0_11ISI: 000374099200011ISBN: 9783319259413 (print)OAI: oai:DiVA.org:uu-267094DiVA: diva2:872013
Conference
SETTA 2015, November 4–6, Nanjing, China
Available from: 2015-10-17 Created: 2015-11-17 Last updated: 2016-10-17Bibliographically approved

Open Access in DiVA

fulltext(524 kB)31 downloads
File information
File name FULLTEXT02.pdfFile size 524 kBChecksum SHA-512
4871604135f3a8a97332b782280e7ecfe078611f72722dcd0e41e53dc5a5a560b0018c8afa079a87b234626b32c484217b3ff3e99f7e62f8d1ee71d7a638c4c7
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Larmuseau, AdriaanClarke, Dave

Search in DiVA

By author/editor
Larmuseau, AdriaanClarke, Dave
By organisation
Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 31 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 334 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf