Ignore:
Timestamp:
Jun 15, 2012, 5:29:10 PM (8 years ago)
Author:
boender
Message:
  • updates & changes
File:
1 edited

Legend:

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

    r2096 r2098  
    1212where it is important to have as small solution as possible.
    1313
     14In itself the algorithm is already useful, as it results in a smaller solution
     15than the simple `every branch instruction is long' used up until now. It also
     16results in a smaller solution than the greatest fixed point algorithm that
     17{\tt gcc} uses. It does this without sacrificing speed or correctness.
     18
    1419This algorithm is part of a greater whole, the CerCo project, which aims to
    15 complete formalise and verify a concrete cost preserving compiler for a large
     20completely formalise and verify a concrete cost preserving compiler for a large
    1621subset of the C programming language. More information
    1722on the formalisation of the assembler, of which the present work is a part,
Note: See TracChangeset for help on using the changeset viewer.