References - SVA: The Power of Assertions in SystemVerilog - page 560

18. C. Baier, J.-P. Katoen, Principles of Model Checking (The MIT Press, Cambridge, 2008)
19. J. Bergeron, E. Cerny, A. Hunter, A. Nightingale, Verification Methodology Manual for

SystemVerilog (Springer, New York, 2006)
20. M. Bernardo, A. Cimatti, Formal Methods for Hardware Verification: 6th International School
on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM .
Lecture Notes in Computer Science (Springer, New York, 2006)
21. R. Bloem, B. Jobstmann, N. Piterman, Y. Saár. Synthesis of reactive (1) designs. J. Comput.
Syst. Sci. 78 , 911-938 (2011)
22. D. Bustan, Mantis Item 290: Recursive properties can define non-regular languages, Erratum
submitted to the IEEE 1800 SV-AC as part of the development and revision of IEEE
1800-2005, November 2004
23. D. Bustan, J. Havlicek, Some complexity results for SystemVerilog assertions, in Proceedings
of Computer Aided Verification , Lecture Notes in Computer Science. ISBN 3-540-37406-X,
pp. 205-218 (Springer, 2006)
24. D. Bustan, A. Flaisher, O. Grumberg, O. Kupferman, M.Y. Vardi. Regular vacuity. Lect. Notes
Comput. Sci. 3725 , 191-206 (2005) ISBN 3-540-37406-X
25. D. Bustan, D. Korchemny, E. Seligman, J. Yang, SystemVerilog Assertions: past, present, and
future SVA standardization experience. IEEE Des. Test Comput. 29 (2), 23-31 (2012)
26. E. Cerny, D. Korchemny, L. Piper, E. Selingman, S. Dudani, Verification case studies:
evolution from sva 2005 to sva 2009, in Proceedings of Design Verification Conference, DVCon
(Accellera System Initiative, 2009)
27. R. Chadha. Static Timing Analysis for Nanometer Designs (Springer, New York, 2009)
28. L. Claesen, J.-P. Schupp, P. Das, P. Johannes, S. Perremans, H. De Man, Efficient false path
elimination algorithms for timing verification by event graph preprocessing. Integr. VLSI J.
8 (2), 173-187 (1989)
29. E.M. Clarke, O. Grumberg, D. Peled, Model Checking , 6th edn. (MIT Press, Cambridge, 2008)
30. V.R. Cooper, Getting Started with UVM: A Beginner's Guide (Verilab Publishing, Austin,

2013)
31. R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, F.K. Zadeck, Efficiently computing static
single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst.
13 (4), 451-490 (1991)
32. A. Das, P. Basu, A. Banerjee, P. Dasgupta, P.P. Chakrabarti, C. Rama Mohan, L. Fix,
R. Armoni, Formal verification coverage: computing the coverage gap between temporal
specifications, in ICCAD '04: Proceedings of the 2004 IEEE/ACM International conference
on Computer-aided design , (IEEE Computer Society, Washington, 2004), pp. 198-203
33. C. Eisner, D. Fisman, J. Havlicek, A topological characterization of weakness, in Proceedings
of Principles of Distributed Computing , pp. 1-8 (ACM, 2005)
34. E.A. Emerson, Temporal and modal logic, in Handbook of Theoretical Computer Science ,ed.
by J. van Leeuwen (Elsevier Sience Publishers B.V., Amsterdam, 1990), pp. 996-1072
35. E.A. Emerson, J.Y. Halpern, Decision procedures and expressiveness in the temporal logic of
branching time, in STOC '82: Proceedings of the 14th Annual ACM Symposium on Theory of
Computing (ACM, New York, 1982), pp. 169-180
36. D. Fisman, O. Kupferman, S. Seinvald, M. Vardi, A framework for inherent vacuity, in
Hardware and Software: Verification and Testing , vol. 5394. Lecture Notes in Computer
Science (Springer, New York, 2008), pp. 7-22
37. H. Foster, Assertion-based verification: Industry myths to realities (invited tutorial), in
Proceedings of Computer Aided Verification , Lecture Notes in Computer Science. ISBN 978-
3-540-70543-7, pp. 5-10 (2008)
38. M. Glasser. Open Verification Methodology Cookbook (Springer, New York, 2009)
39. K. Gulati, S.P. Khatri, Hardware Acceleration of EDA Algorithms. Custom ICs, FPGAs and
GPUs (Springer, New York, 2010)
40. J. Havlicek, N. Levi, H. Miller, K. Shultz, Extended CBV statement semantics. Part of a
proposal presented to the Accellera Formal Verification Technical Committee, April 2002