Progress on treecc and cwm.
Hacking CWM scripts to process the GCC rdf output of the introspector.
Soon we will have a script that will convert a c program into a skeleton RDF ontology!
Is it possible transform this CWM proof into a perl program that uses redland directly. Or a C++ program?
How can you make CWM dump all the data about the proof and how it is executing it so that it is possible to optimize it.
Maybe a trace of the execution in such a way that it is easy to recognise reoccuring elements. It should be possible to turn the proof into a Finite state automaton.