Sciweavers

903 search results - page 91 / 181
» Completeness Results for Memory Logics
Sort
View
ANLP
2000
123views more  ANLP 2000»
13 years 10 months ago
Generating Text with a Theorem Prover
The process of documenting designs is tedious and often error-prone. We discuss a system that automatically generates documentation for the single step transition behavior of Stat...
Ivan I. Garibay
APIN
1998
78views more  APIN 1998»
13 years 8 months ago
The Method of Assigning Incidences
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...
Weiru Liu, David McBryan, Alan Bundy
DATE
2007
IEEE
81views Hardware» more  DATE 2007»
14 years 3 months ago
Using the inter- and intra-switch regularity in NoC switch testing
This paper proposes an efficient test methodology to test switches in a Network-on-Chip (NoC) architecture. A switch in an NoC consists of a number of ports and a router. Using th...
Mohammad Hosseinabady, Atefe Dalirsani, Zainalabed...
ICPR
2000
IEEE
14 years 1 months ago
Transparent Parallel Image Processing by way of a Familiar Sequential API
This paper describes an infrastructure that enables transparent development of image processing software for parallel computers. The infrastructure’s main component is an image ...
Frank J. Seinstra, Dennis Koelma
ARC
2011
Springer
220views Hardware» more  ARC 2011»
13 years 3 months ago
From Plasma to BeeFarm: Design Experience of an FPGA-Based Multicore Prototype
Abstract. In this paper, we take a MIPS-based open-source uniprocessor soft core, Plasma, and extend it to obtain the Beefarm infrastructure for FPGA-based multiprocessor emulation...
Nehir Sönmez, Oriol Arcas, Gokhan Sayilar, Os...