Sciweavers

294 search results - page 35 / 59
» Formal Verification of the Implementability of Timing Requir...
Sort
View
RTAS
2006
IEEE
14 years 2 months ago
Network-Code Machine: Programmable Real-Time Communication Schedules
Distributed hard real-time systems require guaranteed communication. One common approach is to restrict network access by enforcing a time-division multiple access (TDMA) schedule...
Sebastian Fischmeister, Oleg Sokolsky, Insup Lee
ICCAD
2006
IEEE
146views Hardware» more  ICCAD 2006»
14 years 2 months ago
Cost-aware synthesis of asynchronous circuits based on partial acknowledgement
Designing asynchronous circuits by reusing existing synchronous tools has become a promising solution to the problem of poor CAD support in asynchronous world. A straightforward w...
Yu Zhou, Danil Sokolov, Alexandre Yakovlev
ENTCS
2006
176views more  ENTCS 2006»
13 years 8 months ago
Gauss: A Framework for Verifying Scientific Computing Software
High performance scientific computing software is of critical international importance as it supports scientific explorations and engineering. Software development in this area is...
Robert Palmer, Steve Barrus, Yu Yang, Ganesh Gopal...
VLSID
2008
IEEE
122views VLSI» more  VLSID 2008»
14 years 8 months ago
A Module Checking Based Converter Synthesis Approach for SoCs
Protocol conversion involves the use of a converter to control communication between two or more protocols such that desired system-level specifications can be satisfied. We invest...
Roopak Sinha, Partha S. Roop, Samik Basu
CANS
2009
Springer
136views Cryptology» more  CANS 2009»
14 years 3 months ago
Verifying Anonymous Credential Systems in Applied Pi Calculus
Abstract. Anonymous credentials are widely used to certify properties of a credential owner or to support the owner to demand valuable services, while hiding the user’s identity ...
Xiangxi Li, Yu Zhang, Yuxin Deng