|
|
2db11dcfc7
|
Use concatenation to represent adding new nodes
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-12 22:04:43 -07:00 |
|
|
|
3e2719d45f
|
Turn old proof into a hole to clean up later.
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-08 22:45:04 -07:00 |
|
|
|
78252b6c9e
|
Add proof of node preservation for adding edges.
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-08 22:43:07 -07:00 |
|
|
|
85fdf544b9
|
Translate informal proof of (node) transitivity into formal one.
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-08 20:57:08 -07:00 |
|
|
|
4f14a7b765
|
Successfully prove that monotonic updates preserve existing indices
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-08 00:24:52 -07:00 |
|
|
|
bc5b4b7d9e
|
Explicitly write metas for missing functions
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-08 00:16:10 -07:00 |
|
|
|
520b2b514c
|
Clear up vector reindexing
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-08 00:12:50 -07:00 |
|
|
|
f7ac22257e
|
Beat head against the vector-cast wall.
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-07 23:44:35 -07:00 |
|
|
|
b72ad070ba
|
Try using index-based comparisons
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-07 23:18:46 -07:00 |
|
|
|
195537fe15
|
Implement graph construction using <*>, map, and update.
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-07 20:26:38 -07:00 |
|
|
|
d4b0796715
|
Intermediate commit. Switch to *-based definition of <=.
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-07 19:51:59 -07:00 |
|
|
|
b505063771
|
Start working on proofs of Graph-related things
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-04 20:34:28 -07:00 |
|
|
|
844c99336a
|
Intermediate commit: add while loops and start trying to formalize them.
|
2024-04-03 22:31:23 -07:00 |
|
|
|
3e88a64ed9
|
Add some debugging code to sign analysis to print the results
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-03-10 22:23:45 -07:00 |
|
|
|
3305de4710
|
Remove need for explicit arguments in map derivatives
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-03-10 18:35:29 -07:00 |
|
|
|
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 |
|
|
|
0705df708e
|
Prove that variables in a program all come from the program's code
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-03-10 16:41:21 -07:00 |
|
|
|
fdc40632bf
|
Add a way to retrieve the code for a particular state
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-03-09 23:09:50 -08:00 |
|
|
|
f84a1c923c
|
Prove that the 'join' transformation is monotonic
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-03-09 23:06:47 -08:00 |
|
|
|
75f981cb75
|
Define simple sequential-only programs
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-03-09 13:59:48 -08:00 |
|
|
|
a55c786a51
|
Tentatively start working on a language to analyze
|
2024-02-07 22:51:08 -08:00 |
|
