A Call Graph Reduction based Novel Storage Allocation Scheme for Smart City Applications

Today s world is going to be smart even smarter day by day Smart cities play an important role to make the world smart Thousands of smart city applications are developing in every day Every second very huge amount of data is generated The data need to be managed and stored properly so that information can be extracted using various emerging technologies The main aim of this paper is to propose a storage scheme for data generated by smart city applications A matrix is used which store the information of each adjacency node of each level as well as the weight and frequency of call graph It has been experimentally depicted that the applied algorithm reduces the size of the call graph without changing the basic structure without any loss of information Once the graph is generated from the source code it is stored in the matrix and reduced appropriately using the proposed algorithm The proposed algorithm is also compared to another call graph reduction techniques and it has been experimentally evaluated that the proposed algorithm significantly reduces the graph and store the smart city application data efficientl

Deriving Escape Analysis by Abstract Interpretation

Escape analysis of object-oriented languages approximates the set of objects which do not escape from a given context. If we take a method as context, the non-escaping objects can be allocated on its activation stack; if we take a thread, Java synchronisation locks on such objects are not needed. In this paper, we formalise a basic escape domain E as an abstract interpretation of concrete states, which we then refine into an abstract domain ER which is more concrete than E and, hence, leads to a more precise escape analysis than E. We provide optimality results for both E and ER, in the form of Galois insertions from the concrete to the abstract domains and of optimal abstract operations. The Galois insertion property is obtained by restricting the abstract domains to those elements which do not contain garbage, by using an abstract garbage collector. Our implementation of ER is hence an implementation of a formally correct escape analyser, able to detect the stack allocatable creation points of Java (bytecode) applications