Sciweavers

1763 search results - page 75 / 353
» A Formalization of Polytime Functions
Sort
View
DATE
2004
IEEE
134views Hardware» more  DATE 2004»
15 years 1 months ago
Cost-Efficient Block Verification for a UMTS Up-Link Chip-Rate Coprocessor
ASIC designs for future communication applications cannot be simulated exhaustively. Formal Property Checking is a powerful technology to overcome the limitations of current funct...
Klaus Winkelmann, Hans-Joachim Trylus, Dominik Sto...
ZUM
2000
Springer
15 years 1 months ago
A Computation Model for Z Based on Concurrent Constraint Resolution
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
Wolfgang Grieskamp
WORDS
2005
IEEE
15 years 3 months ago
Agent-Oriented Modelling and Specification of Web Services
Web services (WS) provide a technology for integrating applications over the Internet. This paper proposes a multi-agent conceptual model of WS and an agent-oriented modelling and...
Hong Zhu, Lijun Shan
ISQED
2010
IEEE
126views Hardware» more  ISQED 2010»
14 years 11 months ago
Modeling and verification of industrial flash memories
We present a method to abstract, formalize, and verify industrial flash memory implementations. Flash memories contain specialized transistors, e.g., floating gate and split gate d...
Sandip Ray, Jayanta Bhadra, Thomas Portlock, Ronal...
ICA
2007
Springer
15 years 4 months ago
Mutual Interdependence Analysis (MIA)
Functional Data Analysis (FDA) is used for datasets that are more meaningfully represented in the functional form. Functional principal component analysis, for instance, is used to...
Heiko Claussen, Justinian Rosca, Robert I. Damper