Refining data flow information using infeasible paths

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Refining data flow information using infeasible paths

Full text

Pdf (1.48 MB)

Source

Foundations of Software Engineering archive
Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering table of contents

Zurich, Switzerland

Pages: 361 - 377

Year of Publication: 1997

ISBN:3-540-63531-9

Also published in ...

Authors

Rastislav Bodík	Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA
Rajiv Gupta	Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA
Mary Lou Soffa	Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA

Sponsors

University of Zurich : University of Zurich
CEPIS : Council of European Professional Informatics Societies
SIGSOFT: ACM Special Interest Group on Software Engineering
Swiss Informaticians Society : Swiss Information Society

Publisher

Springer-Verlag New York, Inc. New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 88, Citation Count: 20

Additional Information:

references cited by index terms collaborative colleagues

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/267895.267921 What is a DOI?

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	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	2	Rastislav Bodík , Rajiv Gupta , Mary Lou Soffa, Interprocedural conditional branch elimination, Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, p.146-158, June 16-18, 1997, Las Vegas, Nevada, United States
	3	Evelyn Duesterwald , Rajiv Gupta , Mary Lou Soffa, Demand-driven computation of interprocedural data flow, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.37-48, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199461]
	4	Evelyn Duesterwald , Rajiv Gupta , Mary Lou Soffa, A demand-driven analyzer for data flow testing at the integration level, Proceedings of the 18th international conference on Software engineering, p.575-584, March 25-29, 1996, Berlin, Germany
	5	P. G. Frankl , E. J. Weyuker, An Applicable Family of Data Flow Testing Criteria, IEEE Transactions on Software Engineering, v.14 n.10, p.1483-1498, October 1988 [doi>10.1109/32.6194]
	6	Christopher W. Fraser , David R. Hanson, A Retargetable C Compiler: Design and Implementation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1995
	7	H.N. Gabow, S.N. Maheshwari, L.J. Osterweil, "On Two Problems in the Generation of Program Test Paths," IEEE nansactions on Software Engineering, Vol. SE2, No. 3, pages 227-231, September 1976.
	8	R. Gupta and P. Gopinath, "Correlation Analysis Techniques for Refining Execution Time Estimates of Real-Time Applications," 11th IEEE Workshop on Real-Time Operating Systems and Software, pages 5458, Seattle, Washington, May 1994.
	9	R. Gupta and M.L. Soffa, "Employing Static Information in the Generation of Test Cases," Journal of Software Testing, Verification and Reliability, Vol. 3, No. 1, pages 29-48, December 1993.
	10	Rajiv Gupta , Mary Lou Soffa, Hybrid slicing: an approach for refining static slices using dynamic information, Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering, p.29-40, October 12-15, 1995, Washington, D.C., United States
	11	R. Gupta, M.J. Harrold, and M.L. Soffa, 'An Approach to Regression Testing using Slicing," Conference on Software Maintenance, pages 299-308, Orlando, Florida, November 1992.
	12	Susan Horwitz , Thomas Reps , Mooly Sagiv, Demand interprocedural dataflow analysis, Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering, p.104-115, October 12-15, 1995, Washington, D.C., United States
	13	L.H. Holley and B.K. Rosen, "Qualified Data Flow Problems," IEEE Bansactions on Software Engineering, Vol. SE7, NO.1, January 1981
	14	J.R. Lyle and M. Weiser, "Automatic Program Bug Location by Program Slicing," Proc. Second IEEE Symposium on Computers and Applications, pages 877-883, June 1987.
	15	Frank Mueller , David B. Whalley, Avoiding conditional branches by code replication, ACM SIGPLAN Notices, v.30 n.6, p.56-66, June 1995
	16	H.S. Wang and S.R. Hsu, "A Generalized Optimal Path-Selection Model for Structural Program Testing," The Journal of Systems and Software, Vol. 10, pages 55-63, 1989.
	17	M. Weiser,"Program Slicing," IEEE Transactions on Software Engineering, Vol. SE-lo, No. 4, pages 352-357, July 1984.

