Rigorous Methods for Software Construction and Analysis: Essays Dedicated to Egon Börger on the Occasion of His 60th BirthdayJean-Raymond Abrial, Uwe Glässer Springer Science & Business Media, 2009 - 235 Seiten Egon B] orger Tribute to Egon B] orger on th the Occasion of his 60 Birthday 1 2 Jean-Raymond Abrial and Uwe Glasser ] 1 jrabrial@neuf. fr 2 glaesser@cs. sfu. ca Egon B] orger was born on May 13, 1946, in Westfalia (Germany). After the cl- sic baccalaur eat, from 1965-1971 he studied philosophy, logic and mathematics at the Sorbonne (Paris, France), Institut Sup erieur de Philosophie de Louvain (Belgium), Universit e de Louvain and Universitat ] Munster ] (Germany), where he got his doctoral degree and in 1976 his Habilitation in mathematics. The themes of his doctoral dissertation, ReductionclassesinKromandHornfor- lae, andofhis Habilitationsschrift, Asimple method for determining thedegree of unsolvability of decision problems for combinatorial systems, havetheirroot inthe computationalviewofmathematicallogicheldatthe time atthe Institute for Logic and Foundations of Mathematics at the University of Mu ]nster, a t- dition going back to (among others) Leibniz, Ackermann, G] odel, Post, Turing, Kleene, and associated in Munster ] with the names of the founder of the ins- tute, Heinrich Scholz, and his followers Hans Hermes, Gisbert Hasenj] ager and Dieter R] odding. This heritage determined the focus of B] orger s logical inves- gations in what nowadaysis called computability and computationalcomplexity theory and his early interest in applying methods from logic to solve problems in computer science." |
Inhalt
Relaxing Restrictions on Invariant Composition in the B Method by Ownership Control a la Spec | 1 |
Designing Old and New Distributed Algorithms by Replaying an Incremental ProofBased Development | 17 |
Ten Reasons to Metamodel ASMs | 33 |
An ASMCharacterization of a Class of Distributed Algorithms | 50 |
Using Abstract State Machines for the Design of Multilevel Transaction Schedulers | 65 |
Validating and Animating HigherOrder Recursive Functions in B | 78 |
A Systematic Verification Approach for Mondex Electronic Purses Using ASMs | 93 |
Management of UML Clusters | 111 |
A Step towards Merging xUML and CSP B | 130 |
CoreASM PlugIn Architecture | 147 |
Accessing Java Code from CoreASM | 170 |
A Modular Verification Methodology for C Delegates | 187 |
On the Evolution of OCL for Capturing Structural Constraints in Modelling Languages | 204 |
Lessons for ASM B Z and VSRnet | 219 |
Author Index | 234 |
Andere Ausgaben - Alle anzeigen
Rigorous Methods for Software Construction and Analysis: Essays Dedicated to ... Jean-Raymond Abrial,Uwe Glässer Eingeschränkte Leseprobe - 2010 |
Häufige Begriffe und Wortgruppen
ABORT Abrial Abstract State Machines abstract storage action agents application approach architecture ArgoUML ASM models ASM specifications AsmL AsmM B-Method Börger class diagrams cluster Command pattern component Computer Science concrete concurrent constraints context contract CoreASM CoreASM engine defined definition delegate instance distributed algorithm Egon Börger environment evaluated example execution expression extension formal methods framework function Glässer Gurevich Heidelberg Heidelberg 2003 IEEE implementation initial instantiation integration interaction interface invariant invocation invoked IsLoaded JASMine Java object language LNCS M.st metamodel model checking molecules Mondex node notation operational semantics operations paper parser plug-in precondition predicate proof obligations properties protocol purse recursive requires clause rule schedule Section semantics sequence sequential set comprehension signal signature simulation Spec Springer static step structure syntax target tion transaction UML diagrams undef update valid variables verify xUML model