Abstract is missing.
- Language constructs for transactional memoryTim Harris. 1 [doi]
- A calculus of atomic actionsTayfun Elmas, Shaz Qadeer, Serdar Tasiran. 2-15 [doi]
- Proving that non-blocking algorithms don t blockAlexey Gotsman, Byron Cook, Matthew J. Parkinson, Viktor Vafeiadis. 16-28 [doi]
- A model of cooperative threadsMartín Abadi, Gordon D. Plotkin. 29-40 [doi]
- Static contract checking for HaskellDana N. Xu, Simon L. Peyton Jones, Koen Claessen. 41-52 [doi]
- Masked types for sound object initializationXin Qi, Andrew C. Myers. 53-65 [doi]
- Flexible types: robust type inference for first-class polymorphismDaan Leijen. 66-77 [doi]
- Modular code generation from synchronous block diagrams: modularity vs. code sizeRoberto Lublinerman, Christian Szegedy, Stavros Tripakis. 78-89 [doi]
- Formal certification of code-based cryptographic proofsGilles Barthe, Benjamin Grégoire, Santiago Zanella Béguelin. 90-101 [doi]
- Verifying liveness for asynchronous programsPierre Ganty, Rupak Majumdar, Andrey Rybalchenko. 102-113 [doi]
- A foundation for flow-based program matching: using temporal logic and model checkingJulien Brunel, Damien Doligez, René Rydhof Hansen, Julia L. Lawall, Gilles Muller. 114-126 [doi]
- SPEED: precise and efficient static estimation of program computational complexitySumit Gulwani, Krishna K. Mehra, Trishul M. Chilimbi. 127-139 [doi]
- Automatic modular abstractions for linear constraintsDavid Monniaux. 140-151 [doi]
- Wild control operatorsChris Barker. 152 [doi]
- Lazy evaluation and delimited controlRonald Garcia, Andrew Lumsdaine, Amr Sabry. 153-164 [doi]
- Bidirectionalization for free! (Pearl)Janis Voigtländer. 165-176 [doi]
- The third homomorphism theorem on trees: downward & upward lead to divide-and-conquerAkimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi. 177-185 [doi]
- A cost semantics for self-adjusting computationRuy Ley-Wild, Umut A. Acar, Matthew Fluet. 186-199 [doi]
- Copy-on-write in the PHP languageAkihiko Tozawa, Michiaki Tatsubori, Tamiya Onodera, Yasuhiko Minamide. 200-212 [doi]
- Feedback-directed barrier optimization in a strongly isolated STMNathan Grasso Bronson, Christos Kozyrakis, Kunle Olukotun. 213-225 [doi]
- Semi-sparse flow-sensitive pointer analysisBen Hardekopf, Calvin Lin. 226-238 [doi]
- A combination framework for tracking partition sizesSumit Gulwani, Tal Lev-Ami, Mooly Sagiv. 239-251 [doi]
- The theory of deadlock avoidance via discrete controlYin Wang, Stéphane Lafortune, Terence Kelly, Manjunath Kudlur, Scott A. Mahlke. 252-263 [doi]
- Equality saturation: a new approach to optimizationRoss Tate, Michael Stepp, Zachary Tatlock, Sorin Lerner. 264-276 [doi]
- Positive supercompilation for a higher order call-by-value languagePeter A. Jonsson, Johan Nordlander. 277-288 [doi]
- Compositional shape analysis by means of bi-abductionCristiano Calcagno, Dino Distefano, Peter W. O Hearn, Hongseok Yang. 289-300 [doi]
- Linear types for computational effectsAlex Simpson. 301 [doi]
- Unifying type checking and property checking for low-level codeJeremy Condit, Brian Hackett, Shuvendu K. Lahiri, Shaz Qadeer. 302-314 [doi]
- Local rely-guarantee reasoningXinyu Feng. 315-327 [doi]
- Classical BI: a logic for reasoning about dualising resourcesJames Brotherston, Cristiano Calcagno. 328-339 [doi]
- State-dependent representation independenceAmal Ahmed, Derek Dreyer, Andreas Rossberg. 340-353 [doi]
- Modeling abstract types in modules with open existential typesBenoît Montagu, Didier Rémy. 354-365 [doi]
- Focusing on pattern matchingNeelakantan R. Krishnaswami. 366-378 [doi]
- The semantics of x86-CC multiprocessor machine codeSusmit Sarkar, Peter Sewell, Francesco Zappa Nardelli, Scott Owens, Tom Ridge, Thomas Braibant, Magnus O. Myreen, Jade Alglave. 379-391 [doi]
- Relaxed memory models: an operational approachGérard Boudol, Gustavo Petri. 392-403 [doi]
- The semantics of progress in lock-based transactional memoryRachid Guerraoui, Michal Kapalka. 404-415 [doi]
- Types and higher-order recursion schemes for verification of higher-order programsNaoki Kobayashi. 416-428 [doi]
- Verifying distributed systems: the operational approachTom Ridge. 429-440 [doi]
- Automated verification of practical garbage collectorsChris Hawblitzel, Erez Petrank. 441-453 [doi]