Abstract is missing.
- Invariants and Well-Foundedness in Program AlgebraIan J. Hayes. 1-14 [doi]
- A Theory of Software Product Line RefinementPaulo Borba, Leopoldo Teixeira, Rohit Gheyi. 15-43 [doi]
- The TLA:::+::: Proof System: Building a Heterogeneous Verification PlatformKaustuv Chaudhuri, Damien Doligez, Leslie Lamport, Stephan Merz. 44 [doi]
- Subtyping Algorithm of Regular Tree Grammars with Disjoint Production RulesLei Chen, Haiming Chen. 45-59 [doi]
- Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and EvolutionJacques Chabin, Mirian Halfeld Ferrari Alves, Martin A. Musicante, Pierre Réty. 60-75 [doi]
- Tracking Down the Origins of Ambiguity in Context-Free GrammarsH. J. S. Basten. 76-90 [doi]
- Prioritized slotted-CircusPawel Gancarski, Andrew Butterfield. 91-105 [doi]
- A Denotational Semantical Model for Orc LanguageQin Li, Huibiao Zhu, Jifeng He. 106-120 [doi]
- An Extended cCSP with Stable Failures SemanticsZhenbang Chen, Zhiming Liu. 121-136 [doi]
- Preference and Non-deterministic ChoiceBill Stoddart, Frank Zeyda, Steve Dunne. 137-152 [doi]
- Material Flow Abstraction of Manufacturing SystemsJewgenij Botaschanjan, Benjamin Hummel. 153-167 [doi]
- Specification and Verification of a MPI Implementation for a MP-SoCUmberto Souza da Costa, Ivan Soares de Medeiros Júnior, Marcel Vinicius Medeiros Oliveira. 168-183 [doi]
- Testing of Abstract ComponentsBilal Kanso, Marc Aiguier, Frédéric Boulanger, Assia Touil. 184-198 [doi]
- Scalable Distributed Concolic Testing: A Case Study on a Flash Storage PlatformYunho Kim, Moonzoo Kim, Nam Dang. 199-213 [doi]
- Analyzing a Formal Specification of Mondex Using Model CheckingReng Zeng, Xudong He. 214-229 [doi]
- Formal Modelling of Separation Kernel ComponentsAndrius Velykis, Leo Freitas. 230-244 [doi]
- Mechanized Verification with SharingJ. Gregory Malecha, Greg Morrisett. 245-259 [doi]
- Industrial-Strength Certified SAT Solving through Verified SAT Proof CheckingAshish Darbari, Bernd Fischer, João Marques-Silva. 260-274 [doi]
- Dynamite 2.0: New Features Based on UnSAT-Core Extraction to Improve Verification of Software RequirementsMariano M. Moscato, Carlos López Pombo, Marcelo F. Frias. 275-289 [doi]
- Complete Calculi for Structured Specifications in Fork AlgebraCarlos Gustavo López Pombo, Marcelo Fabiùn Frias. 290-305 [doi]
- Towards Managing Dynamic Reconfiguration of Software Systems in a Categorical SettingPablo F. Castro, Nazareno Aguirre, Carlos Gustavo López Pombo, T. S. E. Maibaum. 306-321 [doi]
- Characterizing Locality (Encapsulation) with BisimulationPablo F. Castro, T. S. E. Maibaum. 322-336 [doi]
- Justification Logic and History Based ComputationFrancisco Bavera, Eduardo Bonelli. 337-351 [doi]
- A Class of Greedy Algorithms and Its Relation to GreedoidsSrinivas Nedunuri, Douglas R. Smith, William R. Cook. 352-366 [doi]
- On Arithmetic Computations with Hereditarily Finite Sets, Functions and TypesPaul Tarau. 367-381 [doi]
- A Modality for Safe Resource Sharing and Code ReentrancyRui Shi, Dengping Zhu, Hongwei Xi. 382-396 [doi]