Abstract is missing.
- Domain Theory: Practice and Theories A Discussion of Possible Research TopicsDines Bjørner. 1-17 [doi]
- Linking Semantic ModelsJifeng He. 18-33 [doi]
- Discovering Non-linear Ranking Functions by Solving Semi-algebraic SystemsYinghua Chen, Bican Xia, Lu Yang, Naijun Zhan, Chaochen Zhou. 34-49 [doi]
- Mobile Ambients with Timers and TypesBogdan Aman, Gabriel Ciobanu. 50-63 [doi]
- Automatic Refinement of Split Binary SemaphoreDamián Barsotti, Javier O. Blanco. 64-78 [doi]
- Stepwise Development of Simulink Models Using the Refinement Calculus FrameworkPontus Boström, Lionel Morel, Marina A. Waldén. 79-93 [doi]
- Bisimulations for a Distributed Higher Order ::::pi:::: -CalculusZining Cao. 94-108 [doi]
- A Complete and Compact Propositional Deontic LogicPablo F. Castro, T. S. E. Maibaum. 109-123 [doi]
- Verifying Lock-Freedom Using Well-Founded OrdersRobert Colvin, Brijesh Dongol. 124-138 [doi]
- Tree Components Programming: An Application to XMLPascal Coupey, Christophe Fouqueré, Jean-Vincent Loddo. 139-153 [doi]
- A Framework for Incorporating Trust into Formal Systems DevelopmentFredrik Degerlund, Kaisa Sere. 154-168 [doi]
- A Higher-Order Demand-Driven Narrowing Calculus with Definitional TreesRafael del Vado Vírseda. 169-184 [doi]
- Distributed Time-Asynchronous AutomataCatalin Dima, Ruggero Lanotte. 185-200 [doi]
- Skolem Machines and Geometric LogicJohn Fisher, Marc Bezem. 201-215 [doi]
- A Logical Calculus for Modelling InterferencesChristophe Fouqueré. 216-230 [doi]
- Reflection and Preservation of Properties in Coalgebraic (bi)SimulationsIgnacio Fábregas, Miguel Palomino, David de Frutos-Escrig. 231-245 [doi]
- Controlling Process Modularity in Mobile ComputingTakashi Kitamura, Huimin Lin. 246-259 [doi]
- Failures: Their Definition, Modelling and AnalysisBrian Randell, Maciej Koutny. 260-274 [doi]
- C-clock-WS: A Timed Service-Oriented CalculusAlessandro Lapadula, Rosario Pugliese, Francesco Tiezzi. 275-290 [doi]
- Regular Linear Temporal LogicMartin Leucker, César Sánchez. 291-305 [doi]
- Algebraic Semantics for Compensable TransactionsJing Li, Huibiao Zhu, Jifeng He. 306-321 [doi]
- Axiomatizing Extended Temporal Logic Fragments Via InstantiationWanwei Liu, Ji Wang, Wei Dong, Huowang Chen. 322-336 [doi]
- Deciding Weak Bisimilarity of Normed Context-Free Processes Using TableauXinxin Liu, Haiyan Chen. 337-350 [doi]
- Linear Context Free LanguagesRoussanka Loukanova. 351-365 [doi]
- FM for FMS: Lessons Learned While Applying Formal Methods to the Study of Flexible Manufacturing SystemsAndrea Matta, Matteo Rossi, Paola Spoletini, Dino Mandrioli, Quirico Semeraro, Tullio Tolio. 366-380 [doi]
- On Equality Predicates in Algebraic Specification LanguagesMasaki Nakamura, Kokichi Futatsugi. 381-395 [doi]
- Data-Distributions in ::::PowerList:::: TheoryVirginia Niculescu. 396-409 [doi]
- Quasi-interpretation Synthesis by DecompositionGuillaume Bonfante, Jean-Yves Marion, Romain Péchoux. 410-424 [doi]
- Composing Transformations to Optimize Linear CodeThomas Noll, Stefan Rieger. 425-439 [doi]
- Building Extended Canonizers by Graph-Based DeductionSilvio Ranise, Christelle Scharff. 440-454 [doi]
- A Randomized Algorithm for BBCSPs in the Prover-Verifier ModelK. Subramani. 455-466 [doi]
- On the Expressive Power of QLTLZhilin Wu. 467-481 [doi]