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

Analysis

Split the Language file into modules

2024-04-13 18:39:38 -07:00

Language

Prove that graphs build by buildCfg are sufficient

2024-04-29 20:57:43 -07:00

Lattice

Adjust behavior of eval to not require constant 'k in vars' threading

2024-03-22 17:15:40 -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

Use different graph operations to implement construction

2024-04-25 23:10:41 -07:00

Lattice.agda

Get forward analysis working again

2024-04-13 14:08:40 -07:00

Main.agda

Get everything compiling

2024-04-13 14:13:44 -07:00

Showable.agda

Use instances to simplify printing code

2024-03-11 12:50:05 -07:00

Utils.agda

Use different graph operations to implement construction

2024-04-25 23:10:41 -07:00

Description

Attempts at formalizing static program analysis techniques in Agda.

2.3 MiB

Languages

Agda 100%