Programmer specified pointer independence

Koes, David Ryan; Budiu, Mihai; Venkataramani, Girish

doi:10.1145/1065895.1065905

Cited by 10 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Where possible, the compiler (or other parts of the system) can tentatively identify its own candidates for ratification by the domain expert (as in Koes et al [10]). …”

Section: Domain-specific Knowledgementioning

confidence: 99%

See 1 more Smart Citation

Structured hints : extracting and abstracting domain expertise.

Hereld¹,

Sterling²,

Gao³

2009

View full text Add to dashboard Cite

“…• Where possible, the compiler (or other parts of the system) can tentatively identify its own candidates for ratification by the domain expert (as in Koes et al [10]). …”

Section: Domain-specific Knowledgementioning

confidence: 99%

“…Koes et al [10] introduce an annotation-mediated interaction between the compiler and the application programmer to identify opportunities enabled when pointers are guaranteed to be independent. The programmer can supply #PRAGMA INDEPENDENT annotations to suggest optimization opportunities.…”

Section: Introductionmentioning

confidence: 99%

Structured hints : extracting and abstracting domain expertise.

Hereld¹,

Sterling²,

Gao³

2009

View full text Add to dashboard Cite

“…For example some operators are commutative, and their operands can be swapped safely [16]. Some statements are independent from each other and their execution order can be altered [11]. Finally, conditionals and loops give room for various semantics preserving transformations such as promotion or predicate duplication [12].…”

Section: Other Issuesmentioning

confidence: 99%

Toward an Implementation of the "Form Template Method" Refactoring

Juillerat¹,

Hirsbrunner²

2007

Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2007)

View full text Add to dashboard Cite

This paper presents an implementation of the "form template method" refactoring. This transformation has not been automated yet, but has many similarities with other transformations such as clone detection and removal or method extraction. Forming a template method is a difficult process because it has to deal with code statements directly. Few abstractions and algorithms have been investigated yet, compared to transformations dealing with higher level aspects such as the classes, methods, fields and their relations. We present a new algorithm that performs this transformation in a semi-automated way on Java programs. We state the difficulties inherent to this transformation and propose solutions to handle them.Seventh IEEE International Working Conference on Source Code Analysis and Manipulation 0-7695-2880-5/07 $25.00

show abstract

“…This keyword is attached to particular pointer types and states that two pointers with the restrict property can never be aliased and used in ways that might overlap; Koes et al later generalized such annotations to express a wider range of aliasing properties [87]. This functionality, however, is limited to concrete locations within a program, and only supports one type of annotation.…”

Section: User Annotationsmentioning

confidence: 99%

A Language for Specifying Compiler Optimizations for Generic Software

Lumsdaine

Willcock

2007

View full text Add to dashboard Cite

would not have been exposed to either generic programming or programming languages to the level that I have. He has also shown me in detail how to perform research and write high-quality papers, and I am grateful to be able to benefit from his experience in these areas.I am also grateful to my mentor at Lawrence Livermore National Laboratory, Daniel Quinlan, for aid in creating the thesis and support in both software development and writing the thesis. The ROSE framework, of which he is the main developer, was invaluable in applying the work in this thesis to commonly used programming languages. On the other hand, software libraries have also been recognized as potentially aiding in program optimization. One proposed implementation of library-based optimization is to allow the library author, or a library user, to define custom analyses and optimizations. Only limited systems have been created to take advantage of this potential, however. One problem in creating a framework for defining new optimizations and analyses is how users are to specify them: implementing them by hand inside a compiler is difficult and prone to errors. Thus, a domain-specific language for librarybased compiler optimizations would be beneficial. Many optimization specification languages have appeared in the literature, but they tend to be either limited in power or unnecessarily difficult to use. Therefore, I have designed, implemented, and evaluated the Pavilion language for specifying program analyses and optimizations, designed for library authors and users. These analyses and optimizations can be based on the implementation of a particular library, its use in a specific program, or on the properties of a broad range of types, expressed through concepts. The new system is intended to provide a high level of expressiveness, even though the intended users are unlikely to be compiler experts.viii

show abstract

Programmer specified pointer independence

Cited by 10 publications

References 26 publications

Structured hints : extracting and abstracting domain expertise.

Structured hints : extracting and abstracting domain expertise.

Toward an Implementation of the "Form Template Method" Refactoring

A Language for Specifying Compiler Optimizations for Generic Software

Contact Info

Product

Resources

About