Abstract
In this paper we present new results on the verification of iterative sequential systems. We address bilateral interconnections and circular arrangements of cells, and extend our previous treatment [13] of unilateral systems. Our approach is based on the new definition of boundedness, given in terms of regularity of the union of an infinite number of languages. The definition of boundedness provides sufficient conditions for the equivalence of iterative systems to be decidable. It also provides network invariants for inductive proofs. This new framework allows the derivation of some previously known results as well as the new ones presented here.
This work was supported in part by NSF/DARPA grant MIP-9115432 and by SRC contract 91-DJ-206.
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
Browne, M. C., Clarke, E. M., and Grumberg, O.: Reasoning about networks with many identical finite state processes. Information and Computation 81, 1 (Apr. 1989), 13–31
Bryant, R. E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35, 8 (Aug. 1986), 677–691
Burch, J. R., Clarke, E. M., McMillan, K. L., and Dill, D. L.: Sequential circuit verification using symbolic model checking. In Proceedings of the Design Automation Conference (June 1990), pp. 46–51
Chiodo, M., Shiple, T. R., Sangiovanni-Vincentelli, A., and Brayton, R. K.: Auto-matic reduction in CTL compositional model checking. In Proceedings of the International Conference on Computer-Aided Design (Santa Clara, CA, Nov. 1992), pp. 172–178
Cho, H., Hachtel, G. D., Jeong, S.-W., Plessier, B., Schwarz, E., and Somenzi, F.: ATPG aspects of FSM verification. In Proceedings of the IEEE International Conference on Computer Aided Design (Nov. 1990), pp. 134–137
Choueka, Y.: Theories of automata on ω-tapes: A simplified approach. J. Comput. Syst. Sci. 8 (1974), 117–141
Clarke, E. M., Grunberg, O., and Long, D. E.: Model checking and abstraction. In Proceedings of the 19th ACM Symposium on Principles of Programming Languages (Jan. 1992)
Coudert, O., and Madre, J. C.: A unified framework for the formal verification of sequential circuits. In Proceedings of the IEEE International Conference on Computer Aided Design (Nov. 1990), pp. 126–129
Hennie, F. C.: Iterative Arrays of Logical Circuits. The M.I.T. Press and John Wiley, New York, 1961
Hennie, F. C.: Finite-State Models for Logical Machines. John Wiley, New York, 1968
Kurshan, R. P., and McMillan, K. L.: A structural induction theorem for processes. In Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing (Edmonton, Alberta, Canada, Aug. 1989), pp. 239–247
Macii, E., Plessier, B., and Somenzi, F.: Verification of systems containing counters. In Proceedings of the International Conference on Computer-Aided Design (Santa Clara, CA, Nov. 1992), pp. 179–182
Rho, J.-K., and Somenzi, F.: Inductive verification for iterative systems. In Proceedings of the Design Automation Conference (Anaheim, CA, June 1992), pp. 628–633
Sistla, A. P., and German, S. M.: Reasoning with many processes. In Proceedings of the Symposium on Logic in Computer Science (Ithaca, NY, June 1987), pp. 138–152
Touati, H., Savoj, H., Lin, B., Brayton, R. K., and Sangiovanni-Vincentelli, A.: Implicit enumeration of finite state machines using BDD's. In Proceedings of the IEEE International Conference on Computer Aided Design (Nov. 1990), pp. 130–133
Wolper, P.: Expressing interesting properties of programs in propositional temporal logic. In Proceedings 13th ACM Symposium on Principles of Programming Languages (St. Petersburgh, Jan. 1986), pp. 184–192
Wolper, P., and Lovinfosse, V.: Verifying properties of large sets of processes with network invariants. In Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407, J. Sifakis, Ed. Springer-Verlag, 1989, pp. 68–80
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rho, JK., Somenzi, F. (1993). Automatic generation of network invariants for the verification of iterative sequential systems. In: Courcoubetis, C. (eds) Computer Aided Verification. CAV 1993. Lecture Notes in Computer Science, vol 697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56922-7_11
Download citation
DOI: https://doi.org/10.1007/3-540-56922-7_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56922-0
Online ISBN: 978-3-540-47787-7
eBook Packages: Springer Book Archive