I was just reading Communications of the ACM and ran across the article mentioned here. I used to think that nobody knew how to do formal verification of “type unsafe” languages that stay close enough to the machine model to be highly performant. Pretty cool.
Posted June 8, 2010 by Dave Abrahams, under Uncategorized
One comment
