Skip to main content

Using Garbage Collection in Model Checking

  • Conference paper

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

Abstract

Garbage collection techniques have become common-place in actual programming environments, helping programmers to avoid memory fragmentation and invalid referencing problems. In order to efficiently model check programs that use garbage collection, similar functionalities have to be embedded in model checkers. This paper focuses on the implementation of two classic garbage collection algorithms in dSPIN, an extension of the model checker SPIN which supports dynamic memory management. Experiments carried out show that, besides making a large class of programs tractable, garbage collection can also be a mean to reduce the number of states generated by our model checking tool.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Appel, A.W.: Modern Compiler Implementation in Java. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  2. Corbett, J.: Constructing Compact Models of Concurrent Java Programs. In: Proc. of International Symposium on Software Testing and Analysis (1998)

    Google Scholar 

  3. Corbett, J., Dwyer, M.B., et al.: Bandera: Extracting Finite-state Models from Java Source Code. In: Proc. 22nd International Conference on Software Engineering, pp. 439–448 (2000)

    Google Scholar 

  4. Demartini, C., Iosif, R., Sisto, R.: A deadlock detection tool for concurrent Java programs. Software. Practice & Experience 29(7), 577–603 (1999)

    Article  Google Scholar 

  5. Demartini, C., Iosif, R., Sisto, R.: dSPIN: A Dynamic Extension of SPIN. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) SPIN 1999. LNCS, vol. 1680, pp. 261–276. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Brat, G., Havelund, K., Park, S., Visser, W.: Java PathFinder: Second Generation of a Java Model Checker. In: Workshop on Advances in Verification (2000)

    Google Scholar 

  7. Holzmann, G.: The Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs (1991)

    Google Scholar 

  8. Iosif, R.: The dSPIN User Manual, http://www.dai-arc.polito.it/dai-arc/auto/tools/tool7.shtml

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

Iosif, R., Sisto, R. (2000). Using Garbage Collection in Model Checking. 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_2

Download citation

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

  • 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