Abstract
We present an approach for automatically computing the set of control states reachable in systems modeled with uninterpreted functions, predicates and infinite memory. In general, the abstract state spaces of systems modeled in this fashion are infinite and exact state enumeration based procedures may not terminate. Using the Integer Combinational Sequential (ICS) concurrency model [HB95] as our underlying formalism, we show how ‘on-the-fly’ state reduction techniques, which preserve control invariance properties, can be used to significantly speed-up reachability computations on such abstract hardware representations, collapsing infinite state spaces to finite ones in some cases. The approach presented in this paper is automatic and if it terminates, will produce the exact set of reachable control states of abstract hardware models. Our techniques have been implemented in an ICS state reachability tool and experimental results are given on several examples.
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
R. E. Bryant, “Graph Based Algorithms for Boolean Function Manipulation”, IEEE Trans. on Computers, C-35(8):677–691, August 1986.
Jerry R. Burch, E. M. Clarke, K. L. McMillan, David L. Dill, “Sequential Circus Verification Using Symbolic Model Checking”, Proc. Of the Design Automation Conf., 1990
Jerry R. Burch, David L. Dill, “Automatic Verification of Pipelined Microprocessor Control”, Computer Aided Verification, Stanford, CA, June 1994.
F. Corella, “Automatic Verification of Behavioral Equivalence for Microprocessors” IEEE Transactions on Computers, 43(1):115–117, January 1994.
F. Corella, Z. Zhou, X. Song, M. Langevin, E. Cerny, “Multiway Decision Graphs for Automated Hardware Verification”, IBM technical report RC19676, July 1994.
K. Fisler and S. Johnson, “Integrating Design and Verification Environments throug a Logic Supporting Hardware Designs”, Proc. IFIP Conference on Hardware Description Languages and their Applications, Chiba, Japan, Aug. 1995.
John L. Hennessy, David A. Patterson, “Computer Architecture A Quantitative Approach”, Morgan Kaufmann Publishers, 1990.
Ramin Hojati, Robert K. Brayton, “Automatic Datapath Abstraction of Hardware Systems”, Conference on Computer-Aided Verification, June 1995.
Ramin Hojati, Adrian J. Isles, and Robert K. Brayton, “Automatic State Reduction Techniques for Hardware Systems Modeled Using Uninterpreted Functions and Infinite Memory”, IEEE International High Level Design Validation and Test Workshop, Nov 1997.
Ramin Hojati, Adrian J. Isles, Desmond Kirkpatrick, and Robert K. Brayton, “Verification Using Uninterpreted Functions and Finite Instantiations”, Formal Methods in CAD, November 1996.
W. A. Hunt, Jr. “FM8501: A verified microprocessor”, Technical Report 47, University of Texas at Austin, Institute for Computer Science, Dec. 1985.
Adrian J. Isles, Ramin Hojati, and Robert K. Brayton, “Reachability Analysis of ICS Models”, SRC Techcon, September 1996.
R.B Jones, D. L. Dill and J. R. Burch, “Efficient Validity Checking for Processor Verification”, IEEEIACM International Conference of Computer Aided Design, 1995
M. Langevin, E. Cerny, “Comparing Generic State Machines”, Computer Aided Verification, July, 1991.
Greg Nelson, Derek C. Oppen, “Fast Decision Procedures Based on Congruence Closure”, Journal of the ACM, 27(2):356–364, April 1980, June 1995.
R. E. Shostak, “A Practical Decision Procedure for Arithmetic With Function Symbols”, JACM Volume 26, No. 2, April 1979, pp. 351–360.
F. Somenzi, “CUDD: CU Decision Diagram Package, Release 2.1.1”, Departmen ECE, University of Colorado at Boulder, February 1997.
M. Srivas and M. Bickford. “Formal Verification of a Pipelined Microprocessor”. IEEE Software, 7(5):52–64, Sept 1990.
The VIS Group, “VIS: A system for Verification and Synthesis”, Conference on Computer Aided Verification, July 1996.
Z. Zhou, X. Song, S. Tahar, E. Cerny, F. Corella, M. Langevin, “Formal Verification of the Island Tunnel Controller Using Multiway Decision Graphs”, Formal Methods in Computer-Aided Design, November 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Isles, A.J., Hojati, R., Brayton, R.K. (1998). Computing reachable control states of systems modeled with uninterpreted functions and infinite memory. 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/BFb0028750
Download citation
DOI: https://doi.org/10.1007/BFb0028750
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