One kind of cool thing I did at CMU (with others) is mechanize verified proof checker for Datalog traces: github.com/secure-found...
Given a trace made by an untrusted solver, the Dafny code replays the trace and builds a proof tree in ghost. By construction, only valid proof trees can be created
10 months ago
1
0
0
0