We show how the complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalized versions of them, and feeding the result to existing tools for the complexity analysis of first-order term rewrite systems. This is done while carefully analysing complexity preservation and reflection of the employed transformations such that th...

With the expansion of software system scale, study complexity has become a hot topic in engineering. However, domestic research on analysis technology is not mature, especially measurement and evaluation methods are perfect. In order to solve problem prediction program structure engineering more effectively, this paper proposed technique based OINK framework. The uses data sharing interface des...

Identifying high cognitive complexity modules can lead to a better quality software system and can help during maintenance also. It has been found that inheritance has an impact on cognitive complexity of a software system. In this paper, two inheritance metrics based on cognitive complexity, one at class level CCI (Class Complexity due to Inheritance) and another at program level ACI (Average ...

Object-oriented paradigm is built on the notion of real world entities. This paradigm has received higher acceptability among the programming community. This is because the programs written using an object-oriented language are easier to comprehend as compared to the procedural programs. Hence this paper makes an attempt to apply Cognitive Information Complexity Measure (CICM) on object-oriente...

We consider an extension QPDL of Segerberg-Pratt’s Propositional Dynamic Logic PDL, with program quantification, and study its expressive power and complexity. A mild form of program quantification is obtained in the calculus μPDL, extending PDL with recursive procedures (i.e. context free programs), which is known to be Π 1 -complete. The unrestricted program quantification we consider leads t...

Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [16]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) infDatalog. We deduce a unified and elementary proof that global model-checking ...

In this paper, we define a Mathematical model of program structure. Mathematical model of program structure defined here provides unified mathematical treatment of program structure, which reveals that a program is a large and finite set of embedded binary relations between current statement and previous ones. Then, a program is considered as a composed listing and a logical combination of mult...