China
Africa
Explore chapters and articles related to this topic
Design and Verification Languages
Published in Luciano Lavagno, Igor L. Markov, Grant Martin, Louis K. Scheffer, Electronic Design Automation for IC System Design, Verification, and Testing, 2017
In the early 2000s, a sort of renaissance occurred in verification languages. Temporal logics, specifically linear temporal logic (LTL) and computation tree logic (CTL), form the mathematical basis for most assertion checking, but their traditional mathematical syntax is awkward for hardware designers. Instead, a number of more traditional computer languages, which combine a more human-readable syntax for the bare logic with a lot of “syntactic sugar” for more naturally expressing common properties, were proposed for expressing properties in these logics. Two industrial efforts from Intel (ForSpec) and IBM (Sugar) emerged as the most complete and were later adopted in part by SystemVerilog and VHDL.
Design and Verification Languages
Published in Louis Scheffer, Luciano Lavagno, Grant Martin, EDA for IC System Design, Verification, and Testing, 2018
Recently, a sort of renaissance has been occurring in verification languages. Temporal logics, specifically linear temporal logic (LTL) and computation tree logic (CTL), form the mathematical basis for most assertion checking, but their traditional mathematical syntax is awkward for hardware designers. Instead, a number of more traditional computer languages, which combine a more human-readable syntax for the bare logic with a lot of “syntactic sugar” for more naturally expressing common properties, have been proposed for expressing properties in these logics. Two industrial efforts from Intel (ForSpec) and IBM (Sugar) have emerged as the most complete ones.
Consistency Management of UML Models
Published in Katalin Popovici, Pieter J. Mosterman, Real-Time Simulation Technologies, 2017
Emilia Farcas, Ingolf H. Krüger, Massimiliano Menarini
We now define the abstract language we use to specify Queries and Constraints (and, therefore, systems). The benefits of defining this language are twofold. First, it provides an explicit context for mapping specifications (both composite and elementary) to systems in the semantic framework. Second, it provides a target language for the UML translation. The goal of the language is not to introduce a new textual syntax, and, therefore, we keep it simple by ignoring punctuation and other syntactic sugar necessary for a complete textual language definition.
Source code plagiarism detection with low-level structural representation and information retrieval
Published in International Journal of Computers and Applications, 2021
Low-level structural representation is a recent medium to detect source code plagiarism. It is a compiled form of source codes, that is extracted from executable files. Unique to this medium, it only contains semantic-preserving tokens [6]. Further, all syntactic-sugar forms are automatically translated to its original representation (e.g. a for loop is translated to a while loop). According to [6,8–11], such representation is proved to be more effective and efficient when compared to source code token sequence (i.e. a frequently used medium for detecting source code plagiarism).