Sciweavers

903 search results - page 55 / 181
» Completeness Results for Memory Logics
Sort
View
ENTCS
2007
80views more  ENTCS 2007»
13 years 8 months ago
Topological Perspective on the Hybrid Proof Rules
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
Balder ten Cate, Tadeusz Litak
FASE
2009
Springer
14 years 3 months ago
Logical Testing
Abstract. Software is often tested with unit tests, in which each procedure is executed in isolation, and its result compared with an expected value. Individual tests correspond to...
Kathryn E. Gray, Alan Mycroft
DSD
2002
IEEE
90views Hardware» more  DSD 2002»
14 years 1 months ago
Simplifying Instruction Issue Logic in Superscalar Processors
Modern microprocessors schedule instructions dynamically in order to exploit instruction-level parallelism. It is necessary to increase instruction window size for improving instr...
Toshinori Sato, Itsujiro Arita
MICRO
2009
IEEE
147views Hardware» more  MICRO 2009»
14 years 3 months ago
Complexity effective memory access scheduling for many-core accelerator architectures
Modern DRAM systems rely on memory controllers that employ out-of-order scheduling to maximize row access locality and bank-level parallelism, which in turn maximizes DRAM bandwid...
George L. Yuan, Ali Bakhoda, Tor M. Aamodt
IPPS
2006
IEEE
14 years 2 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...