You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Sungkeun Cho 88813fdaa7 [inferbo] Revise division by constant ... Summary: This diff tries to make less imprecise division by constants results. For example, the results of the division `[l, u] / c`, where `c` is a positive constant, are: 1. If `l/c` or `u/c` is representable in the bound domain, it uses the precise bounds, i.e., `[l/c, u/c]`. 2. If it is not representable, it tries to make conservative results: if `0<=l<=u`, it returns `[0, u]` because `0 <= [l/c, u/c] <= u` if `l<=u<=0`, it returns `[l, 0]` because `l <= [l/c, u/c] <= 0` if `l<=0<=u`, it returns `[l, u]` because `l <= [l/c, u/c] <= u` 3. otherwise, it returns top, `[-oo, +oo]` Reviewed By: ezgicicek Differential Revision: D18270380 fbshipit-source-id: 8fb14c0e4		5 years ago
..
Makefile	[copyright] Remove years	6 years ago
break.c	[copyright] Remove years	6 years ago
compound_loop_guard.c	[copyright] Remove years	6 years ago
cost_test.c	[inferbo] Revise division by constant	5 years ago
cost_test_deps.c	[copyright] Remove years	6 years ago
instantiate.c	[copyright] Remove years	6 years ago
invariant.c	[copyright] Remove years	6 years ago
issues.exp	[inferbo] Revise widen of bounds	5 years ago
jump_inside_loop.c	[copyright] Remove years	6 years ago
loops.c	[copyright] Remove years	6 years ago
purity.c	[copyright] Remove years	6 years ago
switch_continue.c	[copyright] Remove years	6 years ago
two_loops_symbolic.c	[copyright] Remove years	6 years ago