Static analysis which takes into account the values of data stored in the heapis considered complex and computationally intractable in practice. Thus, moststatic analyzers do not keep track of object fields nor of array contents, i.e.,they are heap-insensitive. In this article, we propose locality conditions forsoundly tracking heap-allocated data in Java (bytecode) programs, by...

Problem statement: Several efficient algorithms were developed to cope with the popular task of sorting. Improved heap sort is a new variant of heap sort. Basic idea of new algorithm is similar to classical Heap sort algorithm but it builds heap in another way. The improved heap sort algorithm requires nlogn-0.788928n comparisons for worst case and nlogn-n comparisons in average case. This algo...

Today is an era of wireless communication systems. The day is not so far when the whole distributed system of the world will goes wireless. Leader in a distributed system plays a vital role in various computing environments like wireless networks etc. The main focus of researchers is on electing a new leader with lesser time consumption and with transmitting minimum number of messages in the ne...

We present three novel techniques for the verification of invariants in the setting of Java-like languages including static fields and methods. Our techniques structure the heap through universe types, and extend the Visibility Technique of Müller et al. In order to cater for mutable static fields, we extend the classical universe types heap topology with multiple trees, where each tree is root...

This paper considers the problem of minimizing a convex, separable quadratic function subject to a knapsack constraint and a box constraint. An algorithm called NAPHEAP is developed for solving this problem. The algorithm solves the Karush-Kuhn-Tucker system using a starting guess to the optimal Lagrange multiplier and updating the guess monotonically in the direction of the solution. The start...

This paper presents an axiomatic framework in Coq for verifying invariants on heap data structures such as lists and trees in a C-like language with a low-level store model. The goal of the framework is to detect common errors such as memory leaks, dangling pointers and looped data structures. The framework provides a language for expressing invariants, and a set of inference axioms for verifyi...

We present Alias Refinement Types (Art), a new approach to the verification of correctness properties of linked data structures. While there are many techniques for checking that a heap-manipulating program adheres to its specification, they often require that the programmer annotate the behavior of each procedure, for example, in the form of loop invariants and preand post-conditions. Predicat...

This paper addresses the problem of recovering variable-like entities when analyzing executables in the absence of debugging information. We show that variable-like entities can be recovered by iterating Value-Set Analysis (VSA), a combined numeric-analysis and pointer-analysis algorithm, and Aggregate Structure Identification, an algorithm to identify the structure of aggregates. Our initial e...

ABSTRACT The peraluminous rhyolite that forms Round Top Mountain (approximately 375 m high × nearly 2 km in diameter), near Sierra Blanca, Hudspeth County, west Texas, USA, is enriched in yttrium and heavy rare earth elements (YHREEs), as well as Li, Be, U, Th, Sn, F, Rb, Cs, Nb, and Ta. Texas Mineral Resources Corp. (USA) proposes to release the YHREEs from their unique yttrofluorite host via ...