Attempts at formalizing static program analysis techniques in Agda.
Go to file
Danila Fedorin f21ebdcf46 Start working on the evaluation operation.
Proving monotonicity is the main hurdle here.

Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
2024-03-10 18:13:01 -07:00
Analysis Start working on the evaluation operation. 2024-03-10 18:13:01 -07:00
Lattice Start working on the evaluation operation. 2024-03-10 18:13:01 -07:00
Chain.agda Put the fixed point algorithm code into its own file 2023-09-16 13:39:35 -07:00
Equivalence.agda Add some additional 'equivalence' definitions to Equivalence 2024-02-18 21:46:42 -08:00
Fixedpoint.agda Fix definition of 'less than' to not involve a third variable. 2024-02-07 21:04:13 -08:00
Isomorphism.agda Update with new changes to Agda 2024-03-03 16:44:10 -08:00
Language.agda Start working on the evaluation operation. 2024-03-10 18:13:01 -07:00
Lattice.agda Prove that the 'join' transformation is monotonic 2024-03-09 23:06:47 -08:00
Main.agda Use named modules to avoid having to pass redundant parameters 2024-03-09 21:46:15 -08:00
Utils.agda Start working on the evaluation operation. 2024-03-10 18:13:01 -07:00