In this chapter we discuss the formal semantics of sequences and properties. We show how the property clock is interpreted in formal verification, and how to reduce clocked properties to the unclocked ones. We provide an alternative property classification into strong and weak depending on the requirements imposed on the property clock. To illustrate the concept of strong operators, we discuss several advanced strong SVA operators. We conclude this chapter with the description how immediate, deferred, and embedded concurrent assertions are treated in formal verification. This chapter does not require any preliminary knowledge except for the familiarity with Boolean logic. We also assume that the reader is familiar with the notion of a set, and with the basic operations on sets, like union, intersection, and complement. Other mathematical notions used in this chapter, such as relations, quantifiers, automata, and languages, are briefly explained in the text as needed.
KeywordsFormal Semantic Formal Verification Boolean Expression Empty Word Disable Condition
- 1.IEEE Standard VHDL Language Reference Manual (2000) IEEE Std 1076-2000, pp 1–290Google Scholar
- 19.Bustan D, Havlicek J (2006) Some complexity results for systemverilog assertions. In: CAV. pp 205–218Google Scholar
- 35.Havlicek J, Shultz K, Armoni R, Dudani S, Cerny E (2004) Accellera Technical Report 2004.01: Notes on the Semantics of Local Variables in Accellera SystemVerilog 3.1 Concurrent AssertionsGoogle Scholar