Sciweavers

12452 search results - page 2228 / 2491
» An exploration of program as language
Sort
View
ICALP
1998
Springer
15 years 10 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
POS
1998
Springer
15 years 10 months ago
Swizzle Barrier Optimizations for Orthogonal Persistence in Java
Swizzling refers to the translation of object references from an external, persistent format to an internal, transient format used during application execution. Eager swizzling sc...
Kumar Brahnmath, Nathaniel Nystrom, Antony L. Hosk...
ICALP
1997
Springer
15 years 10 months ago
Recursive Computational Depth
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
James I. Lathrop, Jack H. Lutz
ASPLOS
1996
ACM
15 years 10 months ago
Analysis of Branch Prediction Via Data Compression
Branch prediction is an important mechanism in modern microprocessor design. The focus of research in this area has been on designing new branch prediction schemes. In contrast, v...
I-Cheng K. Chen, John T. Coffey, Trevor N. Mudge
ASPLOS
1996
ACM
15 years 10 months ago
The Rio File Cache: Surviving Operating System Crashes
: One of the fundamental limits to high-performance, high-reliability file systems is memory's vulnerability to system crashes. Because memory is viewed as unsafe, systems per...
Peter M. Chen, Wee Teck Ng, Subhachandra Chandra, ...
« Prev « First page 2228 / 2491 Last » Next »