3 search results - page 1 / 1 » Proving Approximate Implementations for Probabilistic I O Au... |
ENTCS
2007
13 years 5 months ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
FTCS
1998
13 years 7 months ago
1998
Most RAID controllers implemented in industry are complicated and di cult to reason about. This complexity has led to software and hardware systems that are di cult to debug and h...
APLAS
2009
ACM
14 years 4 days ago
2009
ACM
Abstract. Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the a...