Sciweavers

193 search results - page 10 / 39
» Reasoning about Memory Layouts
Sort
View
CODES
2007
IEEE
14 years 4 months ago
Locality optimization in wireless applications
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...
Javed Absar, Min Li, Praveen Raghavan, Andy Lambre...
POPL
1998
ACM
14 years 2 months ago
Alias Analysis of Executable Code
Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can generally benefit from information about aliasing. Unfort...
Saumya K. Debray, Robert Muth, Matthew Weippert
ESOP
2010
Springer
14 years 7 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
PODC
2010
ACM
14 years 1 months ago
Brief announcement: view transactions: transactional model with relaxed consistency checks
We present view transactions, a model for relaxed consistency checks in software transactional memory (STM). View transactions always operate on a consistent snapshot of memory bu...
Yehuda Afek, Adam Morrison, Moran Tzafrir
ICASSP
2011
IEEE
13 years 1 months ago
Acoustic-to-articulatory inversion using an episodic memory
This paper presents a new acoustic-to-articulatory inversion methodbased on an episodic memory, which is an interesting model for two reasons. First, it does not rely on any assum...
Sébastien Demange, Slim Ouni