Abstract is missing.
- NetKAT - A Formal System for the Verification of NetworksDexter Kozen. 1-18 [doi]
- Optimized Compilation of Multiset Rewriting with ComprehensionsEdmund Soon Lee Lam, Iliano Cervesato. 19-38 [doi]
- Logic Programming and Logarithmic SpaceClément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller. 39-57 [doi]
- Automatic Memory Management Based on Program Transformation Using OwnershipTatsuya Sonobe, Kohei Suenaga, Atsushi Igarashi. 58-77 [doi]
- The Essence of RubyKatsuhiro Ueno, Yutaka Fukasawa, Akimasa Morihata, Atsushi Ohori. 78-98 [doi]
- Types for Flexible ObjectsZachary Palmer, Pottayil Harisanker Menon, Alexander Rozenshteyn, Scott F. Smith. 99-119 [doi]
- A Translation of Intersection and Union Types for the λμ-CalculusKentaro Kikuchi, Takafumi Sakurai. 120-139 [doi]
- A Formalized Proof of Strong Normalization for Guarded Recursive TypesAndreas Abel, Andrea Vezzosi. 140-158 [doi]
- Functional Pearl: Nearest Shelters in ManhattanShin-Cheng Mu, Ting-Wei Chen. 159-175 [doi]
- Suppl: A Flexible Language for PoliciesRobert Dockins, Andrew P. Tolmach. 176-195 [doi]
- A Method for Scalable and Precise Bug Finding Using Program Analysis and Model CheckingManuel Valdiviezo, Cristina Cifuentes, Padmanabhan Krishnan. 196-215 [doi]
- Model-Checking for Android Malware DetectionFu Song, Tayssir Touili. 216-235 [doi]
- Necessary and Sufficient Preconditions via Eager AbstractionMohamed Nassim Seghir, Peter Schrammel. 236-254 [doi]
- Resource Protection Using Atomics - Patterns and VerificationAfshin Amighi, Stefan Blom, Marieke Huisman. 255-274 [doi]
- Resource Analysis of Complex Programs with Cost EquationsAntonio Flores-Montoya, Reiner Hähnle. 275-295 [doi]
- Simple and Efficient Algorithms for OctagonsAziem Chawdhary, Ed Robbins, Andy King. 296-313 [doi]
- Compositional Entailment Checking for a Fragment of Separation LogicConstantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar. 314-333 [doi]
- Automatic Constrained Rewriting Induction towards Verifying Procedural ProgramsCynthia Kop, Naoki Nishida 0001. 334-353 [doi]
- A ZDD-Based Efficient Higher-Order Model Checking AlgorithmTaku Terao, Naoki Kobayashi. 354-371 [doi]
- Inferring Grammatical Summaries of String ValuesSe-Won Kim, Wooyoung Chin, Jimin Park, Jeongmin Kim, Sukyoung Ryu. 372-391 [doi]
- Syntax-Directed Divide-and-Conquer Data-Flow AnalysisShigeyuki Sato, Akimasa Morihata. 392-407 [doi]
- Address Chain: Profiling Java Objects without Overhead in Java HeapsXiaohua Shi, Junru Xie, Hengyang Yu. 408-427 [doi]
- Call-by-Value in a Basic Logic for InteractionUlrich Schöpp. 428-448 [doi]
- A Precise and Abstract Memory Model for C Using Symbolic ValuesFrédéric Besson, Sandrine Blazy, Pierre Wilke. 449-468 [doi]
- Hereditary History-Preserving Bisimilarity: Logics and AutomataPaolo Baldan, Silvia Crafa. 469-488 [doi]