I'm all for simpler, faster, better, and narrow columns. But, the new Google+ has ridiculously narrow columns, and crappy red bands. They are so annoying that I actually stopped visiting G+ on a daily basis.

A learning algorithm for probabilistic logic programs.

Is there any static analyzer for detecting undefined behavior in C?

Last time when I posted a reading list, I ended up actually writing short reviews on my blog. (And at least in one case it appears I did not piss off the authors. Great achievement! :) ) Let's see if I can repeat this feat. The current reading list comes from reading the abstracts of POPL2015:

1. Brown, Palsberg, Self-Representation in Girard's System U
2. Pous, Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
3. Giacobazzi et al, Analyzing Program Analyses

I'll put a bonus as well. This one comes from Google Scholar's suggestions, and it looks like a good one:

4. Bjorner et al., Horn Clause Solving for Program Verification

TIL there's a St Petersburg in Florida, US.
(Disclaimer: It's possible that at some point in the past I knew; if so, I forgot.)

A year ago I wrote a blog post on Why do we fail? [rgrig.blogspot.com/2014/10/why-do-we-fail.html]
At some point I say this:

In On Abstraction Refinement for Program Analyses in Datalog we focused on cheap attempts. But, that's like trying to break code by throwing at it the smallest test cases: a fairly good strategy, actually, but not quite the best.

Well, I was thinking of something like what the attached document says.

Yes, but what would happen if elephants smoked weed?

"Looking over pronouns" http://languagelog.ldc.upenn.edu/nll/?p=21511 #others #feedly