Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages

Karrenberg, Ralf; Košta, Marek; Sturm, Thomas

doi:10.1007/978-3-642-40885-4_5

Cited by 1 publication

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The analysis conservatively has to mark such addresses as unknown because of missing static information. This section describes how the precision of the analysis can be improved using an SMT solver [Karrenberg et al 2013]. 3 We generalize the classes for which consecutivity can be proven to linear arithmetic transformations, in particular including integer division and modulo by constants.…”

Section: Improving Precision With An Smt Solvermentioning

confidence: 99%

See 1 more Smart Citation

Automatic SIMD Vectorization of SSA-based Control Flow Graphs

Karrenberg¹

2015

Self Cite

View full text Add to dashboard Cite

First and foremost, I want to express my gratitude towards my advisor Prof. Dr. Sebastian Hack. Not only did he give me the opportunity to pursue a PhD in his group, he also gave me all the necessary freedom, boundaries, and advice to finally succeed. Furthermore, I would like to thank Prof. Dr. Dr. h.c. mult. Reinhard Wilhelm for reviewing this thesis, and Prof. Dr. Christoph Weidenbach and Dr. Jörg Herter for serving on my committee. I also want to offer my special thanks to Prof. Dr. Philipp Slusallek. He first introduced me to working in research during my undergraduate studies and since then has accompanied-with his typical, contagious enthusiasm-most of the projects that I have been involved in. Another special thanks go to Dr. Ayal Zaks for a lot of valuable feedback and for the honor of writing the foreword. It is a pleasure to thank the following people that I met during my time at university:

show abstract

Section: Improving Precision With An Smt Solvermentioning

confidence: 99%

“…These SMT solvers, however, do not directly support div k and mod k , which makes them less interesting for our application here. The numbers shown already include a novel technique called modulo elimination [Karrenberg et al 2013] that improved running times of Z3.…”

Section: Translation To Presburger Arithmeticmentioning

confidence: 99%

Automatic SIMD Vectorization of SSA-based Control Flow Graphs

Karrenberg¹

2015

Self Cite

View full text Add to dashboard Cite

show abstract

Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages

Cited by 1 publication

References 18 publications

Automatic SIMD Vectorization of SSA-based Control Flow Graphs

Automatic SIMD Vectorization of SSA-based Control Flow Graphs

Contact Info

Product

Resources

About