Skip to main content

Using Runtime Analysis to Guide Model Checking of Java Programs

  • Conference paper
SPIN Model Checking and Software Verification (SPIN 2000)

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

Included in the following conference series:

Abstract

This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java programs. Runtime analysis is based on the idea of executing the program once, and observing the generated run to extract various kinds of information. This information can then be used to predict whether other different runs may violate some properties of interest, in addition of course to demonstrate whether the generated run itself violates such properties. These runtime analyses can be performed stand-alone to generate a set of warnings. It is furthermore demonstrated how these warnings can be used to guide a model checker, thereby reducing the search space. The described techniques have been implemented in the home grown Java model checker called Java PathFinder.

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

Access this chapter

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. Bensalem, S., Ganesh, V., Lakhnech, Y., Mu~noz, C., Owre, S., Rueß, H., Rushby, J., Rusu, V., Saïdi, H., Shankar, N., Singerman, E., Tiwari, A.: An Overview of SAL. In: Proceedings of the 5th NASA Langley Formal Methods Workshop (June 2000)

    Google Scholar 

  2. 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, pp. 319–331. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Bruening, D.L.: Systematic Testing of Multithreaded Java Programs. Master’s thesis, MIT (1999)

    Google Scholar 

  4. Cattel, T.: Modeling and Verification of sC++ Applications. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, p. 232. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Corbett, J.: Constructing Compact Models of Concurrent Java Programs. In: Proceedings of the ACM Sigsoft Symposium on Software Testing and Analysis, Clearwater Beach, Florida (1998)

    Google Scholar 

  6. Corbett, J., Dwyer, M., Hatcliff, J., Pasareanu, C., Robby, Laubach, S., Zheng, H.: Bandera: Extracting Finite-state Models from Java Source Code. In: Proceedings of the 22nd International Conference on Software Engineering, Limerich, Ireland, June 2000. ACM Press, New York (2000)

    Google Scholar 

  7. Cousot, P., Cousot, R.: Abstract Interpretation Frameworks. Journal of Logic and Computation 4(2), 511–547 (1992)

    Article  MathSciNet  Google Scholar 

  8. Das, S., Dill, D., Park, S.: Experience with Predicate Abstraction. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 160–171. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Demartini, C., Iosif, R., Sist, R.: A Deadlock Detection Tool for Concurrent Java Programs. Software Practice and Experience 29(7), 577–603 (1999)

    Article  Google Scholar 

  10. Detlefs, D.L., Leino, K.R.M., Nelson, G., Saxe, J.B.: Extended Static Checking. Technical Report 159, Compaq Systems Research Center, Palo Alto, California, USA (1998)

    Google Scholar 

  11. Godefroid, P.: Model Checking for Programming Languages using VeriSoft. In: Proceedings of the 24th ACM Symposium on Principles of Programming Languages, Paris, January 1997, pp. 174–186 (1997)

    Google Scholar 

  12. Gosling, J., Joy, B., Steele, G.: The Java Language Specification. Addison Wesley, Reading (1996)

    MATH  Google Scholar 

  13. Graf, S., Saidi, H.: Construction of Abstract State Graphs with PVS. In: CAV 1997: 6th International Conference on Computer Aided Verification. LNCS, vol. 1254 (1997)

    Google Scholar 

  14. Hatcliff, J., Corbett, J.C., Dwyer, M.B., Sokolowski, S., Zheng, H.: A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives. In: Proc. of the 1999 Int. Symposium on Static Analysis (1999)

    Google Scholar 

  15. Havelund, K., Lowry, M., Park, S., Pecheur, C., Penix, J., Visser, W., White, J.: Formal Analysis of the Remote Agent Before and After Flight. In: Proceedings of the 5th NASA Langley Formal Methods Workshop (June 2000)

    Google Scholar 

  16. Havelund, K., Lowry, M., Penix, J.: Formal Analysis of a Space Craft Controller using SPIN. In: Proceedings of the 4th SPIN workshop, Paris, France (November 1998); To appear in IEEE Transactions of Software Engineering

    Google Scholar 

  17. Havelund, K., Pressburger, T.: Model Checking Java Programs using Java Path- Finder. International Journal on Software Tools for Technology Transfer (STTT) 2(4), 366–381 (2000), Special issue of STTT containing selected submissions to the 4th SPIN workshop, Paris, France (1998)

    Article  MATH  Google Scholar 

  18. Havelund, K., Shankar, N.: Experiments in Theorem Proving and Model Checking for Protocol Verification. In: Gaudel, M.-C., Woodcock, J.C.P. (eds.) FME 1996. LNCS, vol. 1051, pp. 662–681. Springer, Heidelberg (1996)

    Google Scholar 

  19. Havelund, K., Skakkebæk, J.: Applying Model Checking in Java Verification. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) SPIN 1999. LNCS, vol. 1680, p. 216. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  20. Holzmann, G., Smith, M.: A Practical Method for Verifying Event-Driven Software. In: Proc. ICSE 1999, International Conference on Software Engineering, Los Angeles, May 1999, IEEE/ACM (1999)

    Google Scholar 

  21. Holzmann, G.J.: The Model Checker Spin. IEEE Trans. on Software Engineering 23(5), 279–295 (1997), Special issue on Formal Methods in Software Practice

    Article  MathSciNet  Google Scholar 

  22. Iosif, R., Demartini, C., Sisto., R.: Modeling and Validation of JAVA Multithreaded Applications using SPIN. In: Proceedings of the Fourth Workshop on the SPIN Verification System, Paris (November 1998)

    Google Scholar 

  23. JavaClass., http://www.inf.fu-berlin.de/~dahm/JavaClass

  24. Muscettola, N., Nayak, P., Pell, B., Williams, B.: Remote Agent: To Boldly Go Where No AI System Has Gone Before. Artificial Intelligence 103(1-2), 5–48 (1998)

    Article  MATH  Google Scholar 

  25. Park, D., Stern, U., Dill, D.: Java Model Checking. In: Proc. of the First International Workshop on Automated Program Analysis, Testing and Verification, Limerick, Ireland (June 2000)

    Google Scholar 

  26. Savage, S., Burrows, M., Nelson, G., Sobalvarro, P.: Eraser: A Dynamic Data Race Detector for Multithreaded Programs. ACM Transactions on Computer Systems 15(4), 391–411 (1997)

    Article  Google Scholar 

  27. Visual Threads., http://www.unix.digital.com/visualthreads/index.html

  28. Assure., http://www.kai.com/assurej

  29. Visser, W., Havelund, K., Brat, G., Park, S.: Java PathFinder - Second Generation of a Java Model Checker. In: Proc. of Post-CAV Workshop on Advances in Verification, Chicago (July 2000)

    Google Scholar 

  30. Visser, W., Havelund, K., Brat, G., Park, S.: Model Checking Programs. In: Proc. of ASE 2000: The 15th IEEE International Conference on Automated Software Engineering, September 2000. IEEE CS Press, Los Alamitos (2000)

    Google Scholar 

  31. Visser, W., Park, S., Penix, J.: Using Predicate Abstraction to Reduce Object- Oriented Programs for Model Checking. In: Proceedings of the 3rd ACM SIGSOFT Workshop on Formal Methods in Software Practice (August 2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Havelund, K. (2000). Using Runtime Analysis to Guide Model Checking of Java Programs. In: Havelund, K., Penix, J., Visser, W. (eds) SPIN Model Checking and Software Verification. SPIN 2000. Lecture Notes in Computer Science, vol 1885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722468_15

Download citation

  • DOI: https://doi.org/10.1007/10722468_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41030-0

  • Online ISBN: 978-3-540-45297-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics