search for: constant3

...way of stating my suggestion is that, if you agree that this is a correct lattice (different from Davide's proposal) and pretend the "spontaneous undef decay" problem does not exist, then: digraph G { Unknown -> Undef Undef -> Constant1 Undef -> Constant2 Undef -> Constant3 Constant1 -> Bottom Constant2 -> Bottom Constant3-> Bottom } then it should be legal / correct to first drop every lattice element from "Unknown" to "Undef" before running the algorithm. The only cases where this would give us a conservative result is a place wh...

...nstant(IV, &I, C); + } // Otherwise, one of our operands is overdefined. Try to produce something // better than overdefined with some tricks. Also, did you mean to make the lattice as: digraph G { Unknown -> Undef Undef -> Constant1 Undef -> Constant2 Undef -> Constant3 Constant1 -> Bottom Constant2 -> Bottom Constant3-> Bottom } ? In the lattice you've drawn, Constant MEET Undef will be Bottom, when it should ideally be Constant. Secondly, what's the purpose of splitting Unknown and Undef in the new scheme? Is there a case in your algor...

On Fri, Dec 30, 2016 at 10:54 PM, Daniel Berlin <dberlin at dberlin.org> wrote: > > > On Fri, Dec 30, 2016 at 10:01 PM, Sanjoy Das <sanjoy at playingwithpointers. > com> wrote: > >> Hi Daniel, >> >> On Fri, Dec 30, 2016 at 9:47 PM, Daniel Berlin <dberlin at dberlin.org> >> wrote: >> >> >> >>> Is there a case in

...f you agree that this > is a correct lattice (different from Davide's proposal) and pretend > the "spontaneous undef decay" problem does not exist, then: > > digraph G { > Unknown -> Undef > Undef -> Constant1 > Undef -> Constant2 > Undef -> Constant3 > Constant1 -> Bottom > Constant2 -> Bottom > Constant3-> Bottom > } > > then it should be legal / correct to first drop every lattice element > from "Unknown" to "Undef" before running the algorithm. The only > cases where this would give...

...rands is overdefined. Try to produce > something > // better than overdefined with some tricks. > > > > > Also, did you mean to make the lattice as: > > digraph G { > Unknown -> Undef > Undef -> Constant1 > Undef -> Constant2 > Undef -> Constant3 > Constant1 -> Bottom > Constant2 -> Bottom > Constant3-> Bottom > } > > ? In the lattice you've drawn, Constant MEET Undef will be Bottom, > when it should ideally be Constant. > > Secondly, what's the purpose of splitting Unknown and Undef in the...

...hing >> // better than overdefined with some tricks. >> >> >> >> >> Also, did you mean to make the lattice as: >> >> digraph G { >> Unknown -> Undef >> Undef -> Constant1 >> Undef -> Constant2 >> Undef -> Constant3 >> Constant1 -> Bottom >> Constant2 -> Bottom >> Constant3-> Bottom >> } >> >> ? In the lattice you've drawn, Constant MEET Undef will be Bottom, >> when it should ideally be Constant. >> >> Secondly, what's the purpose o...

...s a correct lattice (different from Davide's proposal) and pretend >> the "spontaneous undef decay" problem does not exist, then: >> >> digraph G { >> Unknown -> Undef >> Undef -> Constant1 >> Undef -> Constant2 >> Undef -> Constant3 >> Constant1 -> Bottom >> Constant2 -> Bottom >> Constant3-> Bottom >> } >> >> then it should be legal / correct to first drop every lattice element >> from "Unknown" to "Undef" before running the algorithm. The only >...

Hi. I'm sending this email to -dev as this may be of interest of many/people may have opinions/want to try the change before it goes in to report problems. I've been recently working on a patch to integrate `undef` in the SCCP solver, in the hope of fixing a tail of latent bugs in SCCP which remained uncovered for many years. I think this is a decent time to propose, so that it can