## Why use evolving algebras for hardware and software engineering? (1995)

Citations: | 38 - 4 self |

### BibTeX

@MISC{Börger95whyuse,

author = {Egon Börger},

title = {Why use evolving algebras for hardware and software engineering? },

year = {1995}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper I answer the question how evolving algebras can be used for the design and analysis of complex hardware and software systems. I present the salient features of this new method and illustrate them through several examples from my work on specification and verification of programming languages, compilers, protocols and architectures. The definition of a mathematical model for Hennessy and Patterson's RISC architecture DLX serves as a running example; this model is used in [24] to prove the correctness of instruction pipelining. I will point out the yet unexplored potential of the evolving algebra method for large-scale industrial applications.

### Citations

4280 |
Computer Architecture, A Quantitative Approach
- Hennessy, Paterson
- 2003
(Show Context)
Citation Context ..., protocols and architectures (see [11] for an annotated bibliography complete up to 1994). The running technical example is an abstract mathematical de nition of the well known RISC architecture DLX =-=[49]-=-. For DLX the notion of sequential evolving algebra su ces� note however that in [41] this notion has been extended to that of distributed evolving algebras which turned out to be natural and powerful... |

1619 | The definition of Standard ML
- Milner, Tofte, et al.
- 1997
(Show Context)
Citation Context ...ntics. The semantic rules are used to answer questions about the meaning of program constructs. Theorems justify particular design decisions and are typically proved by induction on the programs, see =-=[61, 62]-=-. In the communities of functional and logic programming and of arti cial intelligence it is still rather common to identify abstract with equational or declarative as opposed to operational. Surprisi... |

1474 | An axiomatic basis for computer programming - Hoare - 1969 |

1361 | A structural Approach to operational semantics
- Plotkin
(Show Context)
Citation Context ...pposed to deal with dirty control features or e ciency considerations which belong to code execution but should be hidden from the system designer. Only Plotkin's structural operational semantics SOS =-=[70]-=- is sometimes considered as an acceptable style of de ning the meaning of programs. In that approach, the program constructs guide the formulation of axioms and rules which de ne the meaning of progra... |

416 | Evolving algebras 1993: Lipari guide
- Gurevich
- 1995
(Show Context)
Citation Context ...1994). The running technical example is an abstract mathematical de nition of the well known RISC architecture DLX [49]. For DLX the notion of sequential evolving algebra su ces� note however that in =-=[41]-=- this notion has been extended to that of distributed evolving algebras which turned out to be natural and powerful for modeling distributed systems. I start from scratch without presupposing any know... |

311 | Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS - Owre, Rushby, et al. - 1995 |

247 |
A Specifier’s Introduction to Formal Methods
- Wing
- 1990
(Show Context)
Citation Context ...nd hardware practice is still with us, as is a wide-spread scepticism about the industrial bene t of formal methods (see the discussion in the literature about what are the right methods and criteria =-=[33, 68, 69, 47, 78, 31, 32]-=-) for software engineering to become a \mature engineering discipline"[54]. I accept with pleasure the invitation to explain to this audience how the new evolving algebra approach contributes to bridg... |

224 | Algebraic specifications - Wirsing - 1990 |

160 |
Denotational semantics
- Mosses
- 1990
(Show Context)
Citation Context ...ction principles are needed to cope with the complexity of large systems. Whereas the algebraic speci cation theory [79] shows a way to deal with abstract data types and the action semantics approach =-=[64]-=- proposes a scheme for constructing complex operations out of basic components, evolving algebras o er the possibility tochoose both, the data and the basic actions, at any level of abstraction and in... |

155 | Logic and the Challenge of Computer Science
- Gurevich
- 1988
(Show Context)
Citation Context ...e practical and scalable to industrial applications. The notion of evolving algebra has been discovered by Gurevichinanattempt to sharpen Turing's thesis by considerations from complexity theory (see =-=[39]-=-) where the notion has led to important new developments [6]. At that time Iwas trying to develop a mathematical model for the programming language Prolog� this led me to the idea to use the notion of... |

140 | Toward a mathematical semantics for computer languages - Scott, Strachey - 1971 |

118 | Seven more myths of formal methods - Hinchey - 1994 |

