Formal Methods and Software Engineering: 7th International Conference on Formal Engineering Methods, ICFEM 2005, Manchester, UK, November 1-4, 2005, Proceedings
Kung-Kiu Lau, Richard Banach
Springer Science & Business Media, Oct 27, 2005 - Computers - 502 pages
This volume contains papers presented at the 7th International Conference on Formal Engineering Methods (ICFEM 2005), 1-4 November 2005, Manchester, UK. Formal engineering methods are changing the way that systems are dev- oped. With language and tool support, these methods are being used for se- automatic code generation, and for the automatic abstraction and checking of implementations. In the future, they will be used at every stage of development: requirements, speci?cation, design, implementation, testing, anddocumentation. The aim of ICFEM 2005 was to bring together those interested in the - plication of formal engineering methods to computer systems. Researchers and practitioners, from industry, academia, and government, were encouraged to - tend, and to help advance the state of the art. The conference was supported by sponsorships from Microsoft Research, USA, the Software Engineers Association of Japan, the University of Man- ester, Manchester City Council, FormalMethods Europe (FME) and the British Computer Society FormalAspects ofComputing Specialist Group(BCS-FACS). We wish to thank these sponsors for their generosity. The ?nal programme consisted of 3 invited talks and 30 technical papers selected from a total of 74 submissions. The invited speakers were: Anthony Hall, independent consultant, UK; Egon B] orger, University of Pisa, Italy; John Rushby, SRI, USA. Their talks were sponsored by BCS-FACS, Microsoft - search and FME respectively. We wish to thank the invited speakers for their inspiring talks.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Formal Methods and Software Engineering: 7th International Conference on ...
Kung-Kiu Lau,Richard Banach
No preview available - 2005
abstract machine Abstract State Machines actions algorithm analysis AODV application approach architecture automaton block communication component conﬁguration connector corresponding data concepts deadlock deﬁned deﬁnition denoted diagram diﬀerent dynamic eﬀect event example execution ﬁnd ﬁnite ﬁrst formal methods formal speciﬁcation formal veriﬁcation function game semantics global transitions Hoare logic Hoare triple ICFEM identiﬁed implementation initial input interaction interface automata invariant Kripke structure language lemma LNCS logic loop LSCs memory model checking module node notation Object-Z operation output OWL-S OZTA parallel composition pattern precondition predicate Proc procedure process transitions proof obligations ProofPower properties protocol prove pseudostates reachable reﬁned reﬁnement relation represents request satisﬁes schema script Section semantics sequence simulation Simulink Springer-Verlag statement strategy structure synchronization theorem prover tion tool updates variables veriﬁcation