Re: Recognize valid paths

Tim Frink <plfriko@yahoo.de>
26 Aug 2008 15:27:12 GMT

          From comp.compilers
Related articles
Recognize valid paths plfriko@yahoo.de (Tim Frink) (2008-08-20)
Re: Recognize valid paths m.helvensteijn@gmail.com (2008-08-23)
Re: Recognize valid paths DrDiettrich1@aol.com (Hans-Peter Diettrich) (2008-08-24)
Re: Recognize valid paths plfriko@yahoo.de (Tim Frink) (2008-08-26)
Re: Recognize valid paths plfriko@yahoo.de (Tim Frink) (2008-08-26)
Re: Recognize valid paths m.helvensteijn@gmail.com (Michiel Helvensteijn) (2008-08-27)
Re: Recognize valid paths jeffrey.kenton@comcast.net (Jeff Kenton) (2008-09-01)
| List of all articles for this month |
From: Tim Frink <plfriko@yahoo.de>
Newsgroups: comp.compilers
Date: 26 Aug 2008 15:27:12 GMT
Organization: Compilers Central
References: 08-08-042 08-08-043
Keywords: analysis
Posted-Date: 26 Aug 2008 23:33:53 EDT

Hi,


> if (x > 10)
> assert( x > 10 && ((firstScope && x == 1) || (x >= 1 && !
> firstScope)) );
> // |
> // V
> assert( x > 10 && !firstScope);
> x = 10;
> }


A question on this simplification after "->". What type of rules to
do apply to infer that "
((firstScope && x == 1) || (x >= 1 && !> firstScope)) )"
becomes
"!firstScope" ?


> But if they're unclear, I can try to give an informal explanation.


That would be fine.


In general, how do you call this type of equations and their
solving? Are there any known approaches for that?

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.