109 | Social processes and proofs of theorems and programs - MILLO, LIPTON, et al. - 1979 |

98 | Ten Commandments of Formal Methods
- Bowen, Hinchey
- 1995
(Show Context)
Citation Context ...nd hardware practice is still with us, as is a wide-spread scepticism about the industrial bene t of formal methods (see the discussion in the literature about what are the right methods and criteria =-=[33, 68, 69, 47, 78, 31, 32]-=-) for software engineering to become a \mature engineering discipline"[54]. I accept with pleasure the invitation to explain to this audience how the new evolving algebra approach contributes to bridg... |

95 |
Information Distribution Aspects of Design Methodology
- Parnas
- 1972
(Show Context)
Citation Context ...de) then PC ival + PC else PC A if opcode 2fTRAPg[P LAINJ then mode :=FETCH if opcode 2 LINKJ then C PC mode := WRITE BACK 2 Information Hiding and Interfaces Information hiding,introduced byD.Parnas =-=[67]-=-, calls for modular structuring of systems. In a practical speci cation method, information hiding has to go hand in hand with a good discipline to handle interfaces. The evolving algebra approach o e... |

88 | The Semantics of the C Programming Language
- Gurevich, Huggins
- 1993
(Show Context)
Citation Context ... This freedom explains the success of the simple and transparent evolving algebra models for the semantics and the implementation ofnumerous complex programming languages like Prolog [7, 8,27, 28], C =-=[43]-=-, VHDL [20, 21], Occam [17, 16], for protocols [22, 55], architectures [14, 13, 24], real{time algorithms[45, 46], etc. which have been developed in a relatively short time by a relatively small numb... |

75 | The WAM—definition and compiler correctness - Börger, Rosenzweig - 1995 |

57 | Denotational and Operational Semantics for Prolog
- Debray, Mishra
- 1988
(Show Context)
Citation Context ... of Prolog programs in the literature. For each abstract domain which appears in the evolving algebra de nition of the core of Prolog for user{de ned predicates [27], the denotational descriptions in =-=[57, 34, 35]-=- introduce a continuation: for terms, goals, (occurrences of) clauses, programs, substitutions, etc. The di culty is that the denotational Prolog models have to deal with these continuations explicitl... |

56 | A mathematical definition of full Prolog - Börger, Rosenzweig - 1995 |

53 | Stepwise Development of Operational and Denotational Semantics for Prolog - Jones, Mycroft - 1984 |

44 |
Software aspects of strategic defense systems
- Parnas
- 1985
(Show Context)
Citation Context ...nd hardware practice is still with us, as is a wide-spread scepticism about the industrial bene t of formal methods (see the discussion in the literature about what are the right methods and criteria =-=[33, 68, 69, 47, 78, 31, 32]-=-) for software engineering to become a \mature engineering discipline"[54]. I accept with pleasure the invitation to explain to this audience how the new evolving algebra approach contributes to bridg... |

41 | Algorithms and Data Structures - Wirth - 1986 |

36 | Formal Definition of an Abstract VHDL'93 Simulator by EA-Machines - Börger, Glässer, et al. - 1995 |

36 | Towards a classification approach to design - Smith - 1997 |

33 | Transformational approach to transportation scheduling
- Smith, Parra
- 1994
(Show Context)
Citation Context ...tion which havebeen tailored to particular application domains. As outstanding recent examples one can cite here D. Smith's method for synthesis of high{performance transportation scheduling programs =-=[77, 76]-=- and Clarke and Dill's machinery for the veri cation of programs which can conveniently be mapped to nite state transition systems of manageable size and can be dealt with by automated model checking.... |

32 |
A logical operational semantics for full Prolog. Part I: Selection core and control
- Börger
(Show Context)
Citation Context ...tion of a system. This freedom explains the success of the simple and transparent evolving algebra models for the semantics and the implementation ofnumerous complex programming languages like Prolog =-=[7, 8,27, 28]-=-, C [43], VHDL [20, 21], Occam [17, 16], for protocols [22, 55], architectures [14, 13, 24], real{time algorithms[45, 46], etc. which have been developed in a relatively short time by a relatively sm... |

31 | D.: The Bakery Algorithm: Yet Another Specification and Verification - Börger, Gurevich, et al. - 1995 |

30 |
A Logical Operational Semantics of Full Prolog. Part II: Built-in Predicates for Database Manipulation, in
- Börger
- 1990
(Show Context)
Citation Context ...tion of a system. This freedom explains the success of the simple and transparent evolving algebra models for the semantics and the implementation ofnumerous complex programming languages like Prolog =-=[7, 8,27, 28]-=-, C [43], VHDL [20, 21], Occam [17, 16], for protocols [22, 55], architectures [14, 13, 24], real{time algorithms[45, 46], etc. which have been developed in a relatively short time by a relatively sm... |

25 |
No silver bullet—essence and accidents of software engineering,” Information Processing 86
- Brooks
- 1986
(Show Context)
Citation Context |

25 | The Theory and Practice of a Formal Method: NewCoRe
- Holzmann
- 1994
(Show Context)
Citation Context ...of formal methods (see the discussion in the literature about what are the right methods and criteria [33, 68, 69, 47, 78, 31, 32]) for software engineering to become a \mature engineering discipline"=-=[54]-=-. I accept with pleasure the invitation to explain to this audience how the new evolving algebra approach contributes to bridging this gap. I will try to convince you that it o ers a mathematicallywel... |

25 |
Education for computing professionals
- Parnas
(Show Context)
Citation Context |

22 | The semantics of behavioral VHDL’93 descriptions
- Börger, Glässer, et al.
- 1994
(Show Context)
Citation Context ...om explains the success of the simple and transparent evolving algebra models for the semantics and the implementation ofnumerous complex programming languages like Prolog [7, 8,27, 28], C [43], VHDL =-=[20, 21]-=-, Occam [17, 16], for protocols [22, 55], architectures [14, 13, 24], real{time algorithms[45, 46], etc. which have been developed in a relatively short time by a relatively small number of persons w... |

21 |
Formal Veri cation for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
- Owre
(Show Context)
Citation Context ...he traditional and slow proof checking process by humans is if not replaced then at least enhanced and speeded up by machine assisted interactive proof checking procedures� see the interesting report =-=[66]-=-. This is a rationale for programs like Beta testing. Pedantics has to create appropriate methods and criteria which an applied computer scientists can use when they need to decide whether and to what... |

20 | G.: A formal method for provably correct composition of a real-life processor out of basic components (The APE100 Reverse Engineering Study
- Börger, Castillo
- 1995
(Show Context)
Citation Context ...lgebra models for the semantics and the implementation ofnumerous complex programming languages like Prolog [7, 8,27, 28], C [43], VHDL [20, 21], Occam [17, 16], for protocols [22, 55], architectures =-=[14, 13, 24]-=-, real{time algorithms[45, 46], etc. which have been developed in a relatively short time by a relatively small number of persons who used only evolving algebras as tool. It is also the feature of ev... |

20 |
Biting the Silver Bullet
- Harel
- 1992
(Show Context)
Citation Context |

18 |
Annotated Bibliography on Evolving Algebras
- Börger
- 1994
(Show Context)
Citation Context ...illustrate the main features of this new approach through examples from evolving algebra speci cations and veri cations of real-life programming languages, compilers, protocols and architectures (see =-=[11]-=- for an annotated bibliography complete up to 1994). The running technical example is an abstract mathematical de nition of the well known RISC architecture DLX [49]. For DLX the notion of sequential ... |

15 | R.: CLAM Specification for Provably Correct Compilation of CLP(R - Börger, Salamone - 1995 |

14 | U.: Modelling and Analysis of Distributed and Reactive Systems Using Evolving Algebras
- Borger, Glasser
- 1995
(Show Context)
Citation Context ...ght yield a PVM instruction or a message as value. If event(pvmd) is de ned and has the value instr/mssg, then the daemon pvmd is going to execute/read instr/mssg. This is formalized in our PVM model =-=[18, 19]-=- by a rule of form if event(pvmd) =instr/mssg then execute instr/read mssg for each individual PVM instruction instr or PVM message mssg, where execute instr/read mssg represents the corresponding upd... |

14 |
P.: A Formal Operational Semantics for Languages of Type Prolog III
- Borger, Schmitt
(Show Context)
Citation Context ...e extensibility and reusability� see the ease with which the Prolog model in [7, 8, 27] could be modi ed to provide models for various well known extensions of Prolog by parallelism [25], constraints =-=[30, 29]-=-, types [2], functional [23] or object{oriented features (see [9] for a detailed survey). The importance of the freedom of abstraction is also con rmed by a common experience in the design of algorith... |

13 |
D.: An Analysis of Prolog Database Views and their Uniform Implementation
- Borger, Rosenzweig
- 1991
(Show Context)
Citation Context ...like assert, retract, then procdef is a static oracle function. If one wants to model also Prolog's program modi cation features then procdef becomes a dynamic and internally updatable function (see =-=[15, 26]-=-). Through the re nement process by which the Prolog model of [27] islinked in a provably correct way to the WAM implementation model in [28] procdef receives an explicit de nition. unify is supposed ... |

13 |
Algebraic Speci cation
- Wirsing
- 1989
(Show Context)
Citation Context ...ods in the literature.1 Freedom of Abstraction It is well known that general abstraction principles are needed to cope with the complexity of large systems. Whereas the algebraic speci cation theory =-=[79]-=- shows a way to deal with abstract data types and the action semantics approach [64] proposes a scheme for constructing complex operations out of basic components, evolving algebras o er the possibili... |

12 | Logic Programming: The Evolving Algebra Approach. In
- Borger
- 1994
(Show Context)
Citation Context ...del in [7, 8, 27] could be modi ed to provide models for various well known extensions of Prolog by parallelism [25], constraints [30, 29], types [2], functional [23] or object{oriented features (see =-=[9]-=- for a detailed survey). The importance of the freedom of abstraction is also con rmed by a common experience in the design of algorithms. Namely, the need to model phenomena of the real world, which ... |

12 | M.: A Model for Mathematical Analysis of Functional Logic Programs and their Implementations. In
- Borger, Lopez-Fraguas, et al.
- 1994
(Show Context)
Citation Context ... see the ease with which the Prolog model in [7, 8, 27] could be modi ed to provide models for various well known extensions of Prolog by parallelism [25], constraints [30, 29], types [2], functional =-=[23]-=- or object{oriented features (see [9] for a detailed survey). The importance of the freedom of abstraction is also con rmed by a common experience in the design of algorithms. Namely, the need to mode... |

12 | Kermit: Specification and Verification - Huggins - 1995 |

10 | Towards a mathematical specification of the APE100 architecture: The APESE model - Borger, Castillo, et al. - 1994 |

10 | Group membership protocol: Specification and verification - Gurevich, Mani - 1994 |

8 |
Prolog: DIN papers for discussion
- Börger, Dässler
- 1990
(Show Context)
Citation Context ... de ned| ideally by a ground model|it should be possible to understand the behaviour of a proposed implementation through that model. For Prolog I have developed an evolving algebra ground model, see =-=[7, 12, 27]-=-� it de nes the semantics of the ISO Prolog standard. An IEEE VHDL'93 Standard evolving algebra ground model appears in [21].The condition of simplicity and conciseness wants to make surethat ground ... |

8 |
A Framework to Specify Database Update Views for Prolog. In
- Borger, Demoen
- 1991
(Show Context)
Citation Context ...like assert, retract, then procdef is a static oracle function. If one wants to model also Prolog's program modi cation features then procdef becomes a dynamic and internally updatable function (see =-=[15, 26]-=-). Through the re nement process by which the Prolog model of [27] islinked in a provably correct way to the WAM implementation model in [28] procdef receives an explicit de nition. unify is supposed ... |

8 | A Formal Specification of the PVM Architecture - Borger, Glasser - 1994 |

8 | A correctness proof for pipelining in RISC architectures
- Borger, Mazzanti
- 1996
(Show Context)
Citation Context ...gramming languages, compilers, protocols and architectures. The de nition of a mathematical model for Hennessy and Patterson's RISC architecture DLX serves as a running example� this model is used in =-=[24]-=- to prove the correctness of instruction pipelining. Iwillpoint out the yet unexplored potential of the evolving algebra method for large-scale industrial applications. Ich habe oft bemerkt, dass wir ... |