Sciweavers

903 search results - page 70 / 181
» Completeness Results for Memory Logics
Sort
View
DATE
2010
IEEE
137views Hardware» more  DATE 2010»
14 years 1 months ago
Deterministic, predictable and light-weight multithreading using PRET-C
—We present a new language called Precision Timed C, for predictable and lightweight multithreading in C. PRET-C supports synchronous concurrency, preemption, and a high-level co...
Sidharta Andalam, Partha S. Roop, Alain Girault
BMCBI
2005
108views more  BMCBI 2005»
13 years 8 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
MICRO
1998
IEEE
89views Hardware» more  MICRO 1998»
14 years 1 months ago
Load Latency Tolerance in Dynamically Scheduled Processors
This paper provides quantitative measurements of load latency tolerance in a dynamically scheduled processor. To determine the latency tolerance of each memory load operation, our...
Srikanth T. Srinivasan, Alvin R. Lebeck
LOGCOM
2008
94views more  LOGCOM 2008»
13 years 8 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
LICS
2006
IEEE
14 years 2 months ago
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Olivier Laurent, Lorenzo Tortora de Falco