Abstract
Model checking is a widely used technique for verifying complex concurrent systems. The models used in classical model checking methods are assumed to be complete and consistent. However, a recent body of work has shown that this is not always the case, and multi-valued logics have been proposed to represent such models, spawning an extension of classical model checking, known as, multi-valued model checking. In this paper, we define a multi-valued set based semantics for the multi-valued modal μ-calculus and present a novel interpretation of logic programs to support multi-valued sets as first-class entities, that can be used as a practical deductive multi-valued model checking framework. This framework provides a semantics preserving encoding of multi-valued transition systems, and allows verification of arbitrary multi-valued modal μ-calculus properties. A prototype implementation of this framework has also been realized.
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.
References
Bolc, L., Borowik, P.: Many-Valued Logics. Springer, Heidelberg (1992)
Bruns, G., Godefroid, P.: Generalized model checking: Reasoning about partial state spaces. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 168–182. Springer, Heidelberg (2000)
Bruns, G., Godefroid, P.: Model checking with Multi-Valued Logics. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 281–293. Springer, Heidelberg (2004)
Charatonik, W., Podelski, A.: Set based analysis of reactive infinite-state systems. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, p. 358. Springer, Heidelberg (1998)
Chechik, M., Gurfinkel, A., Deverereux, B., Lai, A., Easterbrook, S.: Symbolic data structures for multi-valued model checking. CSRG Technical Report 446, University of Toronto (2002)
Chechik, M., Devereux, B., Easterbrook, S., Gurfinkel, A.: Multi-valued Symbolic Model Checking ACM TOSEM. ACM Press, New York (2003)
Chechik, M., Devereux, B., Gurfinkel, A.: Model checking infinite state-space systems with fine-grained abstractions using SPIN. In: Proc. SPIN Workshop on Model-Checking software (2001)
Clarke, E.M., Emerson, E.A.: Design and Synthesis of synchronization skeletons using branching time temporal logic logic. In: Logic of Programs: Workshop, Yorktown Heights, NY, May 1981. LNS, vol. 131 (1981)
Dams, D., Gerth, R., Dohmen, G., Herrmann, R., Kelb, P., Pargmann, H.: Model checking using adaptive state and data abstraction. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 455–467. Springer, Heidelberg (1994)
Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming ACM Computing Surveys. ACM, New York (2001)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)
Delzanno, G., Podelski, A.: Model checking in CLP. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 223–239. Springer, Heidelberg (1999)
Du, X., Ramakrishnan, C.R., Smolka, S.A.: Tabled Resolution + Constraints: A Recipe for Model Checking Real-Time Systems. In: Proc. RTSS 2000, pp. 175–184. IEEE, Los Alamitos (2000)
Easterbrook, S., Chechik, M.: A framework for multi-valued reasoning with over inconsistent viewpoints. In: Proc. of ICSE 2001, pp. 411–420 (2001)
Gupta, G., Pontelli, E.: A Constraint Based Approach for Specification and Verification of Real-Time Systems. In: Proc. RTSS 1997. IEEE, Los Alamitos (1997)
Gurfinkel, A., Chechik, M.: Multi-valued model checking via classical model checking. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 411–420. Springer, Heidelberg (2003)
Kleene, S.C.: Introduction to Metamathematics. D. Van Nostrand Company Inc, Princeton (1952)
Liu, X., Ramakrishnan, C., Smolka, S.A.: Fully Local and Efficient Evaluation of Alternating Fixed Points. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 5–19. Springer, Heidelberg (1998)
Konikowska, B., Penczek, W.: Reducing model checking from multi-valued CTL* to CTL*. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, p. 226. Springer, Heidelberg (2002)
Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science 27, 333–354
Mukhopadhyay, S., Podelski, A.: Model checking for timed logic processes. In: Proc. Computational Logic 2000. LNCS, pp. 598–612. Springer, Heidelberg (2000)
Ramakrishna, Y.S., Ramakrishnan, C.R., Ramakrishnan, I.V., Smolka, S.A., Swift, T., Warren, D.S.: Efficient Model Checking Using Tabled Resolution. In: Proc. CAV 1997. LNCS, pp. 143–154. Springer, Heidelberg (1997)
Schmidt, D.: Denotational Semantics: A Methodology for Language Development. W.C. Brown Publishers (1986)
Sterling, L., Shapiro, S.: The Art of Prolog. MIT Press, Cambridge (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mallya, A. (2005). Deductive Multi-valued Model Checking. In: Gabbrielli, M., Gupta, G. (eds) Logic Programming. ICLP 2005. Lecture Notes in Computer Science, vol 3668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562931_23
Download citation
DOI: https://doi.org/10.1007/11562931_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29208-1
Online ISBN: 978-3-540-31947-4
eBook Packages: Computer ScienceComputer Science (R0)