DanilaFe/agda-spa
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
277 Commits 1 Branch 0 Tags 1.6 MiB
5f946de5e8
Commit Graph

277 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Danila Fedorin
5f946de5e8 Remove last remaining assumption for correctness 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-10 21:30:56 -07:00
Danila Fedorin
04bafb2d55 Prove that the inputs to wrap are empty 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-10 21:25:40 -07:00
Danila Fedorin
e0248397b7 Prove that predecessors imply edges 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 23:18:51 -07:00
Danila Fedorin
41ada43047 Move predecessor code into Graphs 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 23:13:49 -07:00
Danila Fedorin
a081edb881 Add a proof about filter's distributivity 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 23:06:49 -07:00
Danila Fedorin
3d2a507f2f Almost prove correctness 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 22:49:53 -07:00
Danila Fedorin
82027ecd04 Move predecessor computation into Graphs 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 21:26:32 -07:00
Danila Fedorin
734e82ff6d Wrap generated graphs to ensure entry and exit nodes have no extra edges 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 21:08:32 -07:00
Danila Fedorin
69d1ecebae Prove that the bottom map's valyes are all bottoms 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 20:48:32 -07:00
Danila Fedorin
b78cb91f2a Strengthen lemma about IterProd bottom to definition equality 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 20:20:11 -07:00
Danila Fedorin
16fa4cd1d8 Use records rather than nested pairs to represent 'fixed height' 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 20:11:04 -07:00
Danila Fedorin
95669b2c65 Prove that the iterated product is made from iterated bottom elements 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 19:45:15 -07:00
Danila Fedorin
6857f60465 Rename the min/max elements top bottom and top in Prod 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 19:08:46 -07:00
Danila Fedorin
f4392b32c0 Finish the last proof obligation for trace walking 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 19:01:36 -07:00
Danila Fedorin
794c04eee9 Prove the foldr-implies lemma 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 18:37:50 -07:00
Danila Fedorin
80069e76e6 Prove the recursive step of trace walking 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 17:56:47 -07:00
Danila Fedorin
a22c0c9252 Prove a property of multi-key lookup 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 17:56:26 -07:00
Danila Fedorin
20dc99ba1f Re-indent some code to take up less horizontal space 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 16:57:03 -07:00
Danila Fedorin
b3a62da1fb Add a proof that edges lead to 'incoming' inclusion 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-09 16:56:45 -07:00
Danila Fedorin
f0b0d51b48 Add unproven lemma about fold implication 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 23:38:23 -07:00
Danila Fedorin
8ff88f9f9e Move helper code into separate function 
I'll need to reuse it.

Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 23:35:02 -07:00
Danila Fedorin
c1581075d3 Add more test programs 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 23:30:23 -07:00
Danila Fedorin
838aaf9c58 Start end-to-end proof of correctness 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 23:30:03 -07:00
Danila Fedorin
4ac9dffa9b Prove that the var->lattice maps respect equality 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 22:53:21 -07:00
Danila Fedorin
3f5551d70c Add a lemma about the effect of joinAll 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 22:34:02 -07:00
Danila Fedorin
5837fdf19b Prove that 'updateAll' has preservation 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 22:29:36 -07:00
Danila Fedorin
4350919871 Add proof about setVariablesForState 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 22:09:56 -07:00
Danila Fedorin
7fe46b014c Slightly simplify evaluation code 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 22:05:50 -07:00
Danila Fedorin
66d229c493 Prove that multi-statement evaluation "preserves" the validity of the analysis 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 21:51:53 -07:00
Danila Fedorin
1b8bea8957 Use foldl in multi-statement evaluation 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 21:50:38 -07:00
Danila Fedorin
dd8cdcd10c Add proofs about monotonicity of foldl 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 21:48:41 -07:00
Danila Fedorin
ad4592d4d2 Switch to using implicit arguments where needed 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 21:34:17 -07:00
Danila Fedorin
8d0d87d2d9 Start on proofs of correctness 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 20:50:21 -07:00
Danila Fedorin
cfa3375de5 Expose more functions from FiniteMap 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 20:50:05 -07:00
Danila Fedorin
6b116ed960 Forward some map function to Finite{,Value}Map 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-05-08 20:34:15 -07:00
Danila Fedorin
3859826293 Define interpretation of the sign lattice 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-30 21:58:41 -07:00
Danila Fedorin
be50c76cb1 Add more higher-order primitives 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-30 21:56:34 -07:00
Danila Fedorin
112a5087ef Tentative start on proving correctness 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-30 19:20:02 -07:00
Danila Fedorin
ccb7abc501 Remove unused code from Utils 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-30 19:15:38 -07:00
Danila Fedorin
91b5d108f6 Simplify proofs about 'loop' using concatenation lemma 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-29 21:28:21 -07:00
Danila Fedorin
c574ca9c56 Prove that graphs build by buildCfg are sufficient 
That is, if we have a (semantic) trace, we can
find a corresponding path through the CFG.

Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-29 20:57:43 -07:00
Danila Fedorin
bbfba34e05 Prove another (simple) case 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-28 13:37:03 -07:00
Danila Fedorin
aec15573fc Add properties of end-to-end traces on loops 2024-04-28 12:53:25 -07:00
Danila Fedorin
b4d395767d Simplify operations used for constructing graphs 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-28 12:40:50 -07:00
Danila Fedorin
07550bc214 Prove 'sufficiency' for if-else. 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-28 12:10:12 -07:00
Danila Fedorin
9366ec4a97 Allow promoting end-to-end traces too 2024-04-28 12:00:06 -07:00
Danila Fedorin
0fb884eb07 Use implicit arguments for more things 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-28 11:43:49 -07:00
Danila Fedorin
6b44ac1feb Make graph arguments implicit where possible 2024-04-28 11:37:08 -07:00
Danila Fedorin
69a4e8eb5c Add some helpers and rewrite code 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-27 17:43:16 -07:00
Danila Fedorin
4fee16413a Define end-to-end path concatenation and prove one more case 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
 2024-04-27 17:34:50 -07:00