Sciweavers

1204 search results - page 179 / 241
» Termination of Polynomial Programs
Sort
View
ICCAD
1996
IEEE
141views Hardware» more  ICCAD 1996»
15 years 2 months ago
An observability-based code coverage metric for functional simulation
Functional simulation is the most widely used method for design verification. At various levels of abstraction, e.g., behavioral, register-transfer level and gate level, the design...
Srinivas Devadas, Abhijit Ghosh, Kurt Keutzer
IWMM
2010
Springer
137views Hardware» more  IWMM 2010»
15 years 1 months ago
The locality of concurrent write barriers
Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular ...
Laurence Hellyer, Richard Jones, Antony L. Hosking
DSN
2004
IEEE
15 years 1 months ago
An Architectural Framework for Providing Reliability and Security Support
This paper explores hardware-implemented error-detection and security mechanisms embedded as modules in a hardware-level framework called the Reliability and Security Engine (RSE)...
Nithin Nakka, Zbigniew Kalbarczyk, Ravishankar K. ...
FLOPS
2006
Springer
15 years 1 months ago
Soutei, a Logic-Based Trust-Management System
We describe the design and implementation of a trust-management system Soutei, a dialect of Binder, for access control in distributed systems. Soutei policies and credentials are w...
Andrew Pimlott, Oleg Kiselyov
PEPM
2000
ACM
15 years 1 months ago
Calculating Sized Types
Many program optimisations and analyses, such as arraybound checking, termination analysis, etc, dependon knowing the size of a function's input and output. However, size inf...
Wei-Ngan Chin, Siau-Cheng Khoo