Abstract
There are many methodologies whose main concern is reducing the complexity of a verification problem to be ultimately able to apply model checking. Here we propose to use a model-checking like procedure which operates on a small, truly symbolic description of the model. We do so by exploiting systematically the separation between the (small) control part and the (large) data part of systems which often occurs in practice. By expanding the control part, we get an intermediate description of the system which already allows our symbolic model checking procedure to produce meaningful results but which is still small enough to allow model checking to be performed.
This research has been funded in part by the MWK under No. 210.3-70631-99-14/93. The views and conclusions contained in this document are those of the authors.
Chapter PDF
Similar content being viewed by others
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
Apt, K.R. Ten years of Hoare's logic: A survey — part I, TOPLAS 3 (1981), 431–483.
Apt, K.R. and Olderog, E.-R. Verification of sequential and concurrent programs, Springer, New York (1991).
Bradfield, J.C. Verifying temporal properties of systems, BirkhÄuser, Boston (1992).
Bradfield, J.C. and Stirling, C.P. Verifying temporal properties of processes, CONCUR '90, LNCS 458 (1990), 115–125.
Brown,M.C., Clarke, E.M. and Grumberg, O. Characterizing finite Kripke structures in propositional temporal logic, TCS 59 (1988), 115–131.
Burch, J.R., Clarke, E.M., McMillan, K.L. and Dill D.L. Sequential circuit verification using symbolic model checking DAC '90, 46–51.
Clarke, E.M., Emerson, E.A. and Sistla, A.P. Automatic verification of finite state concurrent systems using temporal logics, POPL '83, 117–126.
Clarke, E.M., Grumberg, O. and Long, D.E. Model checking and abstraction, POPL '92, 343–354.
Damm, W., Döhmen, G., Helbig, J., Herrmann, R., Josko, B., Kelb, P., Korf, F. and Schlör, R. Correct system level design with VHDL, Tech. Rep., Oldenburg (1994), 54p.
Damm, W., Josko, B. and Schlör, R. Specification and verification of VHDL-based system-level hardware designs, in Börger (ed.) Specification and Validation Methods, Oxford Univ. Press, 331–410 (to appear).
Dingel, J. and Filkorn, T. Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving, CAV '95, to appear.
Emerson, E.A. Temporal and modal logic, in: Handbook of Theor. Comp. Sc., B, North Holland (1990), 997–1072.
Floyd, R.W. Assigning meanings to programs, Proc. AMS Symp. Applied Math. 19 (1967), 19–31.
Graf, S. Verification of a distributed cache memory by using abstractions, CAV '94, LNCS 818 (1994), 207–219.
Grumberg, O. and Long, D.E. Model checking and modular verification, TOPLAS 16 (1994), 843–871.
Herrmann, R. and Pargmann, H. Compiling VHDL data types into BDDs, EURO-VHDL '94, 578–583.
Hojati, R. and Brayton, R.K. Automatic datapath abstraction in hardware systems, CAV '95, to appear.
Josko, B. Verifying the correctness of AADL modules using model checking, in: Stepwise refinement of distributed systems: models, formalisms, correctness, LNCS 430 (1990), 386–400.
Manna, Z. Beyong model checking, CAV '94, LNCS 818 (1994), 220–221.
Manna, Z. and Pnueli, A. The temporal logics of reactive and concurrent systems. Specification. Springer, New York 1992.
Schlör, R. and Damm, W. Specification and verification of system-level hardware designs using timing diagrams, EDAC '93, 518–524.
Stirling, C. and Walker, D. Local model checking in the modal mu-calculus, TAPSOFT '89, LNCS 351, 369–383.
Wolper, P. Expressing interesting properties of programs in propositional temporal logic, POPL '86, 184–193.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hungar, H., Grumberg, O., Damm, W. (1995). What if model checking must be truly symbolic. In: Camurati, P.E., Eveking, H. (eds) Correct Hardware Design and Verification Methods. CHARME 1995. Lecture Notes in Computer Science, vol 987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60385-9_1
Download citation
DOI: https://doi.org/10.1007/3-540-60385-9_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60385-6
Online ISBN: 978-3-540-45516-5
eBook Packages: Springer Book Archive