文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Generic Transformation Systems for Formal Methods
侵权投诉

Generic Transformation Systems for Formal Methods

We will present two tools, TAS and IsaWin, for transformational program development and theorem proving respectively, based on the theorem prover Isabelle. Their distinguishing feature is a generic, open system design which allows the development

Generic Transformation Systems for Formal Methods Kolyang, Christoph Luth, Thomas Meyer, Burkhart Wol Bremen Institute for Safe Systems (BISS), FB 3, Universitat Bremen uniform@informatik.uni-bremen.de doc.guandang.net

Introduction

We will present two tools, TAS and IsaWin, for transformational program development and theorem proving respectively, based on the theorem prover Isabelle. Their distinguishing feature is a generic, open system design which allows the development of a family of tools for di erent formal methods on a sound logical basis with a uniform appearance. The context of this work is the UniForM project, the aim of which is to develop a framework integrating di erent formal methods in a logically consistent way. Consistency is achieved by encoding formal methods in the theorem prover Isabelle, which is used to perform the program development as well as to prove the correctness of the transformation rules. TAS is a system for transformational program development in Isabelle. It is designed to keep everything about proofs in Isabelle away from the user. The proof obligations resulting from applying a transformation rule are proven using another Isabelle tool (like IsaWin below), such that the user does not have to worry about the details of how the transformational process is implemented within Isabelle, leaving him with the main design decisions of transformational program development: which rule to apply, and how to instantiate its parameters. TAS is a generic system, which means it can be instantiated with a logical embedding of a particular speci cation language or formal method. In our case, this has been done for CSP 3] and Z 2] as well as for higher-order logic (HOL). The logical embeddings inherit the full proof power of Isabelle, and can be customised to include language-speci c proof support. See 1] for details of the theory. IsaWin can be used as an interface to Isabelle in its own right, as well as to prove the proof obligations arising from transformational developments using TAS, or even the correctness of the transformations of TAS. It allows access to nearly all of Isabelle's basic functionality. The system is entirely implemented in Standard ML (SML) as a conservative extension of Isabelle. This approach allows us to take advantage of SML's powerful

The Transformation Application System TAS

IsaWin| a Graphical User Interface for Isabelle

System Architecture

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email