(Enter summary)
Abstract: Window inference is a method for contextual rewriting and refinement, supported by the HOL Window Inference Library. This paper describes a user-friendly interface for window inference. The interface permits the user to select subexpressions by pointing and clicking and to select transformations from menus. The correctness of each transformation step is proved automatically by the HOL system. The interface can be tailored to particular user-defined theories. One such extension, for program... (Update)
Context of citations to this paper: More
...transformational manner. Every step in the design process can be formally proven correct within this calculus, even mechanically [10]. A (Q)DI action system is a low level description of a circuit. Therefore, it might be difficult to directly find such system for a...
...programs. A tool supporting verification of correctness and refinement of imperative programs 27 and known as the Refinement Calculator [23] already exists and extending it to handling object oriented programs based on the formalization presented here appears to be only...
Cited by: More
Ensuring Correctness of Java Frameworks: A Formal Look at JCF - Mikhajlova, Sekerinski (1999)
(Correct)
Class Refinement as Semantics of Correct Object.. - Back, Mikhajlova, von..
(Correct)
Delay-Insensitive Circuits and Action Systems - Plosila, Ruksenas, Sere (1996)
(Correct)
Similar documents (at the sentence level):
39.8%: TkWinHOL: A Tool for Doing Window Inference in HOL - Långbacka, Ruksenas, von Wright (1995)
(Correct)
Active bibliography (related documents): More All
0.6: Program Derivation Using the Refinement Calculator - Butler, Långbacka (1996)
(Correct)
0.4: Refining Reactive Systems in HOL using Action Systems - Långbacka, von Wright (1997)
(Correct)
0.4: Program Refinement by Theorem Prover - von Wright (1994)
(Correct)
Similar documents based on text: More All
0.2: Developing a Customisable Programming Environment for.. - Aspnäs, Långbacka
(Correct)
0.2: An Interactive Metatool for Exploring Program Algebras - von Wright (1999)
(Correct)
0.2: Mechanised Formal Reasoning About Modular Programs - Laibinis (2000)
(Correct)
Related documents from co-citation: More All
2: An axiomatic basis for computer programming (context) - Hoare - 1969
2: Reasoning about Java classes
- Jacobs, van den Berg et al. - 1998
2: Class refinement and interface refinement in object-oriented programs
- Mikhajlova, Sekerinski - 1997
BibTeX entry: (Update)
T. Langbacka, R. Ruksenas, and J. von Wright. TkWinHOL: A Tool for Window Inference in HOL. In E. T. Schubert, P. J. Windley, and J. Alves-Foss, editors, Higher Order Logic Theorem Proving and Its Applications -- 8th International Workshop, Aspen Grove, Utah, USA, volume 971 of LNCS, pages 245--260, Springer--Verlag, 1995. http://citeseer.ist.psu.edu/article/langbacka95tkwinhol.html More
@inproceedings{ langbacka95tkwinhol,
author = "T. L{\aa}ngbacka and R. Ruksenas and J. {v. Wright}",
title = "{TkWinHOL}: {A} {T}ool for {W}indow {I}nterference in {HOL}",
booktitle = "8th International Workshop on Higher Order Logic Theorem Proving and its Applications",
volume = "971",
publisher = "Springer-Verlag",
address = "Aspen Grove, Utah, USA",
editor = "{E.T. Schubert} and {P.J. Windley} and {J. Alves-Foss}",
pages = "245--260",
year = "1995",
url = "citeseer.ist.psu.edu/article/langbacka95tkwinhol.html" }
Citations (may not include all citations):
861
Tcl and the Tk Toolkit
- Ousterhout - 1994
126
Introduction to HOL (context) - Gordon, Melham - 1993
114
A calculus of refinements for program derivations (context) - Back - 1988
99
Correctness Preserving Program Refinements: Proof Theory and.. (context) - Back - 1980
25
Exploring Expect: A Tcl-based Toolkit for Automating Interac.. (context) - Libes - 1994
23
A window inference tool for refinement (context) - Grundy - 1992
22
A Theorem Prover for UNITY in Higher Order Logic (context) - Andersen - 1992
21
Prentice--Hall (context) - Dijkstra, of - 1976
21
A New Interface for HOL - Ideas (context) - Syme
20
Program refinement by theorem prover
- von Wright - 1994
18
Formalising the hierarchical structure of practical mathemat.. (context) - Robinson, Staples - 1990
15
A System for Constructing Language-Based Editors (context) - Reps, Teitelbaum et al. - 1988
12
part I: Sequential programs (context) - Back, von Wright - 1989
12
Refinement concepts formalized in higher order logic
- Back, von Wright - 1990
8
Mechanizing CSP trace theory in Higher Order Logic (context) - Camillieri - 1990
6
Mechanising some advanced refinement concepts
- von Wright, Hekanaho et al. - 1993
5
Centipede --- a Program Refinement Environment (context) - Back, Hekanaho et al. - 1992
5
A Graphical Tool for Proving UNITY Progress (context) - Andersen, Petersen et al. - 1994
4
HOL90 window library manual (context) - Grundy - 1994
Documents on the same site (http://www.dcs.napier.ac.uk/~mikej/refs.htm): More
Displaying sequent-calculus proofs in natural-deduction.. - Bornat, Sufrin
(Correct)
User Guide to the CtCoq Proof Environment - Bertot, Bertot, Coscoy, Goguen, .. (1997)
(Correct)
Undoing and Managing a proof - Pons (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC