FM 2009: Formal Methods: Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009, Proceedings
Ana Cavalcanti, Dennis Dams
Springer Science & Business Media, Oct 26, 2009 - Computers - 820 pages
th FM 2009, the 16 International Symposium on Formal Methods, marked the 10th an- versary of the First World Congress on Formal Methods that was held in 1999 in Toulouse, France. We wished to celebrate this by advertising and organizing FM 2009 as the Second World Congress in the FM series, aiming to once again bring together the formal methods communities from all over the world. The statistics displayed in the table on the next page include the number of countries represented by the Programme Committee members, as well as of the authors of submitted and accepted papers. Novel this year was a special track on tools and industrial applications. Subm- sions of papers on these topics were especially encouraged, but not given any special treatment. (It was just as hard to get a special track paper accepted as any other paper.) What we did promote, however, was a discussion of how originality, contri- tion, and soundness should be judged for these papers. The following questions were used by our Programme Committee.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abstract algorithm analysis application approach automatic behavior boolean bound clock components composition Computer concurrent conﬁguration constraints counterexample deﬁned deﬁnition denote diﬀerent dynamic encoding Event-B example execution expression fault-tolerant fault-tolerant systems ﬁelds ﬁle ﬁnal ﬁnite ﬁrst ﬂash formal methods formal verification formula function graph Heidelberg Hypervisor identiﬁers IEEE implementation inﬁnite initial inode input instance interface invariant Isabelle/HOL Kripke structure language linearizability linearization LNCS logic loop machine Mealy machines model checking node object operations output parameters partial order reduction path Petri net predicate program point proof properties protocol reduction reﬁned reﬁnement relation rules runtime satisﬁes Section semantics sequence speciﬁcation Springer statechart structure subset synchronization techniques temporal Theorem tion tool trace transformation transition system translation true UML-B update variables VDM++ veriﬁcation verify