[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives

  • Conference paper
  • First Online:
Static Analysis (SAS 1999)

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

Included in the following conference series:

Abstract

Previous work has shown that program slicing can be a useful step in model-checking software systems. We are interested in applying these techniques to construct models of multi-threaded Java programs. Past work does not address the concurrency primitives found in Java, nor does it provide the rigorous notions of slice correctness that are necessary for reasoning about programs with non-deterministic behaviour and potentially infinite computation traces.

In this paper, we define the semantics of a simple multi-threaded language with concurrency primitives matching those found in the Java Virtual Machine, we propose a bisimulation-based notion of correctness for slicing in this setting, we identify notions of dependency that are relevant for slicing multi-threaded Java programs, and we use these dependencies to specify a program slicer for the language presented in the paper. Finally, we discuss how these dependencies can be refined to take into account common programming idioms of concurrent Java software.

This work supported in part by NSF under grants CCR-9633388, CCR-9703094, CCR-9708184, and CCR-9701418 and DARPA/NASA under grant NAG 21209.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. Jingde Cheng. Slicing concurrent programs–a graph-theoretical approach. In Proceedings of the First International Workshop on Automated and Algoritmic Debugging, number 749 in LNCS, pages 223–240, 1993.

    Chapter  Google Scholar 

  2. E.M. Clarke, M. Fujita, S.P. Rajan, T. Reps, S. Shankar, and T. Teitelbaum. Program slicing for design automation: An automatic technique for speeding-up hardware design, simulation, testing, and verification. Technical report, 1999.

    Google Scholar 

  3. Matthew Dwyer and John Hatcliff. Slicing software for model construction. In Olivier Danvy, editor, Proceedings of the 1999 ACM Workshop on Partial Evaluation and Program Manipulation (PEPM’99), January 1999. BRICS Notes Series NS-99-1.

    Google Scholar 

  4. Matthew B. Dwyer, James C. Corbett, John Hatcliff, Stefan Sokolowski, and Hongjun Zheng. Slicing multi-threaded java programs: A case study. Technical Report 99-7, Kansas State University, Department of Computing and Information Sciences, March 1999.

    Google Scholar 

  5. G.J. Holzmann. The model checker spin. IEEE Transactions on Software Engineering, 23(5):279–294, May 1997.

    Article  MathSciNet  Google Scholar 

  6. Lynette I. Millett and Tim Teitelbaum. Slicing promela and its applications to model checking, simulation, and protocol understanding. In Proceedings of the 4th International SPIN Workshop, 1998.

    Google Scholar 

  7. Jens Krinke. Static slicing of threaded programs. In Proc. ACM SIG-PLAN/SIGFSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE’98), pages 35–42, 1998.

    Google Scholar 

  8. Tim Lindholm and Frank Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1997.

    Google Scholar 

  9. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.

    Google Scholar 

  10. Robin Milner. Communication and Concurrecy. Prentice Hall, 1989.

    Google Scholar 

  11. S.S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers, 1997.

    Google Scholar 

  12. F. Tip. A survey of program slicing techniques. Journal of programming languages, 3:121–189, 1995.

    Google Scholar 

  13. Mark Weiser. Program slicing. IEEE Transaction on Software Engineering, 1984.

    Google Scholar 

  14. Jianjun Zhao. Slicing concurrent java programs. In Proceedings of the Seventh IEEE International Workshop on Program Comprehension, pages 126–133, may 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hatcliff, J., Corbett, J., Dwyer, M., Sokolowski, S., Zheng, H. (1999). A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives. In: Cortesi, A., Filé, G. (eds) Static Analysis. SAS 1999. Lecture Notes in Computer Science, vol 1694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48294-6_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-48294-6_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66459-8

  • Online ISBN: 978-3-540-48294-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics