Minutes from SV-AC Committee Meeting

Date: 2016-04-20

Time: 16.00:00 UTC (9:00 PDT)

Duration: 1 hour

Agenda

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 2016-03-09:

n[.x-x] Mehbub Ali (Intel)

v[.xx-] Ang Boon Chong (Intel)

n[x-x-] Shalom Bresticker (Accellera)

n[.x--] Dennis Brophy (Mentor Graphics)

v[xxxx] Eduard Cerny (Synopsys)

v[xx-x] Ben Cohen (Accellera)

t[x-xx] Dmitry Korchemny (Synopsys - Chair)

v[xxx-] Manisha Kulshrestha (Mentor Graphics)

v[xxxx] Anupam Prabhakar (Mentor Graphics)

v[xxxx] Erik Seligman (Intel – Co-chair)

n[x-x-] Samik Sengupta (Synopsys)

|- attendance on 2016-04-20

|--- voting eligibility on 2016-04-20

Minutes

IEEE patent policy reminder

Minutes approval

Erik: Move to approve the minutes from SV-AC meeting 2016-04-06.

Ed: Second

Vote: 4y/0n/0a

Meeting minutes have been approved.

Email ballot results

Issue 3672 failed: 6y/3n/0a

Issue 4750 passed: 9y/0n/0a

Issue 4991 passed: 9y/0n/0a

Issue 5438 passed: 9y/0n/0a

Issue 5549 passed: 8y/0n/0a

Issue 5602 passed: 8y/0n/0a

Mantis 3672: hierarchical access to named block in assertion action blocks

Ed: Uploaded a new proposal

Call for new vote

0002578: Vacuity definition

Ben: Negative vacuity should be well defined. Why do the tools report negative vacuous attempts as failures? What about assertion control tasks?

Anupam: There is no mention about vacuous failures in assertion system tasks, it is possible to control reporting of a vacuous success only.

Opens:

Anupam: Why weak / strong operators can be applied to sequences only?

Dmitry: It should be possible to apply then to any properties by stripping the “liveness” part, but would be difficult to provide a simple definition without referring to the formal semantics.

Anupam: In 16.12.22 Nondegeneracy, the difference between b) and c) is not clear.

Dmitry: b) excludes the sequences admitting empty matches only; c) allows such sequences but excludes sequences having no match at all: e.g., 1 intersect 1 ##1 1. An example would help here.

Comments

Topic revision: r1 - 2016-05-05 - 21:39:50 - ErikSeligman
 
Copyright © 2008-2025 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback