Sciweavers

1156 search results - page 54 / 232
» Compositional Methods for Information-Hiding
Sort
View
CHARME
2001
Springer
162views Hardware» more  CHARME 2001»
13 years 11 months ago
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
Kenneth L. McMillan
COLING
2010
13 years 2 months ago
Composition of Semantic Relations: Model and Applications
This paper presents a framework for combining semantic relations extracted from text to reveal even more semantics that otherwise would be missed. A set of 26 relations is introdu...
Eduardo Blanco 0002, Hakki C. Cankaya, Dan I. Mold...
IPPS
2007
IEEE
14 years 1 months ago
A Model-Driven Approach to Job/Task Composition in Cluster Computing
In the general area of high-performance computing, object-oriented methods have gone largely unnoticed. In contrast, the Computational Neighborhood (CN), a framework for parallel ...
Neeraj Mehta, Yogesh Kanitkar, Konstantin Läu...
KES
2005
Springer
14 years 1 months ago
Generalized Composite Motif Discovery
This paper discusses a general algorithm for the discovery of motif combinations. From a large number of input motifs, discovered by any single motif discovery tool, our algorithm ...
Geir Kjetil Sandve, Finn Drabløs
LPNMR
2005
Springer
14 years 1 months ago
An ID-Logic Formalization of the Composition of Autonomous Databases
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitio...
Bert Van Nuffelen, Ofer Arieli, Alvaro Corté...