Modelling and Analysis of Distributed and Reactive Systems using Evolving Algebras

This is a tutorial introduction into the evolving algebra approach to design and veriication of complex computing systems. It is written to be used by the working computer scientist. We explain the salient features of the methodology by showing how one can develop from scratch an easily understandable and transparent evolving algebra model for PVM, the widespread virtual architecture for heterogeneous distributed computing.

[1]  Egon Börger,et al.  CLAM specification for provably correct compilation of CLP( R ) programs , 1993, Specification and validation methods.

[2]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  Egon Börger,et al.  A formal method for provably correct composition of a real-life processor out of basic components. (The APE100 Reverse Engineering Study) , 1995, Proceedings of First IEEE International Conference on Engineering of Complex Computer Systems. ICECCS'95.

[4]  David Lorge Parnas,et al.  Information Distribution Aspects of Design Methodology , 1971, IFIP Congress.

[5]  Egon Brger,et al.  Formal de nition of an abstract VHDL''''93 simulator by EA - machines , 1995 .

[6]  Jack Dongarra,et al.  Pvm 3 user's guide and reference manual , 1993 .

[7]  Egon Börger,et al.  Occam: Specification and Compiler Correctness - Part I: The Primary Model , 1994, PROCOMET.

[8]  Egon Börger,et al.  Correctness of Compiling Occam to Transputer Code , 1996, Comput. J..

[9]  Jack J. Dongarra,et al.  The PVM Concurrent Computing System: Evolution, Experiences, and Trends , 1994, Parallel Comput..

[10]  Yuri Gurevich,et al.  The Semantics of the C Programming Language , 1992, CSL.

[11]  Michael Marcotty,et al.  The World of Programming Languages , 1987, Springer Books on Professional Computing.

[12]  Egon Börger,et al.  The WAM - Definition and Compiler Correctness , 1995, Logic Programming: Formal Methods and Practical Applications.

[13]  藤林 信也.  Niklaus Wirth 著, "Algorithms + Data Structures = Programs", Prentice-Hall Inc., B5 変形判, 366p, \5,730, 1976 , 1977 .

[14]  S. Mazzanti,et al.  A Correctness Proof for Pipelining in RISC Architecture , 1996 .

[15]  Bart Demoen,et al.  A Framework to Specify Database Update Views for Prolog , 1991, PLILP.

[16]  Jack Dongarra,et al.  PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing , 1995 .

[17]  Christoph Beierle,et al.  A WAM Extension for Type-Constraint Logic Programming: Specification and Correctness Proof , 1991, IWBS Report.

[18]  Uwe Gll.  Systems Level Speciication and Modelling of Reactive Systems: Concepts, Methods, and Tools ? , 1995 .

[19]  Yuri Gurevich,et al.  Group membership protocol: specification and verification , 1995, Specification and validation methods.

[20]  Egon Börger,et al.  Towards a Mathematical Specification of the APE100 Architecture: The APESE Model , 1994, IFIP Congress.

[21]  Egon B Orger,et al.  A Mathematical Deenition of Full Prolog , 1994 .

[22]  Uwe Glasserb,et al.  A Formal Speciication of the Pvm Architecture , 1994 .

[23]  Peter D. Mosses.  Action Semantics , 1986, ADT.

[24]  Egon Börger.  Logic Programming: The Evolving Algebra Approach , 1994, IFIP Congress.

[25]  Peter H. Schmitt,et al.  A Formal Operational Semantics for Languages of Type Prolog III , 1990, CSL.