Proving correctness of compiler optimizations by temporal logic

Lacey, David; Jones, Neil D.; Wyk, Eric Van; Frederiksen, Carl Christian

doi:10.1145/565816.503299

Cited by 30 publications

(46 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our work is related to translation validation [19], [33], [42], [46], [47], [53], [54], relational approaches to reasoning about programs [5], [7], [15], [28], [35], CSP refinement checking [13], [27], [39], [51], and HLS verification [2], [14], [31], [34], [41]. We now discuss each area in more detail.…”

Section: Related Workmentioning

confidence: 99%

“…Relational approaches are a common tool for reasoning about programs, and they have been used for a variety of verification tasks, including model checking [7], [15], translation validation [42], [46], and reasoning about optimizations once and for all [5], [35]. In this context, our work is inspired by Josephs's approach [28] for proving refinements.…”

Section: B Relational Approachesmentioning

confidence: 99%

See 1 more Smart Citation

Translation Validation of High-Level Synthesis

Kundu

Lerner

Gupta

2011

High-Level Verification

View full text Add to dashboard Cite

Abstract-The growing complexity of systems and their implementation into silicon encourages designers to look for ways to model designs at higher levels of abstraction and then incrementally build portions of these designs-automatically or manually-from these high-level specifications. Unfortunately, this translation process itself can be buggy, which can create a mismatch between what a designer intends and what is actually implemented in the circuit. Therefore, checking if the implementation is a refinement or equivalent to its initial specification is of tremendous value. In this paper, we present an approach to automatically validate the implementation against its initial high-level specification using insights from translation validation, automated theorem proving, and relational approaches to reasoning about programs. In our experiments, we first focus on concurrent systems modeled as communicating sequential processes and show that their refinements can be validated using our approach. Next, we have applied our validation approach to a realistic scenario-a parallelizing high-level synthesis framework called Spark. We present the details of our algorithm and experimental results.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: B Relational Approachesmentioning

confidence: 99%

Translation Validation of High-Level Synthesis

Kundu

Lerner

Gupta

2011

High-Level Verification

View full text Add to dashboard Cite

show abstract

“…Semantic properties have been formally tackled by proving the soundness of the optimizations [1] [2], and the correctness of the optimizers [3]. Formal specifications of optimizations were introduced a number of years ago by Whitfield and Soffa [4] for automatic implementation of optimizations.…”

Section: Related Researchmentioning

confidence: 99%

“…Formal specifications of optimizations were introduced a number of years ago by Whitfield and Soffa [4] for automatic implementation of optimizations. Recently, specification techniques have been developed to prove the soundness of optimizations [1] [2]. An experimental approach to the correctness of an optimizer involved checking both unoptimized and optimized code [5].…”

Section: Related Researchmentioning

confidence: 99%

Developing a Foundation for Code Optimization

Soffa

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Although optimization technology has been successful over the past 40 years, recent trends are emerging that demand we reconsider the paradigm that we are using for code optimization. In particular, the trends toward dynamic optimization, writing embedded system software in high level languages and the lack of significant performance improvement from current optimization research are forcing us to rethink what we know and do not know about optimization. A number of problems dealing with both semantic and application properties of optimizations have always existed but have been mostly ignored. The challenge in optimization today is to explore properties of optimizations and develop a framework for better understanding and use of optimizations. Fortunately, research is starting to explore properties, including proving the soundness of optimizations, proving the correctness of optimizations, specifications of optimizations, and the predictability of profits of optimizations. Not only must we understand the properties, but we also need to integrate the properties into a framework. Only then can we address the problems of the developing trends.

show abstract

“…The first one uses formal techniques. The formal approach has been used to prove the soundness and correctness of optimizations [14][13] [16]. Work also has been done to automatically generate the implementation of optimizations [20][21] [9][12] from a formal specification.…”

Section: Introductionmentioning

confidence: 99%

A Framework for Exploring Optimization Properties

Zhao

Childers

Soffa

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Important challenges for compiler optimization include determining what optimizations to apply, where to apply them and what is a good sequence in which to apply them. To address these challenges, an understanding of optimization properties is needed. We present a model-based framework, FOP, to determine how optimizations enable and disable one another. We combine the interaction and profitability properties to determine a "best" sequence for applying optimizations. FOP has three components: (1) a code model for the program, (2) optimization models that capture when optimizations are applicable and their actions, and (3) a resource model that expresses the hardware resources affected by optimizations. FOP determines interactions by comparing the create-and destroy-conditions of each optimization with the post conditions of other optimizations. We develop a technique with FOP to construct codespecific optimization sequences. Experimentally, we demonstrate that our approach achieves similarly good code quality as empirical techniques with less compile-time.

show abstract

Proving correctness of compiler optimizations by temporal logic

Cited by 30 publications

References 23 publications

Translation Validation of High-Level Synthesis

Translation Validation of High-Level Synthesis

Developing a Foundation for Code Optimization

A Framework for Exploring Optimization Properties

Contact Info

Product

Resources

About