SVA and PSL local variables - A practical approach

Roy Armoni; Dana Fisman; Naiyong Jin

doi:10.1007/978-3-642-39799-8_13

SVA and PSL local variables - A practical approach

Roy Armoni, Dana Fisman, Naiyong Jin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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 PSL^pract, local variables do not increase the complexity of their verification problem, keeping it in PSPACE.

Original language	English
Title of host publication	Computer Aided Verification - 25th International Conference, CAV 2013, Proceedings
Pages	197-212
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-39799-8_13
State	Published - 12 Aug 2013
Externally published	Yes
Event	25th International Conference on Computer Aided Verification, CAV 2013 - Saint Petersburg, Russian Federation Duration: 13 Jul 2013 → 19 Jul 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8044 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	25th International Conference on Computer Aided Verification, CAV 2013
Country/Territory	Russian Federation
City	Saint Petersburg
Period	13/07/13 → 19/07/13

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science (all)

Access to Document

10.1007/978-3-642-39799-8_13

Cite this

Armoni, R., Fisman, D., & Jin, N. (2013). SVA and PSL local variables - A practical approach. In Computer Aided Verification - 25th International Conference, CAV 2013, Proceedings (pp. 197-212). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8044 LNCS). https://doi.org/10.1007/978-3-642-39799-8_13

@inproceedings{2552688468474d06a6a8209e863011bf,

title = "SVA and PSL local variables - A practical approach",

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.",

author = "Roy Armoni and Dana Fisman and Naiyong Jin",

year = "2013",

month = aug,

day = "12",

doi = "10.1007/978-3-642-39799-8_13",

language = "English",

isbn = "9783642397981",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "197--212",

booktitle = "Computer Aided Verification - 25th International Conference, CAV 2013, Proceedings",

note = "25th International Conference on Computer Aided Verification, CAV 2013 ; Conference date: 13-07-2013 Through 19-07-2013",

}

Armoni, R, Fisman, D & Jin, N 2013, SVA and PSL local variables - A practical approach. in Computer Aided Verification - 25th International Conference, CAV 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8044 LNCS, pp. 197-212, 25th International Conference on Computer Aided Verification, CAV 2013, Saint Petersburg, Russian Federation, 13/07/13. https://doi.org/10.1007/978-3-642-39799-8_13

SVA and PSL local variables - A practical approach. / Armoni, Roy; Fisman, Dana; Jin, Naiyong.
Computer Aided Verification - 25th International Conference, CAV 2013, Proceedings. 2013. p. 197-212 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8044 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - SVA and PSL local variables - A practical approach

AU - Armoni, Roy

AU - Fisman, Dana

AU - Jin, Naiyong

PY - 2013/8/12

Y1 - 2013/8/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84881129097&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-39799-8_13

DO - 10.1007/978-3-642-39799-8_13

M3 - Conference contribution

AN - SCOPUS:84881129097

SN - 9783642397981

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 197

EP - 212

BT - Computer Aided Verification - 25th International Conference, CAV 2013, Proceedings

T2 - 25th International Conference on Computer Aided Verification, CAV 2013

Y2 - 13 July 2013 through 19 July 2013

ER -

SVA and PSL local variables - A practical approach

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this