Slicing concurrent java programs

Authors:
Zhenqiang Chen;Baowen Xu
Affiliations:
Department of Computer Science & Engineering, Southeast University, Nanjing 210096, China;State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, China
Venue:
ACM SIGPLAN Notices
Year:
2001

Citing 0
Cited 14

Detecting concurrently executed pairs of statements using an adapted MHP algorithm

Proceedings of the 2001 annual ACM SIGAda international conference on Ada
Dependence analysis for recursive java programs

ACM SIGPLAN Notices
An overview of methods for dependence analysis of concurrent programs

ACM SIGPLAN Notices
Detecting Deadlock in Ada Rendezvous Flow Structure Based on Process Algebra

ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Static Dependency Analysis for Concurrent Ada 95 Programs

Ada-Europe '02 Proceedings of the 7th Ada-Europe International Conference on Reliable Software Technologies
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
A brief survey of program slicing

ACM SIGSOFT Software Engineering Notes
Interprocedural slicing of multithreaded programs with applications to Java

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed dynamic slicing of Java programs

Journal of Systems and Software
Precise slicing of concurrent programs

Automated Software Engineering
Computing dynamic slices of concurrent object-oriented programs

Information and Software Technology
Advanced chopping of sequential and concurrent programs

Software Quality Control
A new approach for concurrent program slicing

FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A novel approach for dynamic slicing of distributed object-oriented programs

ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program slicing is an important approach to testing, understanding and maintaining programs. The paper presents a slicing algorithm for concurrent Java programs. Because the execution process of concurrent programs is unpredictable, there are many problems to be solved when slicing. To slice concurrent Java programs, we present concurrent control flow graphs and concurrent program dependence graphs to representconcurrent Java programs. Based on these models, we design an efficient static slicing algorithm for concurrent Java programs. The algorithm may get more precise slices than previous approaches we know.