SVA and PSL Local Variables - A Practical Approach Conference Paper uri icon

abstract

  • SystemVerilog Assertions (SVA), as well as Property Specification Language (PSL) are linear temporal logics based on LTL [14], extended with regular expressions and local variables. In [6] Bustan and Havlicek show that the local variable extensions, as well as regular expressions with intersection, render the verification problem of SVA and PSL formulae EXPSPACE-complete. In this paper we show a practical approach for the verification problem of SVA and PSL with local variables. We show that in practice, for a significant and meaningful subsets of those languages, which we denote PSLpract , local variables do not increase the complexity of their verification problem, keeping it in PSPACE.

publication date

  • January 1, 2013