Formal approaches to secure compilation: A survey of fully abstract compilation and related work

M Patrignani, A Ahmed, D Clarke - ACM Computing Surveys (CSUR), 2019 - dl.acm.org
Secure compilation is a discipline aimed at developing compilers that preserve the security
properties of the source programs they take as input in the target programs they produce as …

CakeML: a verified implementation of ML

R Kumar, MO Myreen, M Norrish, S Owens - ACM SIGPLAN Notices, 2014 - dl.acm.org
We have developed and mechanically verified an ML system called CakeML, which
supports a substantial subset of Standard ML. CakeML is implemented as an interactive …

Automatically comparing memory consistency models

J Wickerson, M Batty, T Sorensen… - Proceedings of the 44th …, 2017 - dl.acm.org
A memory consistency model (MCM) is the part of a programming language or computer
architecture specification that defines which values can legally be read from shared memory …

A trusted mechanised JavaScript specification

M Bodin, A Charguéraud, D Filaretti… - Proceedings of the 41st …, 2014 - dl.acm.org
JavaScript is the most widely used web language for client-side applications. Whilst the
development of JavaScript was initially just led by implementation, there is now increasing …

CompCertTSO: A verified compiler for relaxed-memory concurrency

J Ševčík, V Vafeiadis, F Zappa Nardelli… - Journal of the ACM …, 2013 - dl.acm.org
In this article, we consider the semantic design and verified compilation of a C-like
programming language for concurrent shared-memory computation on x86 multiprocessors …

[图书][B] Directed algebraic topology and concurrency

L Fajstrup, E Goubault, E Haucourt, S Mimram… - 2016 - Springer
Fascinating links between the semantics of concurrent programs and algebraic topology
have been discovered and developed since the 1990s, motivated by the hope that each field …

The power of parameterization in coinductive proof

CK Hur, G Neis, D Dreyer, V Vafeiadis - Proceedings of the 40th annual …, 2013 - dl.acm.org
Coinduction is one of the most basic concepts in computer science. It is therefore surprising
that the commonly-known lattice-theoretic accounts of the principles underlying coinductive …

Clarifying and compiling C/C++ concurrency: from C++ 11 to POWER

M Batty, K Memarian, S Owens, S Sarkar… - ACM SIGPLAN …, 2012 - dl.acm.org
The upcoming C and C++ revised standards add concurrency to the languages, for the first
time, in the form of a subtle* relaxed memory model*(the* C++ 11 model*). This aims to …

A verified information-flow architecture

A Azevedo de Amorim, N Collins, A DeHon… - Proceedings of the 41st …, 2014 - dl.acm.org
SAFE is a clean-slate design for a highly secure computer system, with pervasive
mechanisms for tracking and limiting information flows. At the lowest level, the SAFE …

Verifying an open compiler using multi-language semantics

JT Perconti, A Ahmed - … and Systems: 23rd European Symposium on …, 2014 - Springer
Existing verified compilers are proved correct under a closed-world assumption, ie, that the
compiler will only be used to compile whole programs. We present a new methodology for …