Sciweavers

185 search results - page 18 / 37
» Experimental Study of Compiler Techniques for NUMA Machines
Sort
View
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
15 years 6 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...
FLAIRS
2004
15 years 1 months ago
Using Previous Experience for Learning Planning Control Knowledge
Machine learning (ML) is often used to obtain control knowledge to improve planning efficiency. Usually, ML techniques are used in isolation from experience that could be obtained...
Susana Fernández, Ricardo Aler, Daniel Borr...
TOPLAS
2002
89views more  TOPLAS 2002»
14 years 11 months ago
Efficient and precise array access analysis
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
Yunheung Paek, Jay Hoeflinger, David A. Padua
IEEEPACT
2006
IEEE
15 years 5 months ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...
IWMM
2010
Springer
137views Hardware» more  IWMM 2010»
15 years 3 months ago
The locality of concurrent write barriers
Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular ...
Laurence Hellyer, Richard Jones, Antony L. Hosking