Back to Results
First PageMeta Content
Dominator / Graph theory / Depth-first search / Tree traversal / Computing / Search algorithms / Mathematics / Compiler construction


Mechanized Verification of Computing Dominators for Formalizing Compilers Jianzhou Zhao and Steve Zdancewic University of Pennsylvania {jianzhou,stevez}@cis.upenn.edu Abstract. One prerequisite to the formal verification
Add to Reading List

Document Date: 2012-10-15 15:20:25


Open Document

File Size: 279,88 KB

Share Result on Facebook

Company

ALGDOM / Hp / /

/

Facility

Steve Zdancewic University of Pennsylvania / /

IndustryTerm

dominance analysis algorithm / straightforward algorithm / present several applications / transformation algorithms / terminating algorithm / type systems / search algorithm / faster tree construction algorithm / tree construction algorithm / /

Organization

University of Pennsylvania / /

Person

Steve Zdancewic Module / Steve Zdancewic / /

Position

Coq proof assistant / head / /

Product

Coq / /

ProgrammingLanguage

C / /

ProvinceOrState

Pennsylvania / Nova Scotia / /

Technology

typical DFS algorithm / AC algorithm / verified DFS algorithm / faster tree construction algorithm / search algorithm / transformation algorithms / straightforward algorithm / DFS algorithm / 3 The Allen-Cocke Algorithm The Allen-Cocke algorithm / tree construction algorithm / dom / Cooper-Harvey-Kennedy Algorithm The CHK algorithm / Allen-Cocke algorithm / terminating algorithm / classic Lengauer-Tarjan algorithm / Cooper-Harvey-Kennedy algorithm / dominance analysis algorithm / two algorithms / /

URL

http /

SocialTag