Some complexity results for system verilog assertions

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

Volumn 4144 LNCS, Issue , 2006, Pages 205-218

  Bustan, Doron ^a   Havlicek, John ^a  

^a FREESCALE SEMICONDUCTOR INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

LOCAL VARIABLES; QUANTIFIED VARIABLES; REGULAR EXPRESSION INTERSECTION; SYSTEMVERILOG ASSERTIONS (SVA);

SYSTEMS ANALYSIS;

EID: 33749841700     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_21     Document Type: Conference Paper

References (20)

1. Accellera. System Verilog 3.1a Language Reference Manual: Accellera's Extensions to Verilog. 2004. www.eda.org/sv/SystemVerilog-3.1a.pdf.
2. R. Alur and T. Henzinger. Real-time logics: complexity and expressiveness. In Proc. 5th Symp. on Logic in Computer Science, pages 390-401, June 1990.
3. R. Armoni, D. Bustan, O. Kupferman, and M. Y. Vardi. Resets vs. aborts in linear temporal logic. In Proc. 9th Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 2619 of LNCS, pages 65-80, 2003.
4. R. Armoni, L. Fix, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, A. Tiemeyer, E. Singerman, M.Y, Vardi, and Y. Zbar. The ForSpec temporal logic: A new temporal property-specification language. In Proc. 8th Int 'I Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 2280 of LNCS, pages 296-311, 2002.
5. I. Beer, S. Ben-David, C. Eisner, D. Fisman, A. Gringauze, and Y. Rodeh, The temporal logic Sugar. In Proc. 13th Int'l Conf. on Computer Aided Verification, volume 2102 of LNCS, pages 363-367, 2001.
6. S. Ben-David, D. Fisman, and S. Ruah. Embedding finite automata within regular expressions. In Int'l Symp. on Leveraging Applications of Formal Methods, 2004.
7. D. Bustan, D. Fisman, and J. Havlicek. Automata construction for PSL. Technical Report MCS05-04, The Weizmann Institute of Science, May 2005.
8. D. Bustan, A. Flaisher, O. Grumberg, O. Kupferman, and M.Y. Vardi. Regular vacuity. In 13th Advanced Research Working Conf. on Correct Hardware Design and Verification Methods, volume 3725 of LNCS, pages 191-206, 2005.
9. M. J. C. Gordon. Validating the PSL/Sugar semantics using automated reasoning. Formal Aspects of Computing, 15(4):406-421, December 2003.
10. J. Havlicek, K. Shultz, R. Armoni, S. Dudani, and E. Cerny. Notes on the semantics of local variables in Accellera SystemVerilog 3.1 concurrent assertions. Technical Report 2004.01, Accellera, May 2004. Available from www.accellera.org.
11. H.R. Lewis. Complexity of solvable cases of the decision problem for the predicate calculus. In Foundations of Computer Science, volume 19, pages 35-47, 1978.
12. S. Miyano and T. Hayashi. Alternating finite automata on w-words. Theoretical Computer Science, 32:321-330, 1984.
13. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115-125, 1959.
14. IEEE Computer Society. 1800: IEEE Standard for System Verilog-Unified Hardware Design, Specification, and Verification Language. IEEE, 2005.
15. IEEE Computer Society. 1850: IEEE Standard for Property Specification Language (PSL). IEEE, 2005.
16. P. van Emde Boas. The convenience of tilings. In Complexity, Logic and Recursion Theory, volume 187 of Lecture Notes in Pure and Applied Mathematics, pages 331-363, 1997.
17. M.Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. Birtwistle, editors, Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science, pages 238-266, 1996.
18. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
19. Verification guild: A community of verification professionals, http://verificationguild.com.
20. H. Wang. Dominoes and the AEA case of the decision problem. In Symposium on the Mathematical Theory of Automata, pages 23-55, 1962.