Sciweavers

357 search results - page 23 / 72
» Optimizing programs with intended semantics
Sort
View
PPDP
2010
Springer
13 years 6 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
ENTCS
2002
79views more  ENTCS 2002»
13 years 7 months ago
Debugging and Testing Optimizers through Comparison Checking
We present a novel technique called comparison checking that helps optimizer writers debug optimizers by testing, for given inputs, that the semantics of a program are not changed...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
14 years 1 months ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha
ESOP
2010
Springer
14 years 4 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
EMO
2006
Springer
219views Optimization» more  EMO 2006»
13 years 11 months ago
ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization
Abstract. This paper presents ParadisEO-MOEO, a white-box objectoriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradig...
Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourd...