RE: [sv-ac] Minutes from SV-AC Meeting 1/4/2011

Hi,

I checked with Gord about the bit stream types. Here is his reply:

Bit-stream types include dynamic and associative arrays so it is definitely
not possible to determine the width at compile time. See 6.24.3 for
examples, including where the result of a bit-stream cast operation
is a dynamic array or queue.

If we say that any bit-stream type is allowed and define the result to
be the same as though the expression was cast to a dynamic array
of logic, then I think everything should be fine.

Thanks.
Manisha

-----Original Message-----
From: owner-sv-ac@eda.org [mailto:owner-sv-ac@eda.org] On Behalf Of Thomas J Thatcher
Sent: Wednesday, January 05, 2011 12:30 AM
To: sv-ac@eda.org
Subject: [sv-ac] Minutes from SV-AC Meeting 1/4/2011

Minutes of SV-AC Meetin
Date: 2011-01-04
Time: 16:30 UTC (8:30 PST)
Duration: 1.5 hours

Dial-in information:
--------------------
Meeting ID: 38198
Phone Number(s):
1-888-813-5316 Toll Free within North America

Live Meeting: https://webjoin.intel.com/?passcode=4972032

Agenda:
-------
- Reminder of IEEE patent policy.
See: http://standards.ieee.org/board/pat/pat-slideset.ppt

- Minutes approval

- Email ballot results

- New issues

- Issue resolution/discussion
     Addressing champions' feedback.

2557: Rules for passing automatic variables to sequence subroutines are
not clear
· Erik to modify the proposal and to remove the reference.
2804: Need to clarify rule (b) in 16.15.6 to allow inferred clock when
expression appears in procedural assertion
3113: Add port_identifier to constant_primary BNF for sequences,
properties and checkers
2476: Need clarification about system functions $onehot, etc

- Enhancement progress update

- Opens

Attendance Record:
------------------
          Legend:
                  x = attended
                  - = missed
                  r = represented
                  . = not yet a member
                  v = valid voter (2 out of last 3 or 3/4 overall)
                  n = not a valid voter
                  t = chair eligible to vote only to make or break a tie

Attendance re-initialized on 2010-07-06:

   v[xx-xxxxxxxxx-x-xxxxx--xxx] Laurence Bisht (Intel)
   v[xxxxxxxxxx-xxxxxxxxxxxxx-] Eduard Cerny (Synopsys)
   v[x--x-xxxxxxx-xxxxx-xxxxxx] Ben Cohen
   n[------xx-x-xxx-x--xxxxxxx] Surrendra Dudani (Synopsys)
   n[x-x-x--xx---xxxx---x-xxxx] Dana Fisman (Synopsys)
   v[----xxxxx-xxxx-x-xxxxxxxx] John Havlicek (Freescale)
   v[xxxxxxxx-xxx-xxxxxxxxxxxx] Tapan Kapoor (Cadence)
   t[xxxxxxxx--xxxxxxxxxxxxxxx] Dmitry Korchemny (Intel ¿ Chair)
   v[xxxxxxxx--xxxxxx-xxxxxxxx] Scott Little (Freescale)
   v[xxxxxxx-xxxxxxxxx-xxxxxxx] Manisha Kulshrestha (Mentor Graphics)
   v[xxxxx-xxxxxxxxxxxxxxxxxxx] Anupam Prabhakar (Mentor Graphics)
   v[-x-xx-xxx-xx--xxxxxxx-xxx] Erik Seligman (Intel)
   v[xxx-xxxx--xxxxxx-xxxxxxx.] Samik Sengupta (Synopsys)
   v[xxxxxxx-xxxxxxxxxxxxx-xxx] Tom Thatcher (Oracle ¿ Co-Chair)
   n[---x.....................] Srini Venkataramanan (?)
     |- attendance on 2011-01-04
   |--- voting eligibility on 2011-01-04

Minutes:
--------
- Reminder of IEEE patent policy.
See: http://standards.ieee.org/board/pat/pat-slideset.ppt
        Participants were reminded of the policy.

- Minutes approval
Ben: Move to approve minutes from last meeting
Ed: Second
        Vote results: 8y, 0n, 0a

2557: Rules for passing automatic variables to sequence subroutines are not
        clear
        Erik not here. Defer to next week.

(Tom Joined)

3113: Add port_identifier to constant_primary BNF for sequences, properties
        and checkers

        Discussion was over how to address feedback from Shalom and Francois.
        It was decided to add an example to clarify.

2476:
        Erik not here. Defer to next week.

- Enhancement progress update

Assertion system functions: Unpacked data type.

Dmitry: It appears that unpacked types are allowed, but not explicitly
        For unpacked types, can define the operation recursively.
Ed: Do we need recursive definition? Or can we use streaming operation
        to get number of bits of the expression.
Manisha: Erik had sent e-mail on Dec 18. What is the difference between
        Dmitry's proposal and Erik's e-mail?
        Is your proposal including dynamic types?
        6.24.3
Manisha: Will check on how bitstream types work.
Ed: I had sent a bitstream formulation by e-mail.
Tapan: in 6.24.3 "a bitstream type is a type consising of the following"
Dmitry: Let's get back to this next time.

Four-value type support:

Dmitry: In current formulation: for countones, X, Z bits treated as 0's.
        $onehot0: X, Z bits effectively treated as zeros. not really what
                we want. Multiple X bits may indicate that the circuit would
                permit multiple bits high.

Dmitry: Propose the following new functions:
        $onehot_4: Return true only if one bit is 1, no X & Z bits
        $onecold:
        $onecold_4:
        $onehot0_4:
        $onehot0_4z
        $count1XZ:
        $countzeros:
        $count0XZ:
        $countunknowns:
        $countX
        $countZ
Lawrence: If we add too many new functions, that would be confusing for
        users.

Anupam: Would it make more sense to have a single function "$count", which
        takes an argument of what to count: e.g.
        $count( bus[3:0], "0XZ")

Dmitry: But what if user uses a variable for the second argument?
        Could formulate as $count( bus[3:0], 1'bx)
        Might be more flexible.

        General opinion was that the first specification would be easier to
        use: i.e. $count( bus[3:0], "0xz").

Meeting Adjourned

-- 
This message has been scanned for viruses and
dangerous content by MailScanner, and is
believed to be clean.
-- 
This message has been scanned for viruses and
dangerous content by MailScanner, and is
believed to be clean.