Static slicing of threaded programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Static slicing of threaded programs

Full text

Pdf (876 KB)

Source

Workshop on Program Analysis for Software Tools and Engineering archive
Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering table of contents

Montreal, Quebec, Canada

Pages: 35 - 42

Year of Publication: 1998

ISBN:1-58113-055-4

Also published in ...

Author

Jens Krinke

TU Braunschweig, Abteilung Softwaretechnologie

Sponsors

SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 64, Citation Count: 18

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/277631.277638 What is a DOI?

ABSTRACT

Static program slicing is an established method for analyzing sequential programs, especially for program understanding, debugging and testing. Until now, there was no slicing method for threaded programs which handles interference correctly. We present such a method which also calculates more precise static slices. This paper extends the well known structures of the control flow graph and the program dependencc graph for threaded programs with interference. This new technique does not require serialization of threaded programs.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Jingde Cheng, Slicing Concurrent Programs - A Graph-Theoretical Approach, Proceedings of the First International Workshop on Automated and Algorithmic Debugging, p.223-240, May 03-05, 1993
	2	Jingde Cheng, Dependence Analysis of Parallel and Distributed Programs and Its Applications, Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), p.370, March 19-21, 1997
	3	Jong-Deok Choi , Barton P. Miller , Robert H. B. Netzer, Techniques for debugging parallel programs with flowback analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.4, p.491-530, Oct. 1991 [doi>10.1145/115372.115324]
	4	Evelyn Duesterwald , Rajiv Gupta , Mary Lou Soffa, Distributed Slicing and Partial Re-execution for Distributed Programs, Proceedings of the 5th International Workshop on Languages and Compilers for Parallel Computing, p.497-511, August 03-05, 1992
	5	Jeanne Ferrante , Karl J. Ottenstein , Joe D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.3, p.319-349, July 1987 [doi>10.1145/24039.24041]
	6	M. Goldapp, U. Grottker, and G. Snelting. Validierung softwaregesteuerter Meljsysteme durch Program Slicing und Constraint Solving. In Statusseminar des BMBF Sojiiaretechnologie, Berlin, 1996.
	7	Susan Horwitz , Thomas Reps , David Binkley, Interprocedural slicing using dependence graphs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.1, p.26-60, Jan. 1990 [doi>10.1145/77606.77608]
	8	Jens Knoop , Bernhard Steffen , Jürgen Vollmer, Parallelism for free: efficient and optimal bitvector analyses for parallel programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.3, p.268-299, May 1996 [doi>10.1145/229542.229545]
	9	B. Korel and R. Ferguson. Dynamic slicing of distributed programs. Applied Mathematics and Computer Science, 2, 1992.
	10	B. Korel , J. Laski, Dynamic program slicing, Information Processing Letters, v.29 n.3, p.155-163, October 26, 1988 [doi>10.1016/0020-0190(88)90054-3 ]
	11	Loren Larsen , Mary Jean Harrold, Slicing object-oriented software, Proceedings of the 18th international conference on Software engineering, p.495-505, March 25-29, 1996, Berlin, Germany
	12	Charles E. McDowell , David P. Helmbold, Debugging concurrent programs, ACM Computing Surveys (CSUR), v.21 n.4, p.593-622, Dec. 1989 [doi>10.1145/76894.76897]
	13	B. P. Miller , Jong-Deok Choi, A mechanism for efficient debugging of parallel programs, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.135-144, June 20-24, 1988, Atlanta, Georgia, United States
	14	Karl J. Ottenstein , Linda M. Ottenstein, The program dependence graph in a software development environment, Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments, p.177-184, April 1984
	15	Vivek Sarkar , Barbara Simons, Parallel Program Graphs and their Classification, Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, p.633-655, August 12-14, 1993
	16	Gregor Snelting, Combining Slicing and Constraint Solving for Validation of Measurement Software, Proceedings of the Third International Symposium on Static Analysis, p.332-348, September 24-26, 1996
	17	F. Tip. A survey of program slicing techniques. Journal qf Programming Languages, 3(3), 1995.
	18	N. Uchihira, S. Honiden, and T. Seki. Hypersequential programming. IEEE Concurrency, July-September 1997.
	19	M. Weiser. Program slicing. IEEE Transactions on Softwure Engineering, 10(4), 1984.
	20	Jianjun Zhao , Jingde Cheng , Kazuo Ushijim, Static Slicing of Concurrent Object-Oriented Programs, Proceedings of the 20th Conference on Computer Software and Applications, p.312, August 19-23, 1996

