Sciweavers

14331 search results - page 2714 / 2867
» On the modeling and analysis of obligations
Sort
View
DAC
1998
ACM
15 years 11 months ago
OCCOM: Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
ICDCS
1997
IEEE
15 years 11 months ago
Connection Admission Control for Hard Real-Time Communication in ATM Networks
Connection Admission Control (CAC) is needed in ATM networks to provide Quality of Service (QoS) guarantees to real-time connections. This paper presents a CAC scheme based on a b...
Qin Zheng, Tetsuya Yokotani, Tatsuki Ichihashi, Ya...
ICPP
1994
IEEE
15 years 11 months ago
Cachier: A Tool for Automatically Inserting CICO Annotations
Shared memory in a parallel computer provides prowith the valuable abstraction of a shared address space--through which any part of a computation can access any datum. Although un...
Trishul M. Chilimbi, James R. Larus
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
FPCA
1989
15 years 11 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
« Prev « First page 2714 / 2867 Last » Next »