https://github.com/nunoplopes/llvm-aa-verif

Verification of LLVM's alias analysis proof rules
https://github.com/nunoplopes/llvm-aa-verif

alias-analysis llvm verification

Last synced: about 1 year ago
JSON representation

Verification of LLVM's alias analysis proof rules

• Host: GitHub
• URL: https://github.com/nunoplopes/llvm-aa-verif
• Owner: nunoplopes
• License: mit
• Created: 2018-08-09T10:13:39.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2018-08-09T10:31:58.000Z (almost 8 years ago)
• Last Synced: 2025-04-16T01:08:50.937Z (about 1 year ago)
• Topics: alias-analysis, llvm, verification
• Language: Python
• Size: 4.88 KB
• Stars: 5
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
Verification of LLVM's Alias Analysis Proof Rules

=================================================

This repo contains a Python script that verifies LLVM alias analysis (AA)

proof rules automatically. It uses Z3Py to discharge the proof obligations.

The script formalizes the AA results of LLVM (no alias, partial alias,

must alias, may alias).

The formalization of the LLVM memory is based on the OOPSLA'18 paper.

The script currently attempts to prove 2 things:

 - Relationships between AA's lattice values (e.g., no-alias implies

   not must-alias)

 - Most proof rules of BasicAA

Limitations:

 - Address spaces are not supported (assumed 0 always).

 - Const memory, arguments, locally allocated objects not supported.

 - Missing proofs that spec of AA results is meaningful (e.g., if

   p,q must-alias, then load p == load q if memories are equal).