Hi David,
> On 9/08/11 11:34 AM, Jim Lewis wrote:
>> David Koontz - provide example(s) of verification problem that cannot be
>> handled without a solver - ie: by procedural randomization - in which
>> items are randomized in a specific order.
>
> I originally commented on the potential difference in performance (number of
> operations needed) based on constrained (as in a solver) randomization
> versus procedural randomization.
>
> How that translates into the need for the above described proof escapes me,
> and I don't recall agreeing to do so.
You made a claim. I just wanted to see if you could back
it up with any facts and/or examples. I would like to see
if the issues still apply in the approach I have in mind.
>> Martin and David Koontz - Ask about need for Unicode extended identifiers
>> and comments in linked in groups and comp.lang.vhdl - get volunteers who
>> would be willing to work on proposals toward this.
>
> I addressed this in a email in response to Evan's post earlier.
Email is temporary. If there is something you would like recorded,
please make sure to add it to the twiki proposal that Martin started.
Best,
Jim
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Jim Lewis Director of Training mailto:Jim@SynthWorks.com SynthWorks Design Inc. http://www.SynthWorks.com 1-503-590-4787 Expert VHDL Training for Hardware Design and Verification ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.Received on Wed Aug 10 09:08:30 2011
This archive was generated by hypermail 2.1.8 : Wed Aug 10 2011 - 09:08:46 PDT