Formal verification of transformations for peephole optimization-Reference-Cited by-同舟云学术

Formal verification of transformations for peephole optimization

Published:1997 Issue: Volume: Page:459-472
ISSN:0302-9743
Container-title:FME '97: Industrial Applications and Strengthened Foundations of Formal Methods
language:
Short-container-title:

Author:

Dold A.,Henke F. W.,Pfeifer H.,Rueß H.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63533-5_24.pdf

Reference17 articles.

1. J. Crow, S. Owre, J. Rushby, N. Shankar, and M. Srivas. A Tutorial Introduction to PVS. Technical report, Computer Science Laboratory, SRI International, Menlo Park CA 94025, USA, March 1995. To presented at WIFT'95: Workshop on Industrial-Strength Formal Specification Techniques, Boca Raton, Florida.

2. Jack W. Davidson and Christoper W. Fraser. The Design and Application of a Retargetable Peephole Optimizer. ACM Transactions on Programming Languages and Systems, 2(2):191–202, April 1980.

3. Jack W. Davidson and Christoper W. Fraser. Register Allocation and Exhaustive Peephole Optimization. Software-Practice and Experience, 14(9):857–865, September 1984.

4. Jack W. Davidson and Christoper W. Fraser. Automatic Inference and fast Interpretation of Peephole Optimization Rules. Software-Practice and Experience, 17(11):801–812, November 1987.

5. A. Dold, F. W. von Henke, H. Pfeifer, and H. Rueß. A Generic Specification for Verifying Peephole Optimizations. Technical Report UIB-95-14, Universitat Ulm, Fakultät fur Informatik, 89069-Ulm, Germany, December 1995.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Compiler verification;ACM SIGSOFT Software Engineering Notes;2003-11

2. Reasoning about classes in object-oriented languages: Logical models and tools;Programming Languages and Systems;1998

3. Using PVS to prove a Z refinement: A case study;FME '97: Industrial Applications and Strengthened Foundations of Formal Methods;1997