Formal Methods in System Design

215	--	251	Lars Michael Kristensen, K. Schmidt, Antti Valmari. Question-guided stubborn set methods for state properties
253	--	293	Peter Csaba Ölveczky, José Meseguer, Carolyn L. Talcott. Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
295	--	344	Marsha Chechik, Arie Gurfinkel, Benet Devereux, Albert Y. C. Lai, Steve M. Easterbrook. Data structures for symbolic multi-valued model-checking

115	--	116	Lubos Brim, Martin Leucker. Foreword
117	--	134	Jiri Barnat, Ivana Cerná. Distributed breadth-first search LTL model checking
135	--	155	Cornelia P. Inggs, Howard Barringer. CTL:::*::: model checking on a shared-memory architecture
157	--	175	Orna Grumberg, Tamir Heyman, Assaf Schuster. A work-efficient distributed algorithm for reachability analysis
177	--	196	Alexander Bell, Boudewijn R. Haverkort. Distributed disk-based algorithms for model checking very large Markov chains
197	--	214	Víctor A. Braberman, Alfredo Olivero, Fernando Schapachnik. Dealing with practical limitations of distributed timed model checking for timed automata

1	--	31	Wan Fokkink, Jun Pang, Jaco van de Pol. Cones and foci: A mechanical framework for protocol verification
33	--	78	Marta Z. Kwiatkowska, Gethin J. Norman, David Parker, Jeremy Sproston. Performance analysis of probabilistic timed automata using digital clocks
79	--	95	Nicolas Halbwachs, David Merchat, Laure Gonnord. Some ways to reduce the space dimension in polyhedra computations
97	--	114	Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani. On using priced timed automata to achieve optimal scheduling

External Links