3-Overview - An Overview Dines Bjørner and Martin C....

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: An Overview Dines Bjørner and Martin C. Henson 1 Department of Informatics and Mathematical Modelling, Technical University of Denmark, DK-2800 Kgs. Lyngby, Denmark ( [email protected] ) 2 Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex CO4 3SQ, UK ( [email protected] ) Before going into the topic of formal specification languages let us first survey the chain of events that led to this book as well as the notions of the specific specification languages and their logics. 1 The Book History Four phases characterise the work that lead to this book. 1.1 CoLogNET CoLogNET was a European (EU) Network of Excellence. It was funded by FET, the Future and Emerging Technologies arm of the EU IST Programme, FET-Open scheme. The network was dedicated to furthering computational logic as an academic discipline. We refer to http://newsletter.colognet.org/ . One of the editors (DB) was involved in the CoLogNET effort. One of his obligations was to propagate awareness of the logics of formal specification languages. 1.2 CAI: Computing and Informatics One of the editors of this book (DB) was also, for many years, an ed- itor of CAI, the Slovak Academy journal on Computing and Informatics (http://www.cai.sk/). The chief editors kindly asked DB to edit a special issue. It was therefore quite reasonable to select the topic of the logics of for- mal (methods’) specification languages and to invite a number of people to author papers for the CAI. The result was a double issue of CAI: 4 Dines Bjørner and Martin C. Henson CAI, Volume 22, 2003, No. 3 The Expressive Power of Abstract State Machines W. Reisig [7] Abstract: Conventional computation models assume symbolic represen- tations of states and actions. Gurevich’s “Abstract State Machine” model takes a more liberal position: Any mathematical structure may serve as a state. This results in “a computational model that is more powerful and more universal than standard computation models”. We characterize the Abstract State Machine model as a special class of transition systems that widely extends the class of “computable” transition systems. This characterization is based on a fundamental Theorem of Y. Gurevich. Foundations of the B Method D. Cansell, D. M´ ery [1] Abstract: B is a method for specifying, designing and coding software systems. It is based on Zermelo–Fraenkel set theory with the axiom of choice, the concept of generalized substitution and on structuring mecha- nisms (machine, refinement, implementation). The concept of refinement is the key notion for developing B models of (software) systems in an in- cremental way. B models are accompanied by mathematical proofs that justify them. Proofs of B models convince the user (designer or specifier) that the (software) system is effectively correct. We provide a survey of the underlying logic of the B method and the semantic concepts related to the B method; we detail the B development process partially supported...
View Full Document

This note was uploaded on 03/31/2010 for the course CAS 707 taught by Professor Ridhakhedri during the Spring '10 term at McMaster University.

Page1 / 10

3-Overview - An Overview Dines Bjørner and Martin C....

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online