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’ »

Parallel Hinted Collection (Writeup for CS 267)

The following is a brief writeup for homework 0 of the parallel computing class I’m currently enrolled in at Berkeley. Note, if you are an ISMM 2013 reviewer, please do NOT read this. The contents build off a paper which is currently under submission. Bio: I am a EECS graduate student who currently works on …

Continue reading ‘Parallel Hinted Collection (Writeup for CS 267)’ »

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’ »