SVA and PSL local variables - A practical approach

Roy Armoni, Dana Fisman, Naiyong Jin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 PSLpract, local variables do not increase the complexity of their verification problem, keeping it in PSPACE.

Original languageEnglish
Title of host publicationComputer Aided Verification - 25th International Conference, CAV 2013, Proceedings
Pages197-212
Number of pages16
DOIs
StatePublished - 12 Aug 2013
Externally publishedYes
Event25th International Conference on Computer Aided Verification, CAV 2013 - Saint Petersburg, Russian Federation
Duration: 13 Jul 201319 Jul 2013

Publication series

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

Conference

Conference25th International Conference on Computer Aided Verification, CAV 2013
Country/TerritoryRussian Federation
CitySaint Petersburg
Period13/07/1319/07/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'SVA and PSL local variables - A practical approach'. Together they form a unique fingerprint.

Cite this