Ignore:
Timestamp:
Jun 15, 2012, 5:56:30 PM (7 years ago)
Author:
boender
Message:
  • added reference to Intel dev manual
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/ASM/CPP2012-policy/conclusion.tex

    r2098 r2099  
    1313
    1414In itself the algorithm is already useful, as it results in a smaller solution
    15 than the simple `every branch instruction is long' used up until now. It also
    16 results in a smaller solution than the greatest fixed point algorithm that
    17 {\tt gcc} uses. It does this without sacrificing speed or correctness.
     15than the simple `every branch instruction is long' used up until now---and with
     16only 64 Kb of memory, every byte counts. It also results in a smaller solution
     17than the greatest fixed point algorithm that {\tt gcc} uses. It does this
     18without sacrificing speed or correctness.
    1819
    1920This algorithm is part of a greater whole, the CerCo project, which aims to
    2021completely formalise and verify a concrete cost preserving compiler for a large
    21 subset of the C programming language. More information
    22 on the formalisation of the assembler, of which the present work is a part,
    23 can be found in a companion publication~\cite{DC2012}.
     22subset of the C programming language. More information on the formalisation of
     23the assembler, of which the present work is a part, can be found in a companion
     24publication~\cite{DC2012}.
    2425
    2526\subsection{Related work}
Note: See TracChangeset for help on using the changeset viewer.