Program slicing can be effectively used to debug, test, analyze, understand and maintain object-oriented software. In this paper, a new slicing model is proposed to slice Java programs based on their inherent hierarchical feature. The main idea of hierarchical slicing is to slice programs in stepwise way, from package level, to class level, method level, and finally up to statement level. Stepw...

The topic of this PhD thesis is the stepwise refinement of distributed algorithms. Stepwise refinement starts with a simple algorithm with certain desired properties. This algorithm is refined step by step such that the desired properties are preserved in each refinement step. The result is a complex distributed algorithm which satisfies concrete implementation requirements and which still has ...

For a given target node T and a given depth k ≥ 1, we propose an algorithm for discovering a local causal network around the target T to depth k. In our algorithm, we find parents, children and some descendants (PCD) of nodes stepwise away from the target T until all edges within the depth k local network cannot be oriented further. Our algorithm extends the PCD-by-PCD algorithm for prediction ...

We present a new structuring and veri cation method for distributed algo rithms The basic idea is that an algorithm to be veri ed is stepwise transformed into a high level speci cation through a number of steps so called coarsements At each step some mechanism of the algorithm is identi ed and removed while the basic computation of the original algorithm is preserved Only the essential parts of...

In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...

We present a structuring and verification method for distributed algorithms. The basic idea is that an algorithm to be verified is stepwise transformed into a high level specification through a number of steps, so-called coarsenings. At each step some mechanism of the algorithm is identified and removed while the basic computation of the original algorithm is preserved. Only the essential parts...