Abstract is missing.
- Using Design Patterns in Formal Methods: An Event-B ApproachJean-Raymond Abrial, Thai Son Hoang. 1-2 [doi]
- A Unified Approach to Abstract Interpretation, Formal Verification and Testing of C/C++ ModulesJan Peleska. 3-22 [doi]
- The Three Platonic Models of Divergence-Strict CSPA. W. Roscoe. 23-49 [doi]
- Monotonic Abstraction in ActionParosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine. 50-65 [doi]
- Non-interleaving Semantics with Causality for Nondeterministic DataflowOana Agrigoroaiei, Gabriel Ciobanu. 66-80 [doi]
- Symbolic Reachability for Process Algebras with Recursive Data TypesStefan Blom, Jaco van de Pol. 81-95 [doi]
- Inclusion Test Algorithms for One-Unambiguous Regular ExpressionsHaiming Chen, Lei Chen. 96-110 [doi]
- Refinement of Kripke Models for DynamicsFrancien Dechesne, Simona Orzan, Yanjing Wang. 111-125 [doi]
- Tomorrow and All our Yesterdays: MTL Satisfiability over the IntegersCarlo A. Furia, Paola Spoletini. 126-140 [doi]
- A Theory of Pointers for the UTPWill Harwood, Ana Cavalcanti, Jim Woodcock. 141-155 [doi]
- Recasting Constraint Automata into Büchi AutomataMohammad Izadi, Marcello M. Bonsangue. 156-170 [doi]
- A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion VariablesFairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells. 171-185 [doi]
- Towards Efficient Verification of Systems with Dynamic Process CreationHanna Klaudel, Maciej Koutny, Elisabeth Pelz, Franck Pommereau. 186-200 [doi]
- An Observational Model for Transactional Calculus of Services OrchestrationJing Li, Huibiao Zhu, Jifeng He. 201-215 [doi]
- Everything Is PSPACE-Complete in Interaction SystemsMila E. Majster-Cederbaum, Christoph Minnameier. 216-227 [doi]
- A New Approach for the Construction of Multiway Decision GraphsYassine Mokhtari, Sa ed Abed, Otmane Aït Mohamed, Sofiène Tahar, Xiaoyu Song. 228-242 [doi]
- Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent ProgramsMasaki Murakami. 243-257 [doi]
- Guided Test Generation from CSP ModelsSidney Nogueira, Augusto Sampaio, Alexandre Mota. 258-273 [doi]
- Relaxing Goodness Is Still GoodGordon J. Pace, Gerardo Schneider. 274-289 [doi]
- Benchmarking Model- and Satisfiability-Checking on Bi-infinite TimeMatteo Pradella, Angelo Morzenti, Pierluigi San Pietro. 290-304 [doi]
- Formal Analysis of Workflows Using UML 2.0 Activities and Graph Transformation SystemsVahid Rafe, Adel Torkaman Rahmani. 305-318 [doi]
- Testing Concurrent Objects with Application-Specific SchedulersRudolf Schlatte, Bernhard K. Aichernig, Frank S. de Boer, Andreas Griesmayer, Einar Broch Johnsen. 319-333 [doi]
- A Theory of Bounded Fair SchedulingJens Schönborn, Marcel Kyas. 334-348 [doi]
- Fair Exchange Is Incomparable to ConsensusSimona Orzan, Muhammad Torabi Dashti. 349-363 [doi]
- Automatic Generation of CSP || B Skeletons from xUML ModelsEdward Turner, Helen Treharne, Steve Schneider, Neil Evans. 364-379 [doi]
- Bounded Model Checking for Partial Kripke StructuresHeike Wehrheim. 380-394 [doi]
- Verification of Linear Duration Invariants by Model Checking CTL PropertiesMiaomiao Zhang, Dang Van Hung, Zhiming Liu. 395-409 [doi]
- Exact Response Time Scheduling Analysis of Accumulatively Monotonic Multiframe Real Time TasksAreej Zuhily, Alan Burns. 410-424 [doi]
- Endomorphisms for Non-trivial Non-linear Loop Invariant GenerationRachid Rebiha, Nadir Matringe, Arnaldo Vieira Moura. 425-439 [doi]
- Instantiation for Parameterised Boolean Equation SystemsArthur van Dam, Bas Ploeger, Tim A. C. Willemse. 440-454 [doi]