1-2-6

[bubblingbeebles]

I think I missed my traditional semester-retrospect post last season, and I notice I've been on a record-breaking streak of "not making livejournal posts" (it's been almost 2 months; I think the last record is about one month). I guess it's time to break out the old keyboard again

Comments

[oniugnip]

... how AI planning tools can be used to verify program execution...

Neat! Looking at your writeup now, that sounds interesting.

[bubblingbeebles]

I think the consensus was that actual model checkers are strictly better. One thing I thought was neat was that planners have no trouble with infinite-looping programs (presumably through some graph analysis related to the one we learned about in class that I barely understand). Sully figured standard model checkers would also have no trouble with it, which I'm not convinced of but willing to believe.

[edanaher]

Huh... I like your slides on debugging. I really need to sit down and give a talk at Ooyala on debugging; between your thoughts, jwise's, and my own from the past year, I've probably got a pretty good presentation in the making....

Also, borrowed pointers look interesting. I should actually read that instead of just skimming it...

[bubblingbeebles]

I was pretty proud of those slides. The one thing that's not in them is interactive debuggers -- which I gave a lecture on the subsequent week, drawing a line graph of space (list of functions) vs time (elapsed instructions) for a simple program, and drawing arrows on the graph to indicate what each GDB command does (next, step, and bt).

Let me know if/when you get your own presentation together; I'd like to see it.