1156 search results - page 54 / 232 » Compositional Methods for Information-Hiding |
192
click to vote
CHARME
2001
Springer
15 years 10 months ago
2001
Springer
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...
181
click to vote
COLING
2010
15 years 1 months ago
2010
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...
164
Voted
IPPS
2007
IEEE
16 years 26 days ago
2007
IEEE
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 ...
167
click to vote
KES
2005
Springer
16 years 2 days ago
2005
Springer
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 ...
186
Voted
LPNMR
2005
Springer
16 years 2 days ago
2005
Springer
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...