CITED BY 20

	Trishul M. Chilimbi, Efficient representations and abstractions for quantifying and exploiting data reference locality, ACM SIGPLAN Notices, v.36 n.5, p.191-202, May 2001
	Rastislav Bodík , Rajiv Gupta , Mary Lou Soffa, Load-reuse analysis: design and evaluation, ACM SIGPLAN Notices, v.34 n.5, p.64-76, May 1999
	Thomas Ball , Sriram K. Rajamani, Bebop: a path-sensitive interprocedural dataflow engine, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.97-103, June 2001, Snowbird, Utah, United States
	Gleb Naumovich , Lori A. Clarke , Leon J. Osterweil, Efficient composite data flow analysis applied to concurrent programs, ACM SIGPLAN Notices, v.33 n.7, p.51-58, July 1998
	James R. Larus, Whole program paths, ACM SIGPLAN Notices, v.34 n.5, p.259-269, May 1999
	Glenn Ammons , James R. Larus, Improving data-flow analysis with path profiles, ACM SIGPLAN Notices, v.33 n.5, p.72-84, May 1998
	Atanas Rountev , Scott Kagan , Michael Gibas, Static and dynamic analysis of call chains in java, ACM SIGSOFT Software Engineering Notes, v.29 n.4, July 2004
	Thomas A. Henzinger , Ranjit Jhala , Rupak Majumdar , Kenneth L. McMillan, Abstractions from proofs, ACM SIGPLAN Notices, v.39 n.1, p.232-244, January 2004
	Glenn Ammons , James R. Larus, Improving data-flow analysis with path profiles, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Chen Fu , Ana Milanova , Barbara Gershon Ryder , David G. Wonnacott, Robustness Testing of Java Server Applications, IEEE Transactions on Software Engineering, v.31 n.4, p.292-311, April 2005
	Chen Fu , Barbara G. Ryder , Ana Milanova , David Wonnacott, Testing of java web services for robustness, ACM SIGSOFT Software Engineering Notes, v.29 n.4, July 2004
	Jeffrey Fischer , Ranjit Jhala , Rupak Majumdar, Joining dataflow with predicates, ACM SIGSOFT Software Engineering Notes, v.30 n.5, September 2005
	Wei Le , Mary Lou Soffa, Refining buffer overflow detection via demand-driven path-sensitive analysis, Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.63-68, June 13-14, 2007, San Diego, California, USA
	Xavier Rival , Laurent Mauborgne, The trace partitioning abstract domain, ACM Transactions on Programming Languages and Systems (TOPLAS), v.29 n.5, p.26-es, August 2007
	Christian Hammer , Rüdiger Schaade , Gregor Snelting, Static path conditions for Java, Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security, June 07-13, 2008, Tucson, AZ, USA
	Wei Le , Mary Lou Soffa, Marple: a demand-driven path-sensitive buffer overflow detector, Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering, November 09-14, 2008, Atlanta, Georgia
	Minh Ngoc Ngo , Hee Beng Kuan Tan, Detecting large number of infeasible paths through recognizing their patterns, Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, September 03-07, 2007, Dubrovnik, Croatia
	Aditya Thakur , R. Govindarajan, Comprehensive path-sensitive data-flow analysis, Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization, April 05-09, 2008, Boston, MA, USA
	Minh Ngoc Ngo , Hee Beng Kuan Tan, Heuristics-based infeasible path detection for dynamic test data generation, Information and Software Technology, v.50 n.7-8, p.641-655, June, 2008
	Weilei Zhang , Barbara G. Ryder, Automatic construction of accurate application call graph with library call abstraction for Java: Research Articles, Journal of Software Maintenance and Evolution: Research and Practice, v.19 n.4, p.231-252, July 2007