A framework for generalized control dependence

1996 ◽  
Author(s):  
Gianfranco Bilardi ◽  
Keshav Pingali
Keyword(s):  
Control Dependence

A framework for generalized control dependence

1996 ◽  
Vol 31 (5) ◽  
pp. 291-300 ◽  
Author(s):  
Gianfranco Bilardi ◽  
Keshav Pingali
Keyword(s):  
Control Dependence

scholarly journals On the computational complexity of dynamic slicing problems for program schemas

2011 ◽  
Vol 21 (6) ◽  
pp. 1339-1362 ◽  
Author(s):  
SEBASTIAN DANICIC ◽  
ROBERT. M. HIERONS ◽  
MICHAEL R. LAURENCE
Keyword(s):  
Computational Complexity ◽  
Structural Properties ◽  
Program Slicing ◽  
Np Hard ◽  
Complexity Bounds ◽  
Dynamic Slicing ◽  
Original Program ◽  
Control Dependence ◽  
Definition Of ◽  
Restrictive Definition

Given a program, a quotient can be obtained from it by deleting zero or more statements. The field of program slicing is concerned with computing a quotient of a program that preserves part of the behaviour of the original program. All program slicing algorithms take account of the structural properties of a program, such as control dependence and data dependence, rather than the semantics of its functions and predicates, and thus work, in effect, with program schemas. The dynamic slicing criterion of Korel and Laski requires only that program behaviour is preserved in cases where the original program follows a particular path, and that the slice/quotient follows this path. In this paper we formalise Korel and Laski's definition of a dynamic slice as applied to linear schemas, and also formulate a less restrictive definition in which the path through the original program need not be preserved by the slice. The less restrictive definition has the benefit of leading to smaller slices. For both definitions, we compute complexity bounds for the problems of establishing whether a given slice of a linear schema is a dynamic slice and whether a linear schema has a non-trivial dynamic slice, and prove that the latter problem is NP-hard in both cases. We also give an example to prove that minimal dynamic slices (whether or not they preserve the original path) need not be unique.

scholarly journals Computation of interprocedural control dependence

1998 ◽  
Vol 23 (2) ◽  
pp. 11-20 ◽  
Author(s):  
Mary Jean Harrold ◽  
Gregg Rothermel ◽  
Saurabh Sinha
Keyword(s):  
Control Dependence

Mathematical model of management of recirculation of motor aggregates

2017 ◽  
Vol 12 (2) ◽  
pp. 25-35 ◽  
Author(s):  
A. E. Abbasov
Keyword(s):  
Mathematical Model ◽  
Combustion Temperature ◽  
Three Dimensional ◽  
Motor Units ◽  
Toxic Substances ◽  
Model Of Management ◽  
Calculation Results ◽  
Control Dependence ◽  
Maximum Combustion Temperature ◽  
The Mathematical Model

A mathematical model of management of recirculation of motor units is developed. It is shown that the efficiency of recirculation control is achieved with a decrease in the content of toxic substances in the exhaust; Limiting the maximum combustion temperature of the fuel and the pressure in the combustion chamber; Speed control. Based on the mathematical model, an algorithm is developed for calculating the control dependence for the regulation of the position of the electromechanical recirculation valve in specialized graphic computer environments with three-dimensional and two-dimensional visualization of analysis and calculation results. Calculation of the amount of emissions of harmful substances without the developed algorithm and using the developed algorithm is carried out.

Sign in / Sign up

Export Citation Format

Share Document