Abstract is missing.
- X10: Concurrent Programming for Modern ArchitecturesVijay A. Saraswat. 1 [doi]
- The Nuggetizer: Abstracting Away Higher-Orderness for Program VerificationParitosh Shroff, Christian Skalka, Scott F. Smith. 2-18 [doi]
- Local Reasoning for Storable Locks and ThreadsAlexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, Mooly Sagiv. 19-37 [doi]
- Monadic, Prompt Lazy Assertions in HaskellOlaf Chitil, Frank Huch. 38-53 [doi]
- Translation Correctness for First-Order Object-Oriented Pattern MatchingBurak Emir, Qin Ma, Martin Odersky. 54-70 [doi]
- Persistent Oberon: A Programming Language with Integrated PersistenceLuc Bläser. 71-85 [doi]
- More Typed Assembly Languages for ConfidentialityDachuan Yu. 86-104 [doi]
- A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns SemanticsLingzhong Zhao, Tianlong Gu, Junyan Qian, Guoyong Cai. 105-121 [doi]
- On a Tighter Integration of Functional and Logic ProgrammingBernd Braßel, Frank Huch. 122-138 [doi]
- Scalable Simulation of Cellular Signaling NetworksVincent Danos, Jérôme Feret, Walter Fontana, Jean Krivine. 139-157 [doi]
- Timed, Distributed, Probabilistic, Typed ProcessesMartin Berger, Nobuko Yoshida. 158-174 [doi]
- A Probabilistic Applied Pi-CalculusJean Goubault-Larrecq, Catuscia Palamidessi, Angelo Troina. 175-190 [doi]
- Type-Based Verification of Correspondence Assertions for Communication ProtocolsDaisuke Kikuchi, Naoki Kobayashi. 191-205 [doi]
- Deriving Compilers and Virtual Machines for a Multi-level LanguageAtsushi Igarashi, Masashi Iwaki. 206-221 [doi]
- Finally Tagless, Partially EvaluatedJacques Carette, Oleg Kiselyov, Chung-chieh Shan. 222-238 [doi]
- Polymorphic Delimited ContinuationsKenichi Asai, Yukiyoshi Kameyama. 239-254 [doi]
- Adjunct Elimination in Context Logic for TreesCristiano Calcagno, Thomas Dinsdale-Young, Philippa Gardner. 255-270 [doi]
- Positive Arithmetic Without Exchange Is a Subclassical LogicStefano Berardi, Makoto Tatsuta. 271-285 [doi]
- Mixed Inductive/Coinductive Types and Strong NormalizationAndreas Abel. 286-301 [doi]
- Static and Dynamic Analysis: Better TogetherSriram K. Rajamani. 302 [doi]
- The Semantics of Semantic Patches in Coccinelle: Program Transformation for the Working ProgrammerNeil D. Jones, René Rydhof Hansen. 303-318 [doi]
- An Efficient SSA-Based Algorithm for Complete Global Value NumberingJiu-Tao Nie, Xu Cheng. 319-334 [doi]
- A Systematic Approach to Probabilistic Pointer AnalysisAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. 335-350 [doi]
- Complete Lattices and Up-To TechniquesDamien Pous. 351-366 [doi]
- A Trace Based Bisimulation for the Spi Calculus: An Extended AbstractAlwen Tiu. 367-382 [doi]
- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of DivergenceJesús Aranda, Cinzia Di Giusto, Mogens Nielsen, Frank D. Valencia. 383-398 [doi]
- Call-by-Name and Call-by-Value in Normal Modal LogicYoshihiko Kakutani. 399-414 [doi]
- Call-by-Value Is Dual to Call-by-Name, ExtendedDaisuke Kimura. 415-430 [doi]