CBMC

cbmc:remove_asm_test

  1. Git
  2. lp:cbmc
  3. remove_asm_test
Last commit made on 2017-10-12
Get this branch:
git clone -b remove_asm_test https://git.launchpad.net/cbmc

Branch merges

Branch information

Name:
remove_asm_test
Repository:
lp:cbmc

Recent commits

f44f75f... by Daniel Kroening <email address hidden>

test for function pointer removal

b63eb99... by Daniel Kroening <email address hidden>

Merge pull request #1418 from diffblue/address_of_unions

rewrite_union: fix address_of unions

e82701a... by Daniel Kroening <email address hidden>

Merge pull request #1456 from diffblue/preserve-hidden

preserve hidden flag for functions

3ff8448... by Chris Smowton <email address hidden>

Merge pull request #1468 from smowton/smowton/fix/unit_test_makefile_dependencies

Fix testing-utils Makefile dependency

1a81b3f... by Daniel Kroening <email address hidden>

Merge pull request #1341 from reuk/reuk/big-int-fixes

Big-int: Fix copy-assign, add move ops, enable implicit conversions

1d9eace... by =?utf-8?q?Matthias_G=C3=BCdemann?= <email address hidden>

Merge pull request #1465 from mgudemann/feature/string-solver-performance

Feature/string solver performance

987d384... by martin <martin@raphael>

Switch (!a | b) for (a => b) to clarrify the intent of the code.

40ff71b... by martin <martin@raphael>

Avoid generating redundant constraints by iterating over n^2/2 rather than n^2 pairs.

Ackermann constaints are symmetric so we don't need to consider every pair of indexes,
only every ordered pair. This can halve the number of constraints generated which can
be a significant saving in terms of problem size but also saves significant time when
used in the string solver.

d8b25f3... by Chris Smowton <email address hidden>

Merge pull request #1470 from reuk/reuk/fix-null-dereferences

Fix a few places where a null pointer may be dereferenced

5fa7b9a... by Chris Smowton <email address hidden>

Merge pull request #1466 from reuk/reuk/return-ptr-from-expr-cast

Return pointer from expr_try_dynamic_cast