Abstract is missing.
- Why dependent types matterJames McKinna. 1 [doi]
- The next 700 data description languagesKathleen Fisher, Yitzhak Mandelbaum, David Walker. 2-15 [doi]
- A hierarchical model of data localityChengliang Zhang, Chen Ding, Mitsunori Ogihara, Yutao Zhong, Youfeng Wu. 16-29 [doi]
- Simplifying reductionsGautam Gupta, Sanjay V. Rajopadhye. 30-41 [doi]
- Formal certification of a compiler back-end or: programming a compiler with a proof assistantXavier Leroy. 42-54 [doi]
- Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementationsSteve Bishop, Matthew Fairbairn, Michael Norrish, Peter Sewell, Michael Smith, Keith Wansbrough. 55-66 [doi]
- Decidability and proof systems for language-based noninterference relationsMads Dam. 67-78 [doi]
- On flow-sensitive security typesSebastian Hunt, David Sands. 79-90 [doi]
- A logic for information flow in object-oriented programsTorben Amtoft, Sruthi Bandhakavi, Anindya Banerjee. 91-102 [doi]
- Polymorphic regular tree types and patternsJerome Vouillon. 103-114 [doi]
- Verifying properties of well-founded linked listsShuvendu K. Lahiri, Shaz Qadeer. 115-126 [doi]
- Environment analysis via Delta CFAMatthew Might, Olin Shivers. 127-140 [doi]
- Small bisimulations for reasoning about higher-order imperative programsVasileios Koutavas, Mitchell Wand. 141-152 [doi]
- A fixpoint calculus for local and global program flowsRajeev Alur, Swarat Chaudhuri, P. Madhusudan. 153-165 [doi]
- The Scala experiment: can we provide better language support for component systems?Martin Odersky. 166-167 [doi]
- Adventures in time and spaceNorman Danner, James S. Royer. 168-179 [doi]
- ::::N::::-synchronous Kahn networks: a relaxed model of synchrony for real-time systemsAlbert Cohen, Marc Duranton, Christine Eisenbeis, Claire Pagetti, Florence Plateau, Marc Pouzet. 180-193 [doi]
- Compiler-directed channel allocation for saving power in on-chip networksGuangyu Chen, Feihui Li, Mahmut T. Kandemir. 194-205 [doi]
- Fast and loose reasoning is morally correctNils Anders Danielsson, John Hughes, Patrik Jansson, Jeremy Gibbons. 206-217 [doi]
- Modular set-based analysis from contractsPhilippe Meunier, Robby Findler, Matthias Felleisen. 218-231 [doi]
- Stratified type inference for generalized algebraic data typesFrançois Pottier, Yann Régis-Gianas. 232-244 [doi]
- Hybrid type checkingCormac Flanagan. 245-256 [doi]
- A polymorphic modal type system for lisp-like multi-staged languagesIk-Soon Kim, Kwangkeun Yi, Cristiano Calcagno. 257-268 [doi]
- The next mainstream programming language: a game developer s perspectiveTim Sweeney. 269 [doi]
- A virtual class calculusErik Ernst, Klaus Ostermann, William R. Cook. 270-282 [doi]
- Interruptible iteratorsJed Liu, Aaron Kimball, Andrew C. Myers. 283-294 [doi]
- Specifying C++ conceptsGabriel Dos Reis, Bjarne Stroustrup. 295-308 [doi]
- Frame rules from answer types for code pointersHayo Thielecke. 309-319 [doi]
- Certified assembly programming with embedded code pointersZhaozhong Ni, Zhong Shao. 320-333 [doi]
- Associating synchronization constraints with data in an object-oriented languageMandana Vaziri, Frank Tip, Julian Dolby. 334-345 [doi]
- Autolocker: synchronization inference for atomic sectionsBill McCloskey, Feng Zhou, David Gay, Eric A. Brewer. 346-358 [doi]
- Protecting representation with effect encapsulationYi Lu 0003, John Potter. 359-371 [doi]
- The essence of command injection attacks in web applicationsZhendong Su, Gary Wassermann. 372-382 [doi]
- Harmless adviceDaniel S. Dantas, David Walker. 383-396 [doi]
- A verifiable SSA program representation for aggressive compiler optimizationVijay Menon, Neal Glew, Brian R. Murphy, Andrew McCreight, Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Leaf Petersen. 397-408 [doi]
- Staged allocation: a compositional technique for specifying and implementing procedure calling conventionsReuben Olinsky, Christian Lindig, Norman Ramsey. 409-421 [doi]