|
4350919871
|
Add proof about setVariablesForState
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-05-08 22:09:56 -07:00 |
|
|
7fe46b014c
|
Slightly simplify evaluation code
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-05-08 22:05:50 -07:00 |
|
|
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 |
|
|
1b8bea8957
|
Use foldl in multi-statement evaluation
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-05-08 21:50:38 -07:00 |
|
|
dd8cdcd10c
|
Add proofs about monotonicity of foldl
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-05-08 21:48:41 -07:00 |
|
|
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 |
|
|
8d0d87d2d9
|
Start on proofs of correctness
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-05-08 20:50:21 -07:00 |
|
|
cfa3375de5
|
Expose more functions from FiniteMap
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-05-08 20:50:05 -07:00 |
|
|
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 |
|
|
3859826293
|
Define interpretation of the sign lattice
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-30 21:58:41 -07:00 |
|
|
be50c76cb1
|
Add more higher-order primitives
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-30 21:56:34 -07:00 |
|
|
112a5087ef
|
Tentative start on proving correctness
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-30 19:20:02 -07:00 |
|
|
ccb7abc501
|
Remove unused code from Utils
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-30 19:15:38 -07:00 |
|
|
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 |
|
|
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 |
|
|
bbfba34e05
|
Prove another (simple) case
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-28 13:37:03 -07:00 |
|
|
aec15573fc
|
Add properties of end-to-end traces on loops
|
2024-04-28 12:53:25 -07:00 |
|
|
b4d395767d
|
Simplify operations used for constructing graphs
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-28 12:40:50 -07:00 |
|
|
07550bc214
|
Prove 'sufficiency' for if-else.
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-28 12:10:12 -07:00 |
|
|
9366ec4a97
|
Allow promoting end-to-end traces too
|
2024-04-28 12:00:06 -07:00 |
|
|
0fb884eb07
|
Use implicit arguments for more things
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-28 11:43:49 -07:00 |
|
|
6b44ac1feb
|
Make graph arguments implicit where possible
|
2024-04-28 11:37:08 -07:00 |
|
|
69a4e8eb5c
|
Add some helpers and rewrite code
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-27 17:43:16 -07:00 |
|
|
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 |
|
|
316e56f2bc
|
Dip toes into creating end-to-end traces
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-27 15:27:46 -07:00 |
|
|
ab40a27e78
|
Formulate correctness of buildCfg using end-to-end traces
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-27 14:56:19 -07:00 |
|
|
f555947184
|
Promote traces through loop
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-27 14:38:07 -07:00 |
|
|
660f6594fd
|
Allow promoting traces through graph composition
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-27 14:28:00 -07:00 |
|
|
fb32315f58
|
Allow traces to be promoted through graph overlaying
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-27 14:18:16 -07:00 |
|
|
037358308f
|
Fix up Graph construction
|
2024-04-27 13:50:06 -07:00 |
|
|
f2b8084a9c
|
Delete code that won't be used for this approach
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-25 23:13:15 -07:00 |
|
|
c00c8e3e85
|
Use different graph operations to implement construction
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-25 23:10:41 -07:00 |
|
|
b134c143ca
|
Start working on proving 'sufficiency'
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-20 21:37:28 -07:00 |
|
|
e218d1b7a3
|
Add formalization of 'traces through graph'
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-20 21:36:58 -07:00 |
|
|
6e3f06ca5d
|
Add a new 'properties' module
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-20 20:25:40 -07:00 |
|
|
54b11d21b0
|
Start working on proving facts about graph construction
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-20 19:31:47 -07:00 |
|
|
f3e0d5f2e3
|
Use 'data' instead of aliases to prove reasoning properties
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-20 19:31:13 -07:00 |
|
|
855bf3f56c
|
Add functions to reason about the 'monotonic state' operations
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-20 18:09:01 -07:00 |
|
|
2f91ca113e
|
Make 'MonotonicPredicate' into another typeclass
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 20:56:56 -07:00 |
|
|
7571cb7451
|
Extract 'monotonic state' into its own module
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 20:46:30 -07:00 |
|
|
fc27b045d3
|
Remove nested module from Graphs
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 19:33:58 -07:00 |
|
|
de956cdc6a
|
Split the Language file into modules
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 18:39:38 -07:00 |
|
|
7ed7f20227
|
Add missing edge
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 15:30:07 -07:00 |
|
|
163108b9b3
|
Add precedence to some language constructs
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 15:29:50 -07:00 |
|
|
8dc5c40eae
|
Get everything compiling
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 14:13:44 -07:00 |
|
|
44f04e4020
|
Get forward analysis working again
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 14:08:40 -07:00 |
|
|
4fe0d147fa
|
Adjust 'Program' to have a graph and basic blocks
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 13:39:15 -07:00 |
|
|
ba1c9b3ec8
|
Remove sketch if proof since the proof is done
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 12:31:04 -07:00 |
|
|
b6e357787f
|
Add proof about 'both' and pairing
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-13 12:25:59 -07:00 |
|
|
ce3fa182fe
|
Start formalizing monotonic function predicates
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2024-04-12 23:49:33 -07:00 |
|