Abstract
The problem addressed in this paper is the formal verification of temporal properties in the presence of unbounded data types. In that framework, state of the art model-checkers use reduction techniques, e.g. abstraction, to compute finite counterparts of the systems under consideration. The method we present integrates a model-checker for the modal ν-calculus with a theorem prover, it processes unbounded systems without having to reduce them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hojati, R., Isles, A., Kirkpatrick, D., Brayton, R.: Verification using Uninterpreted Functions and Finite Instantiations. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, Springer, Heidelberg (1996)
Berezin, S., Biere, A., Clarke, E., Zhu, Y.: Combining symbolic model checking with uninterpreted functions for out-of-order processor verification. In: Gopalakrishnan, G.C., Windley, P. (eds.) FMCAD 1998. LNCS, vol. 1522, pp. 369–386. Springer, Heidelberg (1998)
Bensalem, S., Lakhnech, Y., Owre, S.: Computing Abstractions of Infinite State Systems Compositionally and Automatically. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, Springer, Heidelberg (1998)
Bjørner, N., Browne, A., Colón, M., Finkbeiner, B., Manna, Z., Sipma, H., Uribe, T.: Verifying Temporal Properties of Reactive Systems: A STeP Tutorial. Formal Methods in System Design 16 (2000)
Henzinger, T., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Symposium on Principles of Programming Languages (2002)
Du, X., Ramakrishnan, C., Smolka, S.: Real-Time Verification Techniques for Untimed Systems. Electronic Notes in Theoretical Computer Science 39 (2000)
Peled, D.: Combining Partial Order Reductions with On-the-Fly Model-Checking. Formal Methods in System Design 8 (1996)
Naumovich, G., Clarke, L., Cobleigh, J.: Using partial order techniques to improve performance of data flow analysis based verification. In: Workshop on Program Analysis For Software Tools and Engineering (1999)
Godefroid, P., Sistla, P.: Symmetry and reduced symmetry in model checking. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, p. 91. Springer, Heidelberg (2001)
Uribe, T.E.: Combinations of model checking and theorem proving. In: Frontiers of Combining Systems, pp. 151–170 (2000)
Schneider, K., Kropf, T.: A unified approach for combining different formalisms for hardware verification. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, Springer, Heidelberg (1996)
McMillan, K.: Symbolic Model Checking. Kluwer Academic Pub, Dordrecht (1993)
Gordon, M., Melham, T. (eds.): Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, Cambridge (1993)
McMillan, K.L., Qadeer, S., Saxe, J.B.: Induction in compositional model checking. In: Proc. Computer Aided Verification, pp. 312–327 (2000)
Contensin, M., Pierre, L.: Combining ACL2 and a ν-calculus Model-checker to Verify System-level Designs. In: Proc. ACM & IEEE International Conference MEMOCODE 2003 (2003)
Winskel, G.: A note on model-checking the modal ν-calculus. Theoretical Computer Science 83 (1991)
Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27 (1983)
Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Press, Dordrecht (2000)
Shankar, N.: Combining Theorem Proving and Model Checking through Symbolic Analysis. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, p. 1. Springer, Heidelberg (2000)
Alur, R., Henzinger, T.A., Mang, F.Y.C., Qadeer, S., Rajamani, S.K., Tasiran, S.: MOCHA: Modularity in model checking. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, Springer, Heidelberg (1998)
McMillan, K.L.: Verification of infinite state systems by compositional model checking. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 219–237. Springer, Heidelberg (1999)
Bensalem, S., Lakhnech, Y., Owre, S.: InVeSt: A tool for the verification of invariants. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 505–510. Springer, Heidelberg (1998)
Crow, J., Owre, S., Rushby, J., Shankar, N., Srivas, M.: A tutorial introduction to PVS. In: Proc. Workshop on Industrial-Strength Formal Specification Techniques (1995)
Manolios, P., Namjoshi, K., Sumners, R.: Linking Theorem Proving and Model- Checking with Well-Founded Bisimulation. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 369–379. Springer, Heidelberg (1999)
Shankar, N.: PVS: Combining specification, proof checking and model checking. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, Springer, Heidelberg (1996)
Saidi, H., Shankar, N.: Abstract and model check while you prove. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 443–454. Springer, Heidelberg (1999)
Schneider, K., Hoffmann, D.W.: A HOL conversion for translating linear time temporal logic to ω-automata. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, p. 255. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Contensin, M., Pierre, L. (2004). Model-Checking Systems with Unbounded Variables without Abstraction. In: Rattray, C., Maharaj, S., Shankland, C. (eds) Algebraic Methodology and Software Technology. AMAST 2004. Lecture Notes in Computer Science, vol 3116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27815-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-27815-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22381-8
Online ISBN: 978-3-540-27815-3
eBook Packages: Springer Book Archive