Sciweavers

180 search results - page 18 / 36
» Reversible Computation and Reversible Programming Languages
Sort
View
ICFP
2004
ACM
14 years 8 months ago
Searching for deadlocks while debugging concurrent haskell programs
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...
Jan Christiansen, Frank Huch
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 8 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
ASPLOS
1994
ACM
14 years 2 days ago
Compiler Optimizations for Improving Data Locality
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
WCRE
2003
IEEE
14 years 1 months ago
Toward an environment for comprehending distributed systems
Many modern software systems are often large, distributed, written in more than one programming language, and developed using pre-built components. This paper presents the results...
Maher Salah, Spiros Mancoridis
VEE
2012
ACM
238views Virtualization» more  VEE 2012»
12 years 3 months ago
Replacement attacks against VM-protected applications
Process-level virtualization is increasingly being used to enhance the security of software applications from reverse engineering and unauthorized modification (called software p...
Sudeep Ghosh, Jason Hiser, Jack W. Davidson