Skip to main content
SpringerLink
Log in

Constraint-Based Model Checking of Data-Independent Systems

  • Conference paper
Formal Methods and Software Engineering (ICFEM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2885))

Included in the following conference series:

Abstract

Data-independent systems are an important class of infinite-state systems which can be subject to model checking by first building finite-state property-preserving abstractions. Exploiting data independence in practice involves user guidance, either in terms of the abstraction itself or in terms of symmetry properties of the system. In this paper we present a constraint-based verification technique that automatically handles data-independent systems. Our technique introduces a unified, automata-based model for infinite-state systems and LTL formulas. The technique can be seen as a generalization of explicit state model checker for reachability and LTL properties. We have implemented our technique using logic programming with tabulation and constraints. We also describe an extension to the automata model that permits verification of a richer class of systems. We show its power by analyzing configuration (security) vulnerabilities in a computer system.

This research was supported in part by NSF grants EIA-9705998, CCR-9876242, IIS-0072927, CCR-0205376, CCR-0311512, and ONR grant N000140110967.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, S., Kurshan, R.P., Sabnani, K.: A calculus for protocol specification and validation. Protocol Specification, Testing and Verification, III (1983)

    Google Scholar 

  2. Basu, S., Narayan Kumar, K., Pokorny, L.R., Ramakrishnan, C.R.: Resourceconstrained model checking of recursive programs. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, p. 236. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Basu, S., Mukund, M., Ramakrishnan, C.R., Ramakrishnan, I.V., Verma, R.M.: Local and symbolic bisimulation using tabled constraint logic programming. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, p. 166. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Bultan, T., Gerber, R., Pugh, W.: Symbolic model checking of infinite state systems using presburger arithmetic. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254. Springer, Heidelberg (1997)

    Google Scholar 

  5. Chan, W., Anderson, R.J., Beame, P., Notkin, D.: Combining constraint solving and symbolic model checking for a class of systems with non-linear constraints. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254. Springer, Heidelberg (1997)

    Google Scholar 

  6. Delzanno, G., Podelski, A.: Model checking in CLP. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, p. 223. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Du, X., Ramakrishnan, C.R., Smolka, S.A.: Tabled resolution + constraints: A recipe for model checking real-time systems. In: RTTS (2000)

    Google Scholar 

  8. Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254. Springer, Heidelberg (1997)

    Google Scholar 

  9. Hennessy, M., Lin, H.: Symbolic bisimulations. Theoretical Computer Science 138, 353–389 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Norris Ip, C., Dill, D.L.: Better verification through symmetry. FMSD (1996)

    Google Scholar 

  11. Jaffar, J., Lassez, J.-L.: Constraint logic programming. In: POPL (1987)

    Google Scholar 

  12. Jonsson, B., Parrow, J.: Deciding bisimulation equivalences for a class of nonfinite- state programs. Information and Computation 107(2) (December 1993)

    Google Scholar 

  13. Lazić, R.S.: A Semantic Study of Data Independence with Applications to Model Checking. PhD thesis, Oxford University (1999)

    Google Scholar 

  14. Lin, H.: Symbolic transition graphs with assignments. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119. Springer, Heidelberg (1996)

    Google Scholar 

  15. Lin, H.: Model checking value-passing processes. In: APSEC (2001)

    Google Scholar 

  16. Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1984)

    MATH  Google Scholar 

  17. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems. Springer, Heidelberg (1992)

    Google Scholar 

  18. Namjoshi, K.S., Kurshan, R.P.: Syntactic program transformations for automatic abstractions. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)

    Google Scholar 

  19. Pemmasani, G., Ramakrishnan, C.R., Ramakrishnan, I.V.: Efficient model checking of real time systems using tabled logic programming and constraints. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, p. 100. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Pnueli, A., Kesten, Y., Vardi, M.: Yes, Matilda! Abstraction can Replace Deduction, even for Computational Models which are BAD (Buchi Automata with Data). In: VHS Meeting, Grenoble (1999)

    Google Scholar 

  21. Robert Pokorny, L., Ramakrishnan, C.R.: Model checking linear temporal logic using tabled logic programming. In: TAPD (2000)

    Google Scholar 

  22. Ramakrishnan, C.R., Sekar, R.: Model-based analysis of configuration vulnerabilities. Journal of Computer Security (JCS) 10(1 / 2), 189–209 (2002)

    Google Scholar 

  23. Ramakrishnan, C.R., Ramakrishnan, I.V., Smolka, S.A., et al.: XMC: A logicprogramming- based verification toolset. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  24. Rodeh, Y., Shtrichman, O.: Finite instantiations in equivalence logic with uninterpreted functions. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, p. 144. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  25. Roychoudhury, A., Ramakrishnan, C.R., Ramakrishnan, I.V.: Justifying proofs using memo tables. In: PPDP (2000)

    Google Scholar 

  26. Tamaki, H., Sato, T.: OLDT resolution with tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol. 225. Springer, Heidelberg (1986)

    Google Scholar 

  27. Wolper, P.: Expressing interesting properties of programs in propositional temporal logic. In: POPL (1986)

    Google Scholar 

  28. Yang, P., Ramakrishnan, C.R., Smolka, S.A.: A logical encoding of the picalculus: Model checking mobile processes using tabled resolution. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol. 2575, pp. 116–131. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York at Stony Brook, Stony Brook, New York, 11794-4400, USA

    Beata Sarna-Starosta & C. R. Ramakrishnan

Authors
  1. Beata Sarna-Starosta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. R. Ramakrishnan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, National University of Singapore, Singapore

    Jin Song Dong

  2. University of York,  

    Jim Woodcock

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sarna-Starosta, B., Ramakrishnan, C.R. (2003). Constraint-Based Model Checking of Data-Independent Systems. In: Dong, J.S., Woodcock, J. (eds) Formal Methods and Software Engineering. ICFEM 2003. Lecture Notes in Computer Science, vol 2885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39893-6_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39893-6_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20461-9

  • Online ISBN: 978-3-540-39893-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation