2014
DOI: 10.1007/978-3-319-08970-6_37
|View full text |Cite
|
Sign up to set email alerts
|

Mechanical Certification of Loop Pipelining Transformations: A Preview

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Our key invariant defines a "correspondence relation" between the backedges of the sequential and pipelined CCDFG. The relation can be informally paraphrased as follows [11].…”
Section: Algorithm Invariant and Proofmentioning
confidence: 99%
See 1 more Smart Citation
“…Our key invariant defines a "correspondence relation" between the backedges of the sequential and pipelined CCDFG. The relation can be informally paraphrased as follows [11].…”
Section: Algorithm Invariant and Proofmentioning
confidence: 99%
“…In this paper, we discuss our ongoing work on using ACL2 for certifying loop pipelining transformations. A short companion paper [11] provides a high-level summary of our approach suitable for general audience. In this paper we provide more ACL2-specific details.…”
Section: Introductionmentioning
confidence: 99%
“…Our key invariant defines a "correspondence relation" between the back-edges of the sequential and pipelined CCDFGs. The relation can be informally paraphrased as follows [50].…”
Section: Edges Of Sequential and Pipelined Loopsmentioning
confidence: 99%