In this paper we present an abstract representation of pointer structures in Kleene algebras and the properties of a particular selective update function. These can be used as prerequisites for the definition of in-situ pointer updates and a general framework to derive in-situ pointer algorithms from their specification.

Stair climbing can be a low-cost and relatively accessible way to add everyday physical activity, but many building stairwells are inaccessible or unpleasant and elevators are far more convenient. This study explores the use of and attitude toward stairs in an innovative office building where the main elevators for able-bodied users stop only at every third floor ("skip-stop" elevators). These ...

ion of Object Graphs in Program Verification Yifeng Chen and J.W. Sanders 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. Abstract. A set-theoretic formalism, AOG, is introduced to support automated verification of pointer programs. AOG targets pointer reaA set-theoretic formalism, AOG, is introduced to support automated verification of pointer programs. AOG targe...

We developed a pointer in 3D virtual space, using an eye tracking system as a sensor. The eye mark pointer is installed to a virtual environment system which provides stereoscopic vision with an immersive projection display. The circular polarization stereoscopic vision enables us to use the eye tracking system in the immersive projection display. The eye tracking system obtains relative gaze d...

Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, and usually contributes to other analyses or code optimizations. In recent years, a number of algorithms have been presented that provide an efficient, scalable, and yet precise pointer analysis. However, it is unclear ...

We introduce an I/O efficient algorithm and data structure to support fast decentralized search in large graphs modeling social networks. We structure network data in a homophily-based social hierarchy using an append-only, block-aligned skip list with an embedded tree microindex, which reduces I/O and cache line faults. We further minimize I/O when building the skip list by combining an extend...

This paper presents a pair of algorithms for output and input of pointer structures in binary format. Both algorithms operate in linear space and time. They have been inspired by copying compacting garbage collection algorithms, and make similar assumptions about the representations of pointer structures. In real programs, the transfer of entire pointer structures is often inappropriate. The al...

This paper gives a novel method of investigating flowsensitive pointer analysis for multithreaded program based on petri net. The method mainly borrows causal dataflow analysis idea from Azadeh Farzan. Petri net is used to describe control flow structure of multithreaded program. And pointer points-to information is propagated along causal dependencies of events in the partial order execution o...

Conservative garbage collectors are designed to operate in environments that do not provide su cient information on the location of pointers. Instead of relying on compiler provided information on the location of pointers, they assume that any bit pattern that could be a valid pointer in fact is a valid pointer. This, however, can lead to ine ciencies and pointer misidenti cations. In this posi...