文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Correct and User-Friendly Implementations of Transformation Systems 1
侵权投诉

Correct and User-Friendly Implementations of Transformation Systems 1

Abstract. We present an approach to integrate several existing tools and methods to a technical framework for correctly developing and executing program transformations. The resulting systems enable program derivations in a user-friendly way. We illustrate

Correct and User-Friendly Implementations of

Transformation Systems1

Kolyang , T. Santen , B. Wolff

Universität Bremen , FB3

P.O. Box 330440

D-28334 Bremen

{bu,kol}@informatik.uni-bremen.de GMD FIRST Berlin Rudower Chaussee 5D-12489 Berlinsanten@first.gmd.de

Abstract. We present an approach to integrate several existing tools andmethods to a technical framework for correctly developing and executingprogram transformations. The resulting systems enable program deriva-tions in a user-friendly way.

We illustrate the approach by proving and implementing thetransformation Global Search on the basis of the tactical theorem proverIsabelle. A graphical user-interface based on the X-Window toolkit Tkprovides user friendly access to the underlying machinery.

1 Introduction

Development by transformation is a prominent approach in formal program develop-ment (CIP [Bau+85], PROSPECTRA [HK 93], KIDS [Smi 90]). Many case studieshave proven its feasibility and demonstrated how much more abstract and user-orienteddevelopments could be achieved than using usual post-verification approaches (funda-mental for systems like PVS [OSR 93]). One recent case study is [KW 95]; and aprominent one is [SPW 95] where a strategic transportation scheduling algorithm isdeveloped which is 200 times faster than the ones in practical use today. Unfortuna-tely, implementations of transformation systems tend to be complicated and insecure.The correctness issue of transformation rules is usually not treated at the implementa-tion level of existing systems.

In contrast to this, there is a family of "tactical theorem provers" in the traditionof LCF available with systems like HOL [GM 93] and Isabelle [Pau 94a], that areboth well-designed and powerful. Coming with an open system-design going back toMilner, they allow for user-programmed extensions in a logically sound way. Butthere is recent prominent criticism that these provers, because of their "academic(ivory tower) origins", have "historically placed more emphasis on logicalfoundations and less on usability" [Gor 95]. This is clearly one of the reasons for thesmall acceptance of these provers in industry up to now.

In this paper, we demonstrate a technique to combine these two approaches. It re-sults in a simple implementation design, in proven correct transformations which areeasy to extend and to modify, and in a graphical user-interface that allows developersto profit from the abstraction of the transformational approach. We claim that our1This work has been supported by the BMBF projects UniForM [Kri+95] andESPRESS.

第1页

TOP相关主题

你可能喜欢

热门文档

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