Fully-abstract compilation by approximate back-translation

DOI10.1145/2837614.2837618zbMath1347.68064OpenAlexW2293692853MaRDI QIDQ2828252

Marco Patrignani, Dominique Devriese, Frank Piessens

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/570054

zbMATH Keywords

logical relationsstep-indexed logical relationssecure compilationcompiler securitycross-language logical relationsfully-abstract compilation

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Linear capabilities for fully abstract compilation of separation-logic-verified code ⋮ StkTokens: Enforcing well-bracketed control flow and stack encapsulation using linear capabilities

This page was built for publication: Fully-abstract compilation by approximate back-translation