CITED BY 18

	S. Ramesh , A. Kulkarni , V. Kamat, Slicing tools for synchronous reactive programs, ACM SIGSOFT Software Engineering Notes, v.29 n.4, July 2004
	Matthew Allen , Susan Horwitz, Slicing java programs that throw and catch exceptions, ACM SIGPLAN Notices, v.38 n.10, p.44-54, October 2003
	Zhenqiang Chen , Baowen Xu , Huiming Yu, Detecting concurrently executed pairs of statements using an adapted MHP algorithm, ACM SIGAda Ada Letters, v.XXI n.4, December 2001
	Mangala Gowri Nanda , S. Ramesh, Slicing concurrent programs, ACM SIGSOFT Software Engineering Notes, v.25 n.5, p.180-190, Sept. 2000
	Gleb Naumovich , George S. Avrunin , Lori A. Clarke, An efficient algorithm for computing MHP information for concurrent Java programs, ACM SIGSOFT Software Engineering Notes, v.24 n.6, p.338-354, Nov. 1999
	Jong-Deok Choi , Andreas Zeller, Isolating failure-inducing thread schedules, ACM SIGSOFT Software Engineering Notes, v.27 n.4, July 2002
	Shivali Agarwal , Rajkishore Barik , Vivek Sarkar , Rudrapatna K. Shyamasundar, May-happen-in-parallel analysis of X10 programs, Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming, March 14-17, 2007, San Jose, California, USA
	Jeffry T Russell, Program slicing for codesign, Proceedings of the tenth international symposium on Hardware/software codesign, May 06-08, 2002, Estes Park, Colorado
	Mangala Gowri Nanda , Satish Chandra , Vivek Sarkar, Decentralizing execution of composite web services, ACM SIGPLAN Notices, v.39 n.10, October 2004
	Zhenqiang Chen , Baowen Xu , Jianjun Zhao, An overview of methods for dependence analysis of concurrent programs, ACM SIGPLAN Notices, v.37 n.8, August 2002
	Jens Krinke, Context-sensitive slicing of concurrent programs, ACM SIGSOFT Software Engineering Notes, v.28 n.5, September 2003
	Venkatesh Prasad Ranganath , Torben Amtoft , Anindya Banerjee , John Hatcliff , Matthew B. Dwyer, A new foundation for control dependence and slicing for modern program structures, ACM Transactions on Programming Languages and Systems (TOPLAS), v.29 n.5, p.27-es, August 2007
	Markus Müller-Olm , Helmut Seidl, On optimal slicing of parallel programs, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.647-656, July 2001, Hersonissos, Greece
	Mangala Gowri Nanda , S. Ramesh, Interprocedural slicing of multithreaded programs with applications to Java, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.6, p.1088-1144, November 2006
	Susan Horwitz , Thomas Reps , David Binkley, Interprocedural slicing using dependence graphs, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Gregor Snelting , Torsten Robschink , Jens Krinke, Efficient path conditions in dependence graphs for software safety analysis, ACM Transactions on Software Engineering and Methodology (TOSEM), v.15 n.4, p.410-457, October 2006
	Hon F. Li , Juergen Rilling , Dhrubajyoti Goswami, Granularity-Driven Dynamic Predicate Slicing Algorithms for Message Passing Systems, Automated Software Engineering, v.11 n.1, p.63-89, January 2004
	Baowen Xu , Ju Qian , Xiaofang Zhang , Zhongqiang Wu , Lin Chen, A brief survey of program slicing, ACM SIGSOFT Software Engineering Notes, v.30 n.2, March 2005