fayalite/crates
Cesar Strauss fef7fea3ea Initial queue formal proof based on one-entry FIFO equivalence
For now, only check that the basic properties work in bounded model check
mode, leave the induction proof for later.

Partially replace the previously existing proof.

Remove earlier assumptions and bounds that don't apply for this proof.

Use parameterized types instead of hard-coded types.
2024-12-24 07:06:28 -03:00
..
fayalite Initial queue formal proof based on one-entry FIFO equivalence 2024-12-24 07:06:28 -03:00
fayalite-proc-macros clean up deps and move missed deps to workspace 2024-09-25 01:22:35 -07:00
fayalite-proc-macros-impl add ResetType to the list of recognized type bounds 2024-11-26 18:52:03 -08:00
fayalite-visit-gen clean up deps and move missed deps to workspace 2024-09-25 01:22:35 -07:00