Paper Worth Reading: Demystifying magic: high-level low-level programming

Demystifying magic: high-level low-level programming Daniel Frampton, Stephen M. Blackburn, Perry Cheng, Robin J. Garner, David Grove, J. Eliot B. Moss, Sergey I. Salishev VEE ’09 Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (ACM)(PDF) This paper nicely discusses the need for low level language features in high level languages to …

Continue reading ‘Paper Worth Reading: Demystifying magic: high-level low-level programming’ »

Paper Worth Reading: Flow-sensitive type qualifiers

Flow-sensitive type qualifiers Jeffrey S. Foster, Tachio Terauchi, Alex Aiken PLDI ’02 (ACM)(PDF)(PDF) This is a very nice (if slightly complicated) approach to checking type qualifiers. The primary take aways are the pairing of flow insensative alias analysis with flow sensative qualifier analysis, the use of effect analysis (on abstract store locations), and the use …

Continue reading ‘Paper Worth Reading: Flow-sensitive type qualifiers’ »

A Paper Worth Reading: Code Generation in the Polyhedral Model Is Easier Than You Think

Code Generation in the Polyhedral Model Is Easier Than You Think Cedric Bastoul International Conference on Parallel Architectures and Compilation Techniques (PACT) ’04 (ACM)(PDF) While the ideas in this paper are interesting, the evaluation is poor to say the least. This is a part of my Papers Worth Reading series. To find other post in …

Continue reading ‘A Paper Worth Reading: Code Generation in the Polyhedral Model Is Easier Than You Think’ »

A Paper Worth Reading: Why cryptosystems fail

Why cryptosystems fail Ross Anderson CCS ’93 – Conference on Computer and Communications Security (ACM)(PDF) If you’re doing any form of security work (including PL design) and you haven’t read this, stop what you’re doing and do so. The key argument is that humans are the weakest link in any security system, not the technology. …

Continue reading ‘A Paper Worth Reading: Why cryptosystems fail’ »

Papers Worth Reading: PEG & Packrat

Posting these two together since they’re closely related and should probably be read together. Packrat parsing:: simple, powerful, lazy, linear time, functional pearl Bryan Ford ICFP ’02 (ACM)(PDF) Parsing expression grammars: a recognition-based syntactic foundation Bryan Ford POPL ’04 (ACM)(PDF) This is a part of my Papers Worth Reading series. To find other post in …

Continue reading ‘Papers Worth Reading: PEG & Packrat’ »

A Paper Worth Reading: Baggy Bounds Checking

Baggy bounds checking: an efficient and backwards-compatible defense against out-of-bounds errors Periklis Akritidis, Manuel Costa, Miguel Castro, Steven Hand USENIX Security Symposium 2009 (ACM) (PDF) This is pretty much the way to store bounds checking information for legacy code. Due to this line of work, the problem is largely considered solved in academia. (I slightly …

Continue reading ‘A Paper Worth Reading: Baggy Bounds Checking’ »

A Paper Worth Reading: EigenCFA

EigenCFA: accelerating flow analysis with GPUs Tarun Prabhu, Shreyas Ramalingam, Matthew Might, Mary Hall POPL 11 (ACM)(PDF) Lest anyone be confused, the GPU parts of this paper are not the particularly interesting ones. I found their formulation of the Control Flow Analysis problem as a linear algebra problem to be thought provoking. This is a …

Continue reading ‘A Paper Worth Reading: EigenCFA’ »

New Post Series: Papers Worth Reading

Starting today, I’m beginning a new series of posts that will go live every Friday. The idea behind the series is to highlight papers (or other technical material) that I’ve read and learned something from. I may sometimes provide a bit of commentary, but mostly the posts will be information about the paper itself. (This …

Continue reading ‘New Post Series: Papers Worth Reading’ »