[Libre-soc-bugs] [Bug 869] Formal verification of fadd for just round-nearest-ties-to-even without exception flags/traps

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=869

Jacob Lifshay <programmerjake at gmail.com> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
       The table of|                            |[jacob]
  payments (in EUR)|                            |#amount = <FIXME:
     for this task;|                            |lkcl>
        TOML format|                            |
             Status|IN_PROGRESS                 |RESOLVED
         Resolution|---                         |FIXED

--- Comment #1 from Jacob Lifshay <programmerjake at gmail.com> ---
I implemented correct NaN propagation for the fadd pipeline, so this task is
complete. considering that this whole task was only 2 days of work, I think eur
1500 is probably too much, lkcl, I'll let you change it to a more suitable
value.

I switched to bitwuzla for the smt solver, which made it run *much* faster than
z3 for this particular test, fast enough that I can run the f32 formal proof
too.

on my computer:
f16 takes 11s
f32 takes 3m15s
f64 takes >15m so I set it to be skipped

-- 
You are receiving this mail because:
You are on the CC list for the bug.