Skip to main content
SpringerLink
Log in

Reachability as Derivability, Finite Countermodels and Verification

  • Conference paper
Automated Technology for Verification and Analysis (ATVA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6252))

Abstract

We propose a simple and efficient approach to the verification of parameterized and infinite state system. The approach is based on modeling the reachability relation between parameterized states as deducibility between suitable encodings of the states using formulae of first-order logic. To establish a safety property, namely the non-reachability of unsafe states, a finite model finder is used to generate a finite countermodel, thus providing the witness for non-deducibility. We show that under an appropriate encoding the combination of finite model finding and theorem proving provides us with a decision procedure for the safety of the lossy channel systems. We illustrate the approach by reporting on experiments verifying both alternating bit protocol (specified as a lossy channel system) and a number of parameterized cache coherence protocols specified by extended finite state machines. In these experiments, the finite model finder Mace4 is used.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127(2), 91–101 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. Caferra, R., Leitsch, A., Peltier, N.: Automated Model Building. Applied Logic Series, vol. 31. Kluwer, Dordrecht (2004)

    MATH  Google Scholar 

  3. Burrows, M., Abadi, M., Needham, R.: A logic of authentication. ACM Transactions on Computer Systems 8, 18–36 (1990)

    Article  MATH  Google Scholar 

  4. Cheng, K.-T., Krishnakumar, A.S.: Automatic generation of cunstional vectors using extended finite state machine model. ACM Transactions on Design Automation of Electronic Systems 1(1), 57–79 (1996)

    Article  Google Scholar 

  5. Courcelle, B.: On constructing obstruction sets of words. Bulletin of the EATCS (44), 178–185 (1991)

    MATH  Google Scholar 

  6. Delzanno, G.: Verification of consistency protocols via infinite-state symbolic model checking, a case study. In: Proc. of FORTE/PSTV, pp. 171–188 (2000)

    Google Scholar 

  7. Delzanno, G.: Constraint-based Verification of Parametrized Cache Coherence Protocols. Formal Methods in System Design 23(3), 257–301 (2003)

    Article  MATH  Google Scholar 

  8. Emerson, E.A., Kahlon, V.: Exact and efficient verification of parameterized cache coherence protocols. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol. 2860, pp. 247–262. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Esparza, J., Finkel, A., Mayr, R.: On the Verification of Broadcast Protocols. In: Proc. 14th IEEE Symp. Logic in Computer Science (LICS), pp. 352–359. IEEE CS Press, Los Alamitos (1999)

    Google Scholar 

  10. Fisher, M., Lisitsa, A.: Deductive Verification of Cache Coherence Protocols. In: Proceedings of the 3rd Workshop on Automated Verification of Critical Systems, AVoCS 2003, Southampton, UK, April 2-3, pp. 177–186 (2003), Technical Report DSSE-TR-2003-2

    Google Scholar 

  11. Fisher, M., Konev, B., Lisitsa, A.: Practical Infinite-state Verification with Temporal Reasoning. In: Verification of Infinite State Systems and Security. NATO Security through Science Series: Information and Communication, vol. 1. IOS Press, Amsterdam (January 2006)

    Google Scholar 

  12. Guttman, J.: Security Theorems via Model Theory, arXiv:0911.2036

    Google Scholar 

  13. Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2, 326–336 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lisitsa, A.: Verification via Countermodel Finding (2009), http://www.csc.liv.ac.uk/~alexei/countermodel

  15. Lisitsa, A.: Reachability as deducibility, finite countermodels and verification. In: Proceedings of AVOCS 2009, pp. 241–243 (2009)

    Google Scholar 

  16. Lisitsa, A., Nemytykh, A.: Reachability Analisys in Verification via Supercompilation. In: Proceedings of the Satellite Workshops of DTL 2007, Part 2, vol. 45, pp. 53–67. TUCS General Publication (June 2007)

    Google Scholar 

  17. McCune, W.: Prover9 and Mace4, http://www.cs.unm.edu/~mccune/mace4/

  18. Pong, F., Dubois, M.: Verification techniques for cache coherence protocols. ACM Computing Surveys 29(1), 82–126 (1997)

    Article  Google Scholar 

  19. Robinson, A., Voronkov, A. (eds.): Handbook of Automated Reasoning, vol. I, II. Elsevier/MIT Press (2001)

    Google Scholar 

  20. Roychoudhury, A., Ramakrishnan, I.V.: Inductively Verifying Invariant Properties of Parameterized Systems. Automated Software Engineering 11, 101–139 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, the University of Liverpool, Ashton Building, Ashton Street, Liverpool, L69 7ZF, U.K.

    Alexei Lisitsa

Authors
  1. Alexei Lisitsa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Paris, 75205, Paris, France

    Ahmed Bouajjani

  2. National University of Singapore, Republic of Singapore

    Wei-Ngan Chin

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lisitsa, A. (2010). Reachability as Derivability, Finite Countermodels and Verification. In: Bouajjani, A., Chin, WN. (eds) Automated Technology for Verification and Analysis. ATVA 2010. Lecture Notes in Computer Science, vol 6252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15643-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15643-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15642-7

  • Online ISBN: 978-3-642-15643-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation