Abstract
The specification language RCTL, an extension of CTL, is defined by adding the power of regular expressions to CTL. In addition to being a more expressive and natural hardware specification language than CTL, a large family of RCTL formulas can be verified on-the-fly (during symbolic reachability analysis). On-the-fly model checking, as a powerful verification paradigm, is especially efficient when the specification is false and extremely efficient when the computation needed to get to a failing state is short. It is suitable for the inherently gradual design process since it detects a multitude of bugs at the early verification stages, and paves the way towards finding the more complex errors as the design matures. It is shown that for every erroneous finite computation, there is an RCTL formula that detects it and can be verified on-the-fly. On-the-fly verification of RCTL formulas has moved model checking in IBM into a different class of designs inaccessible by prior techniques.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
I. Beer, S. Ben-David, C. Eisner, A. Landver, “Rule-Base: an Industry-Oriented Formal Verification Tool”, in Proc. 33rd Design Automation Conference 1996, pp. 655–660.
E.M. Clarke and E.A. Emerson, “Design and synthesis of synchronization skeletons using Branching Time Temporal Logic”, in Proc. Workshop on Logics of Programs, Lecture Notes in Computer Science, Vol. 131 (Springer, Berlin, 1981) pp. 52–71.
E.M. Clark and E.A. Emerson, “Characterizing Properties of Parallel Programs as Fixed-point”, in Seventh International Colloquium on Automata, Languages, and Programming, Volume 85 of LNCS, 1981.
E. Clark, O. Grumberg and K. Hamaguchi, “Another Look at LTL Model Checking”, Formal Methods in System Design, Volume 10, Number 1, Feb. 1997.
B.Chen, M. Yamazaki, M. Fujita, “Bug Identification of a Real Chip Design by Symbolic Model Checking”, Proc. European Design and Test Conference, 1994, pp. 132–136.
A. Th. Eiriksson and K.L. McMillan, “Using Formal Verification/ Analysis Methods on the Critical Path in System Design: A Case Study”, 7th International Conference, CAV '95, pp. 367–380.
O. Grumberg and D.E. Long, “Model checking and modular verification”, ACM Trans. on Programming Languages and Systems 16 (3), 1994.
H. lwashita and T. Nakata, “Forward Model Checking Techniques Oriented to Buggy Designs”, International Conference on Computer Aided Design, ICCAD '97.
O. Lichtenstein an A. Pnueli, “Checking that finite state concurrent programs satisfy their linear specification”, Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, Jan. 1985.
D. Long, “Model Checking, Abstraction and Compositional Verification”, Ph.D. Thesis, CMU, 1993.
K.L. McMillan, “Symbolic Model Checking”, Kluwer Academic Publishers, 1993.
Y Vardi and P Wolper “An automatic theoretic approach to automatic program verification”, Proceeding of the First Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, June 1986.
P Wolper “Temporal Logic can be more expressive”, 22nd Annual Symposium on Foundation of Computer Science, Oct. 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beer, I., Ben-David, S., Landver, A. (1998). On-the-fly model checking of RCTL formulas. In: Hu, A.J., Vardi, M.Y. (eds) Computer Aided Verification. CAV 1998. Lecture Notes in Computer Science, vol 1427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028744
Download citation
DOI: https://doi.org/10.1007/BFb0028744
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64608-2
Online ISBN: 978-3-540-69339-0
eBook Packages: Springer Book Archive