Moka with Ristretto

Abstract

Moka explored the prevalence of a sub-Turing Complete (sub-TC) program semantics in a large-scale codebase. It showed that the high concentration of code can be implemented without the full power of a Turing machine, justifing the utility of restricted execution environments, and their use in code development. In addition, the Ristretto ECP to Moka investigated the feasibility of automatically restricting provably-bounded software components to sub-TC execution environments for enhanced security of legacy code-bases. It used compiler and Just-in-Time (JIT) loop unrolling, combined with modern CPU branch tracing functions to automatically enforce forward only execution on applicable portions of a given program.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2017
Accession Number
AD1041690

Entities

People

  • Jonathan Miodownik
  • Mark Bridgman

Tags

Communities of Interest

  • Energy and Power Technologies
  • Engineered Resilient Systems

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Automata
  • Compilers
  • Computational Complexity
  • Computer Programming
  • Computer Programs
  • Cybersecurity
  • Environment
  • Formal Languages
  • Government Procurement
  • Language
  • Linguistics
  • Machine Languages
  • Machines
  • Security
  • Semantics

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Programming and Software Development.
  • Parallel and Distributed Computing.