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

Hatcliff, John; Corbett, James C.; Dwyer, Matthew B.; Sokołowski, Stefan; Zheng, Hongjun

doi:10.1007/3-540-48294-6_1

Cited by 68 publications

(63 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that simulation, arguably more elegant as it is expressed within a very general framework, is in principle a strictly stronger correctness property since it requires observable nodes to execute in the same order, even if they operate on disjoint sets of variables. Hatcliff et al [5] provide a very detailed correctness proof but only consider the case where both executions terminate; for how to deal with non-termination, they refer to [4] which proposes a correctness property based on a variant of bisimulation but does not work out the details. The correctness results by Ranganath et al [9,10], cf.…”

Section: Discussionmentioning

confidence: 99%

“…in [4], that slicing based on ntscd → preserves observable behavior, in particular termination, provided the CFG is reducible (with or without a unique end node). To handle also irreducible CFGs (as is needed to model state charts), [10] proposed several notions of "order dependence", like dod → ("decisive") and wod → ("weak"), and proved that for an arbitrary CFG, slicing based on ntscd → and on dod → preserves observable behavior.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Slicing for modern program structures: a theory for eliminating irrelevant loops

Amtoft

2008

Information Processing Letters

View full text Add to dashboard Cite

Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, the slice program should have the same termination properties as the original program, but to keep the slices manageable, it might be preferable to slice away loops that do not affect the values of relevant variables. This paper provides the first theoretical foundation to reason about nontermination insensitive slicing without assuming the presence of a unique end node. A slice is required to be closed under data dependence and under a recently proposed variant of control dependence, called weak order dependence. This allows a simulation-based correctness proof for a correctness criterion stating that the observational behavior of the original program must be a prefix of the behavior of the slice program.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Slicing for modern program structures: a theory for eliminating irrelevant loops

Amtoft

2008

Information Processing Letters

View full text Add to dashboard Cite

show abstract

“…The sliced program is smaller than the original program and is functionally equivalent with respect to the slicing criterion. In this paper, we focus on works that use slicing as a program reduction tool for model checking as shown in Clarke et al (1999), Hatcliff et al (1999), and Millett and Teitelbaum (1998).…”

Section: Static Analysismentioning

confidence: 99%

Model checking programs

Visser

Havelund

Brat

et al. 2000

Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering

592

741

View full text Add to dashboard Cite

Abstract. The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers. In this paper we will attempt to give convincing arguments for why we believe it is time for the formal methods community to shift some of its attention towards the analysis of programs written in modern programming languages. In keeping with this philosophy we have developed a verification and testing environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing. Part of this work has consisted of building a new Java Virtual Machine that interprets Java bytecode. JPF uses state compression to handle big states, and partial order and symmetry reduction, slicing, abstraction, and runtime analysis techniques to reduce the state space. JPF has been applied to a real-time avionics operating system developed at Honeywell, illustrating an intricate error, and to a model of a spacecraft controller, illustrating the combination of abstraction, runtime analysis, and slicing with model checking.

show abstract

“…The program slicing library, directly or indirectly, requires various high level analyses such as escape analysis [4], monitor analysis, safe-lock analysis [5], and analyses to calculate and prune various dependences -intra-and inter-procedural data dependence, control [6] dependence, interference [7] dependence, ready dependence and synchronization dependence [5]. These high level analyses rely on low-level information such as object-flow information [8], call graph, and thread graph [4].…”

Section: Indus Java Program Slicermentioning

confidence: 99%

Kaveri: Delivering the Indus Java Program Slicer to Eclipse

Jayaraman

Ranganath

Hatcliff

2005

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. This tool paper describes a modular program slicer for Java built using the Indus program analysis framework along with it's Eclipse-based user interface called Kaveri. Indus provides a library of classes that enables users to quickly assemble a highly customized non-system dependence graph based inter-procedural program slicer capable of slicing concurrent Java programs. Kaveri is an Eclipse plugin that relies on the above library to deliver program slicing to the eclipse platform. Apart from the basic feature for generating program slices from within eclipse along with an intuitive UI to view the slice, the plugin also provides the capability for chasing various dependences in the application to understand the slice.

show abstract

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

Cited by 68 publications

References 7 publications

Slicing for modern program structures: a theory for eliminating irrelevant loops

Slicing for modern program structures: a theory for eliminating irrelevant loops

Model checking programs

Kaveri: Delivering the Indus Java Program Slicer to Eclipse

Contact Info

Product

Resources

About