S.P. Rajan, Transformations on Dependency Graphs: Formal Specification and Efficient Mechanical Verification, PhD Thesis, Department of Computer Science, University of British Columbia, Vancouver, Canada, Oktober 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Methodology for the Design of Guaranteed Correct .. - Middelhoek.. (1996) (2 citations) (Correct)
....correct implementation of a design tool based on correctness by construction requires special attention. The use of small local reusable behavior preserving transformations aids correct implementation. The specification of these transformations can be formally verified, for instance by using PVS [OSR93, SOR93, Raj95a, Raj95b, MiR96]. The correctness of the relatively small amount of code required to implement each of these transformations can be assured by extensive testing, code inspection, and through reverse mapping techniques [Jz95] Our current experience with implementing the design tool TRADES indicates that correct ....
....those that seem obviously correct. The importance of the proofs goes beyond the correctness of the transformations. Proving the transformations increases the insight in the usability and restrictions of transformations. PVS has shown to be useful for proving the correctness of transformations [Raj95a, Raj95b, MiR96]. In Section 4.2 it is shown how PVS can be used for transformation verification. 4.1 Design Representation and Behavior SIL graphs are used as design representations. A semantic function maps each graph onto a table representing the external behavior of this graph. The table concept is taken ....
[Article contains additional citation context not shown here]
S.P. Rajan, Transformations on Dependency Graphs: Formal Specification and Efficient Mechanical Verification, PhD Thesis, Department of Computer Science, University of British Columbia, Vancouver, Canada, Oktober 1995.
From VHDL to Efficient and First-Time-Right Designs: A Formal.. - Middelhoek (1995) (5 citations) (Correct)
....the component subgraphs of G and g 1 , g 2, g N the subgraphs of G . If every g i is a refinement of g i , then G is a refinement of G. i.e. i: refines(g i , g i ) refines(G , G) The proof follows by induction on graph structure. A detailed proof is given in a doctoral thesis [Raj95b] 7.4 .Verification of Transformations The general method we employ to specify and verify transformations consists of the following steps: 1. Specify the structure of a SIL graph, i.e. the transformation domain, on which the transformation is to be applied. The structure may have ....
S.P. Rajan, Transformations on Dependency Graphs: Formal Specification and Efficient Mechanical Verification, PhD Thesis, Department of Computer Science, University of British Columbia, Vancouver, Canada, Oktober 1995.
PVS Bibliography - Rushby (1998) (2 citations) (Correct)
.... [140 153] reactive [154] and hybrid systems [155 157] to distributed systems [158 164] and communications protocols [165 167] to program development [168] software development steps [169 172] and refinement [173 175] to compilers [176 179] to hardware design [180 203] and synthesis [204 209], to memory models and cache coherence protocols [210 213] to multimedia collaborations [214] to testing program visualization tools [215] to validating fault tolerant systems [216] and to self stabilization [217] PVS has also been used to support other specification notations [218 225] and ....
Sreeranga P. Rajan. Transformations on Dependency Graphs: Formal Specification and Efficient Mechanical Verification. PhD thesis, Department of Computer Science, University of British Columbia, Vancouver, Canada, October 1995.
Formal Verification of Transformations on Dependency Graphs in.. - Rajan (1995) Self-citation (Rajan) (Correct)
....Verification of Transformations on Dependency Graphs in Optimizing Compilers P. Sreeranga Rajan Computer Science Laboratory SRI International Menlo Park, CA 94025, USA sree csl.sri.com Phone: 1 (415) 859 2873 Fax: 1 (415) 859 2844 Abstract Dependency graphs are used as intermediate representations in optimizing compilers and software engineering. In a transformational design approach, ....
....6. 1.1 Related work There have been some efforts in analysis and verification of refinement transformations in the past. One of the earliest efforts on formalizing the correctness of 3 A more detailed treatment of specification and verification transformations is given in a forthcoming thesis [Raj] optimization of transformations is by Aho, Sethi and Ullman [ASU71] They formalized a restricted class of transformations known as Finite Church Rosser (FCR) transformations, and provided simple tests to check properties of such transformations. However, none of the other past work have ....
[Article contains additional citation context not shown here]
Sreeranga P. Rajan. Transformations on Dependency Graphs: Formal Specification and Efficient Mechanical Verification. PhD thesis, University of British Columbia, Vancouver, Canada, forthcoming.
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