Results 1 - 10 of 41

Capabilities for Uniqueness and Borrowing

by Martin Odersky
"... Abstract. An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects of aliasing, practical systems often severely restrict the shape of messages passed by reference. Moreover, the problema ..."
Abstract - Cited by 21 (1 self) - Add to MetaCart
, the problematic interplay between destructive reads–often used to implement unique references–and temporary aliasing through “borrowed ” references is exacerbated in a concurrent setting, increasing the potential for unpredictable run-time errors. This paper introduces a new approach to uniqueness. The idea

The Logical Approach to Stack Typing

by Amal Ahmed, David Walker , 2003
"... We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set of natural deduction-style inference rules. We deploy the logic in a simple type system for a stack-based assembly langu ..."
Abstract - Cited by 24 (6 self) - Add to MetaCart
We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set of natural deduction-style inference rules. We deploy the logic in a simple type system for a stack-based assembly

Capabilities for Uniqueness and Borrowing

by Philipp Haller , EPFL Martin Odersky , Switzerland
"... Abstract. An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects of aliasing, practical systems often severely restrict the shape of messages passed by reference. Moreover, the problem ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
, the problematic interplay between destructive reads-often used to implement unique references-and temporary aliasing through "borrowed" references is exacerbated in a concurrent setting, increasing the potential for unpredictable run-time errors. This paper introduces a new approach to uniqueness

Rust as a Language for High Performance GC Implementation

by Yi Lin , Stephen M Blackurn , Antony L Hosking , Michael Norrish
"... Abstract High performance garbage collectors build upon performancecritical low-level code, typically exhibit multiple levels of concurrency, and are prone to subtle bugs. Implementing, debugging and maintaining such collectors can therefore be extremely challenging. The choice of implementation la ..."
Abstract - Add to MetaCart
undermining the robustness and flexibility of the collector design. Rust's ownership model, lifetime specification, and reference borrowing deliver safety guarantees through a powerful static checker with little runtime overhead. These features make Rust a compelling candidate for a collector

Practical Techniques For Interprocedural Heap Analysis

by Rakesh Ghiya - Master's thesis, McGill U , 1996
"... Accurate alias analysis is critical for optimizing/parallelizing compilers that support languages with pointers. Efficient techniques have been developed to calculate aliases introduced by pointers to named memory locations (typically on the stack). However, practical and effective techniques for de ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
Accurate alias analysis is critical for optimizing/parallelizing compilers that support languages with pointers. Efficient techniques have been developed to calculate aliases introduced by pointers to named memory locations (typically on the stack). However, practical and effective techniques

Register Allocation by Puzzle Solving

by Fernando Magno Quintão Pereira , Jens Palsberg , 2008
"... We show that register allocation can be viewed as solving a collection of puzzles. We model the register file as a puzzle board and the program variables as puzzle pieces; pre-coloring and register aliasing fit in naturally. For architectures such as PowerPC, x86, and StrongARM, we can solve the puz ..."
Abstract - Cited by 14 (0 self) - Add to MetaCart
We show that register allocation can be viewed as solving a collection of puzzles. We model the register file as a puzzle board and the program variables as puzzle pieces; pre-coloring and register aliasing fit in naturally. For architectures such as PowerPC, x86, and StrongARM, we can solve

Spatial dealiasing of 3-d seismic reflection data

by Shuki Ronen, Valery Sorin, Richard Bale - Geophysical Journal International , 1991
"... One of the main challenges of 3-D reflection seismology is providing the spatial sampling required to avoid aliasing. In practice, fine-scale and regular acquisition geometry is possible only in 2-D seismic surveys. 3-D surveys typically have sparse and irregular geometry that often results in spati ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
that would be recorded in an adequately sampled zero-offset experiment, that best fits the data with a given velocity model. The process takes advantage of what seems to be redundancy in multifold seismic data, to overcome spatial aliasing which is a missing data problem. Our computer implementation involves

Copyright C

by By Rakesh Ghiya, Rakesh Ghiya - Master's thesis, McGill U , 1995
"... Accurate alias analysis is critical for optimizing/parallelizing compilers that support languages with pointers. Efficient techniques have been developed to calculate aliases introduced by pointers to named memory locations (typically on the stack). However, practical and effective techniques for de ..."
Abstract - Add to MetaCart
Accurate alias analysis is critical for optimizing/parallelizing compilers that support languages with pointers. Efficient techniques have been developed to calculate aliases introduced by pointers to named memory locations (typically on the stack). However, practical and effective techniques

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

by Robin Scheibler, Saeid Haghighatshoar, Martin Vetterli
"... A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N α), scales sub-linearly in N for some 0 < α < 1. Assuming a random support model for the nonzero tr ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
, where by a carefully designed subsampling of the time domain signal, one can induce a suitable aliasing pattern in the transform domain. By treating the aliasing patterns as paritycheck constraints and borrowing ideas from erasure correcting sparse-graph codes, the recovery of the nonzero spectral

Web Service Composition Languages: Old Wine in New Bottles?

by Wil M.P. van der Aalst, Marlon Dumas, Arthur H.M. ter Hofstede
"... Recently, several languages for web service composition have emerged (e.g., BPEL4WS and WSCI). The goal of these languages is to glue web services together in a process-oriented way. For this purpose, these languages typically borrow concepts from workflow management systems and embed these concepts ..."
Abstract - Cited by 13 (1 self) - Add to MetaCart
Recently, several languages for web service composition have emerged (e.g., BPEL4WS and WSCI). The goal of these languages is to glue web services together in a process-oriented way. For this purpose, these languages typically borrow concepts from workflow management systems and embed
Results 1 - 10 of 41