Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint Systems, a program abstraction where termination is decidable (based on the size-change termination principle). We show that these programs also have a decida...

This paper presents a compiler based approach to automate test case generation. This approach relies on object oriented metrics to identify complex message method sequences in the program. In this approach the compiler compiles the code to generate a graphical model for the object oriented program based on System Dependence Graph. The SDG is augmented with other important information like contr...

This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity .The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the conelation between intuitive co...

In this paper we investigate the minimal-program complexity of several types of pseudo-recursive and pseudo-random sequences when the resources used for their computation are restricted. For several types of these sequences their minimal-progra m complexity increases enormously whenever the resources for their computation is restricted in any effective manner at all. In particular, it is shown ...