Abstract
This paper presents work on technology for transformational proof and program development, as used by window inference calculi and transformation systems. The calculi are characterised by a certain class of theorems in the underlying logic. Our transformation system TAS compiles these rules to concrete deduction support, complete with a graphical user interface with command-language-free user interaction by gestures like drag&drop and proof-by-pointing, and a development management for transformational proofs. It is generic in the sense that it is completely independent of the particular window inference or transformational calculus, and can be instantiated to many different ones; three such instantiations are presented in the paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Back, J. Grundy, and J. von Wright. Structured calculational proof. Formal Aspects of Computing, 9:467–483, 1997.
R.-J. Back and J. von Wright. Refinement Calculus. Springer Verlag, 1998.
F. L. Bauer. The Munich Project CIP. The Wide Spectrum Language CIP-L. Number 183 in LNCS. Springer Verlag, 1985.
B. Buth, J. Peleska, and H. Shi. Combining methods for the deadlock analysis of a fault-tolerant system. In Algebraic Methodology and Software Technology AMAST’97, number 1349 in LNCS, pages 60–75. Springer Verlag, 1997.
B. Buth, J. Peleska, and H. Shi. Combining methods for the livelock analysis of a fault-tolerant system. In Algebraic Methodology and Software Technology AMAST’98, number 1548 in LNCS, pages 124–139. Springer Verlag, 1999.
D. Carrington, I. Hayes, R. Nickson, G. Watson, and J. Welsh. A Program Refinement Tool. Formal Aspects of Computing, 10(2):97–124, 1998.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press and New York: McGraw-Hill, 1989.
E.W. Dijkstra and C.S. Scholten. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer Verlag, 1990.
D. Gries. A Science of Programming. Springer Verlag, 1981.
D. Gries. Teaching calculation and discrimination: A more effecticulum. Communications of the ACM, 34:45–54, 1991.
J. Grundy. Transformational hierarchical reasoning. Computer Journal, 39:291–302, 1996.
B. Hoffmann and B. Krieg-Brückner. PROSPECTRA: Program Development by Specification and Transformation. Number 690 in LNCS. Springer Verlag, 1993.
Kolyang, T. Santen, and B. Wolff. Correct and user-friendly implementations of transformation systems. In M. C. Gaudel and J. Woodcock, editors, Formal Methods Europe FME’96, number 1051 in LNCS, pages 629–648. Springer Verlag, 1996.
T. Långbacka, R. Rukšena, and J. von Wright. TkWinHOL: A tool for doing window inferencing in HOL. In Proc. 8 th International Workshop on Higher Order Logic Theorem Proving and Its Applications, number 971 in LNCS, pages 245–260. Springer Verlag, 1995.
C. Lüth and B. Wolff. Functional design and implementation of graphical user interfaces for theorem provers. Journal of Functional Programming, 9(2):167–189, March 1999.
T. Mossakowski, Kolyang, and B. Krieg-Brückner. Static semantic analysis and theorem proving for CASL. In Recent trends in algebraic development techniques. Proc 13th International Workshop, number 1376 in LNCS, pages 333–348. Springer Verlag, 1998.
R. S. Laziæ. A Semantic Study of Data Independence with Applications to Model Checking. PhD thesis, Oxford University, 1999.
P. J. Robinson and J. Staples. Formalizing a hierarchical structure of practical mathematical reasoning. Journal for Logic and Computation, 14(1):43–52, 1993.
A. W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1998.
D. Smith. The design of divide and conquer algorithms. Science of Computer Programming, 5:37–58, 1985.
D. R. Smith. KIDS — a semi-automatic program development system. IEEE Transactions on Software Engineering, 16(9):1024–1043, 1991.
D. R. Smith and M. R. Lowry. Algorithm theories and design tactics. Science of Computer Programming, 14:305–321, 1990.
M. Staples. Window inference in Isabelle. In Proc. Isabelle Users Workshop. University of Cambridge Computer Laboratory, 1995.
M. Staples. A Mechanised Theory of Refinement. PhD thesis, Computer Laboratory, University of Cambridge, 1998.
M. Staples. Representing wp semantics in isabelle/zf. In G. Dowek, C. Paulin, and Y. Bertot, editors, TPHOLs: The 12th International Conference on Theorem Proving in Higher-Order Logics, number 1690 in lncs. springer, 1999.
H. Tej and B. Wolff. A corrected failure-divergence model for CSP in Isabelle/HOL. In J. Fitzgerald, C. B. Jones, and P. Lucas, editors, Formal Methods Europe FME’ 97, number 1313 in LNCS, pages 318–337. Springer Verlag, 1997.
D. van Dalen. Logic and Structure. Springer Verlag, 1994.
A. J. M. van Gasteren. On the shape of mathematical arguments. In Advances in Software Engineering and Knowledge Engineering, number 445 in LNCS, pages 1–39. Springer Verlag, 1990.
J. von Wright. Extending window inference. In Proc. TPHOLs’ 98, number 1497 in LNCS, pages 17–32. Springer Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lüth, C., Wolff, B. (2000). TAS — A Generic Window Inference System. In: Aagaard, M., Harrison, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2000. Lecture Notes in Computer Science, vol 1869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44659-1_25
Download citation
DOI: https://doi.org/10.1007/3-540-44659-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67863-2
Online ISBN: 978-3-540-44659-0
eBook Packages: Springer Book Archive