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.
> 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.
-- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.Received on Wed Aug 10 07:24:09 2011
This archive was generated by hypermail 2.1.8 : Wed Aug 10 2011 - 07:24:20 PDT