Advanced chopping of sequential and concurrent programs

Authors:
Dennis Giffhorn
Affiliations:
Karlsruhe Institute of Technology, Karlsruhe, Germany
Venue:
Software Quality Control
Year:
2011

Citing 29
Cited 0

Interprocedural slicing using dependence graphs

ACM Transactions on Programming Languages and Systems (TOPLAS)
A new model of program dependences for reverse engineering

SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Precise interprocedural chopping

SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Static slicing of threaded programs

Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
An efficient algorithm for computing MHP information for concurrent Java programs

ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Slicing concurrent programs

Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Context-sensitive synchronization-sensitive analysis is undecidable

ACM Transactions on Programming Languages and Systems (TOPLAS)
Effective synchronization removal for Java

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Slicing concurrent java programs

ACM SIGPLAN Notices
On optimal slicing of parallel programs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Slicing Concurrent Programs - A Graph-Theoretical Approach

AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives

SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Dependence Analysis of Parallel and Distributed Programs and Its Applications

APDC '97 Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)
An Approach to Analyzing Dependency of Concurrent Programs

APAQS '00 Proceedings of the The First Asia-Pacific Conference on Quality Software (APAQS'00)
Slicing Concurrent Java Programs

IWPC '99 Proceedings of the 7th International Workshop on Program Comprehension
Evaluating Context-Sensitive Slicing and Chopping

ICSM '02 Proceedings of the International Conference on Software Maintenance (ICSM'02)
Design and Implementation of a Fine-Grained Software Inspection Tool

IEEE Transactions on Software Engineering
Context-sensitive slicing of concurrent programs

Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
An improved slicer for Java

Proceedings of the 5th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Towards Automatic Generation of Vulnerability-Based Signatures

SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Efficient path conditions in dependence graphs for software safety analysis

ACM Transactions on Software Engineering and Methodology (TOSEM)
Interprocedural slicing of multithreaded programs with applications to Java

ACM Transactions on Programming Languages and Systems (TOPLAS)
Scaling model checking of dataraces using dynamic information

Journal of Parallel and Distributed Computing
Empirical study of optimization techniques for massive slicing

ACM Transactions on Programming Languages and Systems (TOPLAS)
An approach for the maintenance of input validation

Information and Software Technology
Precise slicing of concurrent programs

Automated Software Engineering
Chopping Concurrent Programs

SCAM '09 Proceedings of the 2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation
Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs

International Journal of Information Security
Efficient computation of may-happen-in-parallel information for concurrent java programs

LCPC'05 Proceedings of the 18th international conference on Languages and Compilers for Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A chop for a source statement s and a target statement t reveals the program parts involved in conveying effects from s to t. While precise chopping algorithms for sequential programs are known, no chopping algorithm for concurrent programs has been reported at all. This work introduces six chopping algorithms for concurrent programs, which offer different degrees of precision, ranging from imprecise over context-sensitive to time-sensitive. Our evaluation on concurrent Java programs shows that context-sensitive and time-sensitive chopping reduces chop sizes significantly. We further present an extensive evaluation of chopping algorithms for sequential programs and describe a new, easy-to-implement chopping technique for sequential programs that computes fast and almost context-sensitive chops.