{"id":111681,"date":"2024-10-18T16:14:58","date_gmt":"2024-10-18T16:14:58","guid":{"rendered":"https:\/\/pdfstandards.shop\/product\/uncategorized\/ieee-1647-2011\/"},"modified":"2024-10-24T22:02:21","modified_gmt":"2024-10-24T22:02:21","slug":"ieee-1647-2011","status":"publish","type":"product","link":"https:\/\/pdfstandards.shop\/product\/publishers\/ieee\/ieee-1647-2011\/","title":{"rendered":"IEEE 1647 2011"},"content":{"rendered":"

Revision Standard – Active. The e functional verification language is an application-specific programming language, aimed at automating the task of verifying a hardware or software design with respect to its specification. Verification environments written in e provide a model of the environment in which the design is expected to function, including the kinds of erroneous conditions the design needs to withstand. A typical verification environment is capable of generating user-controlled test inputs with statistically interesting characteristics. Such an environment can check the validity of the design responses. Functional coverage metrics are used to control the verification effort and gauge the quality of the design. e verification environments can be used throughout the design cycle, from a high-level architectural model to a fully realized system. A definition of the e language syntax and semantics and how tool developers and verification engineers should use them are contained in this standard.<\/p>\n

PDF Catalog<\/h4>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
PDF Pages<\/th>\nPDF Title<\/th>\n<\/tr>\n
1<\/td>\nIEEE Std 1647-2011 Front cover
\n <\/td>\n<\/tr>\n
3<\/td>\nTitle page
\n <\/td>\n<\/tr>\n
6<\/td>\nIntroduction
\n <\/td>\n<\/tr>\n
7<\/td>\nNotice to users
\n
Laws and regulations
\n
Copyrights
\n
Updating of IEEE documents
\n <\/td>\n<\/tr>\n
8<\/td>\nErrata
\n
Interpretations
\n
Patents
\n <\/td>\n<\/tr>\n
9<\/td>\nParticipants
\n <\/td>\n<\/tr>\n
11<\/td>\nContents
\n <\/td>\n<\/tr>\n
17<\/td>\nImportant notice
\n
1. Overview
1.1 Scope
1.2 Purpose
1.3 Verification environments <\/td>\n<\/tr>\n
19<\/td>\n1.4 Basic concepts relating to this standard <\/td>\n<\/tr>\n
24<\/td>\n1.5 Conventions used <\/td>\n<\/tr>\n
26<\/td>\n1.6 Use of color in this standard
1.7 Contents of this standard <\/td>\n<\/tr>\n
29<\/td>\n2. Normative references
3. Definitions, acronyms, and abbreviations
3.1 Definitions <\/td>\n<\/tr>\n
31<\/td>\n3.2 Acronyms and abbreviations <\/td>\n<\/tr>\n
33<\/td>\n4. e basics
4.1 Lexical conventions <\/td>\n<\/tr>\n
40<\/td>\n4.2 Syntactic elements <\/td>\n<\/tr>\n
46<\/td>\n4.3 Struct hierarchy and name resolution <\/td>\n<\/tr>\n
52<\/td>\n4.4 Ranges
4.5 Operator precedence <\/td>\n<\/tr>\n
53<\/td>\n4.6 Evaluation order of expressions <\/td>\n<\/tr>\n
54<\/td>\n4.7 Bitwise operators <\/td>\n<\/tr>\n
56<\/td>\n4.8 Boolean operators <\/td>\n<\/tr>\n
58<\/td>\n4.9 Arithmetic operators <\/td>\n<\/tr>\n
59<\/td>\n4.10 Comparison operators <\/td>\n<\/tr>\n
63<\/td>\n4.11 String matching <\/td>\n<\/tr>\n
65<\/td>\n4.12 Extraction and concatenation operators <\/td>\n<\/tr>\n
69<\/td>\n4.13 Scalar modifiers <\/td>\n<\/tr>\n
70<\/td>\n4.14 Parentheses
4.15 list.method() <\/td>\n<\/tr>\n
71<\/td>\n4.16 Special-purpose operators <\/td>\n<\/tr>\n
75<\/td>\n5. Data types
5.1 e data types <\/td>\n<\/tr>\n
81<\/td>\n5.2 Untyped expressions
5.3 Assignment rules <\/td>\n<\/tr>\n
84<\/td>\n5.4 Real data type <\/td>\n<\/tr>\n
87<\/td>\n5.5 Precision rules for numeric operations <\/td>\n<\/tr>\n
89<\/td>\n5.6 Automatic type casting <\/td>\n<\/tr>\n
90<\/td>\n5.7 Defining and extending scalar types <\/td>\n<\/tr>\n
92<\/td>\n5.8 Type-related constructs <\/td>\n<\/tr>\n
99<\/td>\n6. Structs, subtypes, and fields
6.1 Structs overview <\/td>\n<\/tr>\n
100<\/td>\n6.2 Defining structs: struct <\/td>\n<\/tr>\n
101<\/td>\n6.3 Extending structs: extend type
6.4 Restrictions on inheritance <\/td>\n<\/tr>\n
102<\/td>\n6.5 Extending subtypes
6.6 Creating subtypes with when <\/td>\n<\/tr>\n
104<\/td>\n6.7 Extending when subtypes <\/td>\n<\/tr>\n
105<\/td>\n6.8 Defining fields: field <\/td>\n<\/tr>\n
107<\/td>\n6.9 Defining list fields <\/td>\n<\/tr>\n
109<\/td>\n6.10 Projecting list of fields
6.11 Defining attribute fields <\/td>\n<\/tr>\n
111<\/td>\n7. Units
7.1 Overview <\/td>\n<\/tr>\n
113<\/td>\n7.2 Defining units and fields of type unit <\/td>\n<\/tr>\n
117<\/td>\n7.3 Unit attributes <\/td>\n<\/tr>\n
118<\/td>\n7.4 Predefined methods of any_unit <\/td>\n<\/tr>\n
120<\/td>\n7.5 Unit-related predefined methods of any_struct <\/td>\n<\/tr>\n
122<\/td>\n7.6 Unit-related predefined routines <\/td>\n<\/tr>\n
125<\/td>\n8. Template types
8.1 Defining a template type <\/td>\n<\/tr>\n
127<\/td>\n8.2 Instantiating a template type <\/td>\n<\/tr>\n
128<\/td>\n8.3 Template types and reflection <\/td>\n<\/tr>\n
129<\/td>\n8.4 Template errors <\/td>\n<\/tr>\n
130<\/td>\n8.5 Limitations
8.6 Templates versus macros <\/td>\n<\/tr>\n
133<\/td>\n9. e ports
9.1 Introduction to e ports <\/td>\n<\/tr>\n
134<\/td>\n9.2 Using simple ports <\/td>\n<\/tr>\n
136<\/td>\n9.3 Using buffer ports <\/td>\n<\/tr>\n
137<\/td>\n9.4 Using event ports <\/td>\n<\/tr>\n
138<\/td>\n9.5 Using method ports <\/td>\n<\/tr>\n
140<\/td>\n9.6 Defining and referencing ports <\/td>\n<\/tr>\n
145<\/td>\n9.7 Port attributes <\/td>\n<\/tr>\n
157<\/td>\n9.8 Buffer port methods <\/td>\n<\/tr>\n
159<\/td>\n9.9 MVL methods for simple ports <\/td>\n<\/tr>\n
165<\/td>\n9.10 Global MVL routines <\/td>\n<\/tr>\n
168<\/td>\n9.11 Comparative analysis of ports and tick access <\/td>\n<\/tr>\n
169<\/td>\n9.12 e port binding <\/td>\n<\/tr>\n
171<\/td>\n9.13 Transaction level modeling interface ports in e <\/td>\n<\/tr>\n
181<\/td>\n10. Constraints and generation
10.1 Types of constraints
10.2 Generation concepts <\/td>\n<\/tr>\n
195<\/td>\n10.3 Type constraints <\/td>\n<\/tr>\n
197<\/td>\n10.4 Defining constraints <\/td>\n<\/tr>\n
205<\/td>\n10.5 Invoking generation <\/td>\n<\/tr>\n
207<\/td>\n11. Events
11.1 Causes of events
11.2 Scope of events
11.3 Defining and emitting named events <\/td>\n<\/tr>\n
208<\/td>\n11.4 Predefined events <\/td>\n<\/tr>\n
211<\/td>\n12. Temporal expressions
12.1 Overview <\/td>\n<\/tr>\n
214<\/td>\n12.2 Temporal operators and constructs <\/td>\n<\/tr>\n
229<\/td>\n12.3 Success and failure of a temporal expression <\/td>\n<\/tr>\n
231<\/td>\n13. Temporal struct members
13.1 on <\/td>\n<\/tr>\n
232<\/td>\n13.2 expect | assume <\/td>\n<\/tr>\n
233<\/td>\n14. Time-consuming actions
14.1 Synchronization actions <\/td>\n<\/tr>\n
234<\/td>\n14.2 Concurrency actions <\/td>\n<\/tr>\n
236<\/td>\n14.3 State machines <\/td>\n<\/tr>\n
241<\/td>\n15. Coverage constructs
15.1 Defining coverage groups: cover <\/td>\n<\/tr>\n
243<\/td>\n15.2 Defining basic coverage items: item <\/td>\n<\/tr>\n
247<\/td>\n15.3 Defining cross coverage items: cross <\/td>\n<\/tr>\n
249<\/td>\n15.4 Defining transition coverage items: transition <\/td>\n<\/tr>\n
250<\/td>\n15.5 Extending coverage groups: cover … using also … is also <\/td>\n<\/tr>\n
251<\/td>\n15.6 Extending coverage items: item … using also <\/td>\n<\/tr>\n
252<\/td>\n15.7 Coverage API <\/td>\n<\/tr>\n
258<\/td>\n15.8 Coverage methods for the covers struct <\/td>\n<\/tr>\n
263<\/td>\n16. Macros
16.1 Overview <\/td>\n<\/tr>\n
264<\/td>\n16.2 define-as statement
16.3 define-as-computed statement <\/td>\n<\/tr>\n
265<\/td>\n16.4 Match expression structure <\/td>\n<\/tr>\n
267<\/td>\n16.5 Interpretation of match expressions <\/td>\n<\/tr>\n
268<\/td>\n16.6 Macro expansion code <\/td>\n<\/tr>\n
271<\/td>\n17. Print, checks, and error handling
17.1 print
17.2 Handling DUT errors <\/td>\n<\/tr>\n
276<\/td>\n17.3 Handling user errors <\/td>\n<\/tr>\n
278<\/td>\n17.4 Handling programming errors: assert <\/td>\n<\/tr>\n
279<\/td>\n18. Methods
18.1 Rules for defining and extending methods <\/td>\n<\/tr>\n
287<\/td>\n18.2 Invoking methods <\/td>\n<\/tr>\n
290<\/td>\n18.3 Parameter passing <\/td>\n<\/tr>\n
292<\/td>\n18.4 Using the C interface <\/td>\n<\/tr>\n
295<\/td>\n19. Creating and modifying e variables
19.1 About e variables
19.2 var <\/td>\n<\/tr>\n
296<\/td>\n19.3 =
19.4 op= <\/td>\n<\/tr>\n
297<\/td>\n19.5 <= <\/td>\n<\/tr>\n
299<\/td>\n20. Packing and unpacking
20.1 Basic packing <\/td>\n<\/tr>\n
302<\/td>\n20.2 Predefined pack options <\/td>\n<\/tr>\n
303<\/td>\n20.3 Customizing pack options
20.4 Packing and unpacking specific types <\/td>\n<\/tr>\n
309<\/td>\n20.5 Implicit packing and unpacking <\/td>\n<\/tr>\n
311<\/td>\n21. Control flow actions
21.1 Conditional actions <\/td>\n<\/tr>\n
313<\/td>\n21.2 Iterative actions <\/td>\n<\/tr>\n
317<\/td>\n21.3 File iteration actions <\/td>\n<\/tr>\n
318<\/td>\n21.4 Actions for controlling the program flow <\/td>\n<\/tr>\n
321<\/td>\n22. Importing and preprocessor directives
22.1 Importing e modules <\/td>\n<\/tr>\n
322<\/td>\n22.2 #ifdef, #ifndef <\/td>\n<\/tr>\n
323<\/td>\n22.3 #define <\/td>\n<\/tr>\n
324<\/td>\n22.4 #undef <\/td>\n<\/tr>\n
325<\/td>\n23. Encapsulation constructs
23.1 package: package-name
23.2 package: type-declaration <\/td>\n<\/tr>\n
326<\/td>\n23.3 package | protected | private: struct-member <\/td>\n<\/tr>\n
327<\/td>\n23.4 Scope operator (::) <\/td>\n<\/tr>\n
329<\/td>\n24. Simulation-related constructs
24.1 force
24.2 release <\/td>\n<\/tr>\n
330<\/td>\n24.3 Tick access: ‘hdl-pathname’
24.4 simulator_command() <\/td>\n<\/tr>\n
331<\/td>\n24.5 stop_run() <\/td>\n<\/tr>\n
333<\/td>\n25. Messages
25.1 Overview
25.2 Message model <\/td>\n<\/tr>\n
334<\/td>\n25.3 message and messagef <\/td>\n<\/tr>\n
336<\/td>\n25.4 Message loggers <\/td>\n<\/tr>\n
337<\/td>\n25.5 Configuring message loggers with constraints <\/td>\n<\/tr>\n
338<\/td>\n25.6 Messaging procedural interface (PI) <\/td>\n<\/tr>\n
346<\/td>\n25.7 Examples <\/td>\n<\/tr>\n
349<\/td>\n26. Sequences
26.1 Overview <\/td>\n<\/tr>\n
351<\/td>\n26.2 Sequence statement <\/td>\n<\/tr>\n
353<\/td>\n26.3 do sequence action <\/td>\n<\/tr>\n
354<\/td>\n26.4 Sequence struct types and members <\/td>\n<\/tr>\n
359<\/td>\n26.5 BFM-driver-sequence flow diagrams <\/td>\n<\/tr>\n
363<\/td>\n27. List pseudo-methods library
27.1 Pseudo-methods overview
27.2 Using list pseudo-methods
27.3 Pseudo-methods to modify lists <\/td>\n<\/tr>\n
372<\/td>\n27.4 General list pseudo-methods <\/td>\n<\/tr>\n
386<\/td>\n27.5 Math and logic pseudo-methods <\/td>\n<\/tr>\n
388<\/td>\n27.6 List CRC pseudo-methods <\/td>\n<\/tr>\n
390<\/td>\n27.7 Keyed list pseudo-methods <\/td>\n<\/tr>\n
393<\/td>\n28. Predefined methods library
28.1 Predefined methods of sys
28.2 Predefined methods of any_struct <\/td>\n<\/tr>\n
396<\/td>\n28.3 Methods and predefined attributes of unit any_unit
28.4 Pseudo-methods <\/td>\n<\/tr>\n
398<\/td>\n28.5 Coverage methods <\/td>\n<\/tr>\n
399<\/td>\n29. Predefined routines library
29.1 Deep copy and compare routines <\/td>\n<\/tr>\n
402<\/td>\n29.2 Integer arithmetic routines <\/td>\n<\/tr>\n
406<\/td>\n29.3 Real arithmetic routines <\/td>\n<\/tr>\n
407<\/td>\n29.4 bitwise_op() <\/td>\n<\/tr>\n
408<\/td>\n29.5 get_all_units()
29.6 String routines <\/td>\n<\/tr>\n
416<\/td>\n29.7 Output routines <\/td>\n<\/tr>\n
418<\/td>\n29.8 Operating system interface routines <\/td>\n<\/tr>\n
422<\/td>\n29.9 set_config()
29.10 Random routines <\/td>\n<\/tr>\n
423<\/td>\n30. Predefined file routines library
30.1 File names and search paths
30.2 File handles
30.3 Low-level file methods <\/td>\n<\/tr>\n
428<\/td>\n30.4 General file routines <\/td>\n<\/tr>\n
434<\/td>\n30.5 Reading and writing structs <\/td>\n<\/tr>\n
437<\/td>\n31. Reflection API
31.1 Introduction <\/td>\n<\/tr>\n
438<\/td>\n31.2 Type information <\/td>\n<\/tr>\n
447<\/td>\n31.3 Aspect information <\/td>\n<\/tr>\n
451<\/td>\n31.4 Value query and manipulation <\/td>\n<\/tr>\n
457<\/td>\n32. Predefined resource sharing control structs
32.1 Semaphore methods <\/td>\n<\/tr>\n
458<\/td>\n32.2 How to use the semaphore struct <\/td>\n<\/tr>\n
463<\/td>\n33. Intellectual property protection
33.1 Encryption
33.2 Decryption <\/td>\n<\/tr>\n
464<\/td>\n33.3 Reflection API
33.4 Encryption targets <\/td>\n<\/tr>\n
465<\/td>\nAnnex A (informative) Bibliography
\n <\/td>\n<\/tr>\n
467<\/td>\nB.1 Ordering problem in e
Annex B (normative) Source code serialization
\n <\/td>\n<\/tr>\n
468<\/td>\nB.2 Within a single module <\/td>\n<\/tr>\n
469<\/td>\nB.3 Importing and dependency <\/td>\n<\/tr>\n
470<\/td>\nB.4 Concrete load order <\/td>\n<\/tr>\n
471<\/td>\nB.5 Visibility scope of preprocessor directives <\/td>\n<\/tr>\n
475<\/td>\nC.1 Summary of when versus like
Annex C (informative) Comparison of when and like inheritance
\n <\/td>\n<\/tr>\n
478<\/td>\nC.2 Advantages of using when inheritance for modeling <\/td>\n<\/tr>\n
481<\/td>\nC.3 Advantages of using like inheritance <\/td>\n<\/tr>\n
482<\/td>\nC.4 When to use like inheritance <\/td>\n<\/tr>\n
483<\/td>\nD.1 The naming problem in e
D.2 Resolution overview
Annex D (normative) Name spaces
\n <\/td>\n<\/tr>\n
484<\/td>\nD.3 Qualified and unqualified names <\/td>\n<\/tr>\n
485<\/td>\nD.4 Use relation <\/td>\n<\/tr>\n
488<\/td>\nD.5 Built-in APIs <\/td>\n<\/tr>\n
489<\/td>\nD.6 Code comparison <\/td>\n<\/tr>\n
491<\/td>\nE.1 Type information interface
Annex E (informative) Reflection API examples
\n <\/td>\n<\/tr>\n
492<\/td>\nE.2 Aspect information interface <\/td>\n<\/tr>\n
493<\/td>\nE.3 Value query interface <\/td>\n<\/tr>\n
495<\/td>\nF.1 Files
F.2 IP Components
Annex F (informative) Encryption targets
\n <\/td>\n<\/tr>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

IEEE Standard for the Functional Verification Language e<\/b><\/p>\n\n\n\n\n
Published By<\/td>\nPublication Date<\/td>\nNumber of Pages<\/td>\n<\/tr>\n
IEEE<\/b><\/a><\/td>\n2011<\/td>\n495<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"featured_media":111682,"template":"","meta":{"rank_math_lock_modified_date":false,"ep_exclude_from_search":false},"product_cat":[2644],"product_tag":[],"class_list":{"0":"post-111681","1":"product","2":"type-product","3":"status-publish","4":"has-post-thumbnail","6":"product_cat-ieee","8":"first","9":"instock","10":"sold-individually","11":"shipping-taxable","12":"purchasable","13":"product-type-simple"},"_links":{"self":[{"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/product\/111681","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/product"}],"about":[{"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/types\/product"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/media\/111682"}],"wp:attachment":[{"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/media?parent=111681"}],"wp:term":[{"taxonomy":"product_cat","embeddable":true,"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/product_cat?post=111681"},{"taxonomy":"product_tag","embeddable":true,"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/product_tag?post=111681"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}