This project aims to implement a simple static analyzer based on abstract interpretation for a simple C-like language.
Implemented features:
- Concrete domain, for collecting the exact reachable states of the program.
- Parity domain
- Constant domain
- Interval domain
- Relational Analysis with Apron
- Reduction with Intervals and Parity
- Disjunctive completion with Intervals
This project is licensed under the MIT License - see the LICENSE.md file for details.
However, I cannot make the repository public because I don't want new students to copy my work, as I consider this a really bad practice.
Feel free to contact me if you want to peek at the code and I will give the link. Or if you are a student in need of some help.