[sv-ac] Mantis item 3113

Hello Shalom / Francoise,

We have discussed this item in the SV-AC meeting and 2 suggestions were raised up:

1. Drop the proposal: In 16.8 it is written: "The sequential behavior and matching semantics of an instance of a named sequence are the same as those of the flattened sequence that is obtained from the body of the declaration of the named sequence by the rewriting algorithm defined in F.4.1. The rewriting algorithm substitutes actual arguments for references to the corresponding formal arguments in the body of the declaration of the named sequence. The rewriting algorithm does not itself account for name resolution and assumes that names have been resolved prior to the substitution of actual arguments. If the flattened sequence is not legal, then the instance is not legal and there shall be an error." Similarly for properties (16.13) and checkers ("All checker formal arguments are inputs and they are processed in a similar way as property formal arguments, but the data types of checker formal arguments besides those legal for a property (see 16.13)", 17.2). These clarifications already show how the BNF should be interpreted, and probably no changes are needed.

2. Leave the proposal as it is: The clarifications in the LRM cited above , as I think, address the comments.

If you have other suggestions, please share with us.

Thanks,
Laurence
---------------------------------------------------------------------
Intel Israel (74) Limited

This e-mail and any attachments may contain confidential material for
the sole use of the intended recipient(s). Any review or distribution
by others is strictly prohibited. If you are not the intended
recipient, please contact the sender and delete all copies.

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