Monday, February 1, 2010

Paper: Symbolic complexity bounds

With apologies for being late in posting this ...

 http://research.microsoft.com/en-us/um/people/sumitg/pubs/cav09_speed.pdf

Related project:
http://research.microsoft.com/en-us/um/people/sumitg/pubs/speed.html



Addendum Monday evening: Wow, I didn't understand much of that. It seems that they are describing a bunch of refinements to a basic technique that involves placing a counter variable in the code and then inferring numerical bounds on the counter. Unfortunately I don't understand that basic technique of using counter variables. There are gobs of citations to reference [9], which is a POPL 2009 paper. I had a look at that paper, though not a deep one ... it does seem to be more complete, but it too seems to be building on the basic technique with counters, and again without explanation. I guess it's supposed be something that the intended audience already knows. But I don't.

Anybody know something about this? I'm sure I can track it down, but I'm also pretty sure I can't do it before class tomorrow.

1 comment:

  1. I agree, I have been bouncing in and out on whether I should say that I picked a very simple paper or maybe I should try reading it again. I glanced at the bigger paper and you are right. I think his lecture slides when he gave his talk at the summer school made sense to me and could talk about that.

    I apologize for my misguidance.

    ReplyDelete