Abstract is missing.
- A Calculus for Hybrid CSPJiang Liu, Jidong Lv, Zhao Quan, Naijun Zhan, Hengjun Zhao, Chaochen Zhou, Liang Zou. 1-15 [doi]
- Foundations of Quantum Programming (Extended Abstract)Mingsheng Ying. 16-20 [doi]
- From a Verified Kernel towards Verified SystemsGerwin Klein. 21-33 [doi]
- Reasoning about Computations Using Two-Levels of LogicDale Miller. 34-46 [doi]
- Typechecking Higher-Order Security LibrariesKarthikeyan Bhargavan, Cédric Fournet, Nataliya Guts. 47-62 [doi]
- Towards Deriving Type Systems and Implementations for CoroutinesKonrad Anton, Peter Thiemann. 63-79 [doi]
- Liberal Typing for Functional Logic ProgramsFrancisco Javier López-Fraguas, Enrique Martin-Martin, Juan Rodríguez-Hortalá. 80-96 [doi]
- A Provably Correct Stackless Intermediate Representation for Java BytecodeDelphine Demange, Thomas P. Jensen, David Pichardie. 97-113 [doi]
- JNI Light: An Operational Model for the Core JNIGang Tan. 114-130 [doi]
- An Interactive Tool for Analyzing Embedded SQL QueriesAivar Annamaa, Andrey Breslav, Jevgeni Kabanov, Varmo Vene. 131-138 [doi]
- Simple and Precise Widenings for ::::H::::-PolyhedraAxel Simon, Liqian Chen. 139-155 [doi]
- Metric Spaces and Termination AnalysesAziem Chawdhary, Hongseok Yang. 156-171 [doi]
- Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational SemanticsJan Hoffmann 0002, Martin Hofmann. 172-187 [doi]
- Interprocedural Control Flow ReconstructionAndrea Flexeder, Bogdan Mihaila, Michael Petter, Helmut Seidl. 188-203 [doi]
- Data Structure FusionPeter Hawkins, Alex Aiken, Kathleen Fisher, Martin C. Rinard, Mooly Sagiv. 204-221 [doi]
- Categorical Descriptional CompositionShin-ya Katsumata. 222-238 [doi]
- Bisimulation Proof Methods in a Path-Based Specification Language for Polynomial CoalgebrasXiao-cong Zhou, Yongji Li, Wen-jun Li, Hai-yan Qiao, Zhong-mei Shu. 239-254 [doi]
- Context-Preserving XQuery FusionHiroyuki Kato, Soichiro Hidaka, Zhenjiang Hu, Keisuke Nakano, Yasunori Ishihara. 255-270 [doi]
- Index-Compact Garbage CollectionLiangliang Tong, Francis C. M. Lau. 271-286 [doi]
- Live Heap Space Bounds for Real-Time SystemsMartin Kero, Pawel Pietrzak, Johan Nordlander. 287-303 [doi]
- A Quick Tour of the VeriFast Program VerifierBart Jacobs, Jan Smans, Frank Piessens. 304-311 [doi]
- Verification of Tree-Processing Programs via Higher-Order Model CheckingHiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi. 312-327 [doi]
- Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple TemplatesSoonho Kong, Yungbum Jung, Cristina David, Bow-Yaw Wang, Kwangkeun Yi. 328-343 [doi]
- Relational Parametricity for a Polymorphic Linear Lambda CalculusJianzhou Zhao, Qi Zhang, Steve Zdancewic. 344-359 [doi]
- A Certified Implementation of ML with Structural PolymorphismJacques Garrigue. 360-375 [doi]
- Type Inference for Sublinear Space Functional ProgrammingUgo Dal Lago, Ulrich Schöpp. 376-391 [doi]
- Liveness of Communicating Transactions (Extended Abstract)Edsko de Vries, Vasileios Koutavas, Matthew Hennessy. 392-407 [doi]
- Model Independent Order Relations for ProcessesChaodong He. 408-423 [doi]
- Concurrency Can t Be Observed, AsynchronouslyPaolo Baldan, Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale. 424-438 [doi]
- A Logical Mix of Approximation and SeparationAquinas Hobor, Robert Dockins, Andrew W. Appel. 439-454 [doi]