Edith Gail Deak. A Transformational Approach to the Development and Verification of Programs in a Very High Level Language. PhD thesis, Computer Science Dept, NYU, June 1980.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....every (#, #) in F , if every assumption in E holds, then (#, #) holds. They proposed a logic of programs L for establishing the correctness of praas. Deak in her 1980 PhD thesis showed how this logic could be applied to derive several variants of searching algorithms from a common root algorithm [Dea77, Dea80]. The Davis Schwartz vision of the ideal verification tool T was one in which the inference rules I of L could be extended by decision procedures for commonly occurring programming language constructs, subject to the restriction that the set R of correct praas verifiable in L would not change ....

.... The Correct Program Technology initiative was proposed by Davis and Schwartz in 1977 [Sch77, DS77, Sch78] as an enhancement of the Floyd Hoare approach [Flo67, Hoa69] Subsequently, the most successful directly related developments have been a thought piece on transformational programming [Dea77, Dea80], and theoretical work on decidable sublanguages of set theory [FOS80, CFOS87, CFO89, COP90, Pol87a, Pol87b, PS92, PT92] We first define factors to consider in reviewing a given approach towards building verification tools, and then we briefly consider three quite distinct approaches to building ....

[Article contains additional citation context not shown here]

Edith Gail Deak. A Transformational Approach to the Development and Verification of Programs in a Very High Level Language. PhD thesis, Computer Science Dept, NYU, June 1980.

.... extend itself with new proof methods without violating soundness and without changing the set of provable statements; see [24] Edith Schonberg later extended Davis and Schwartz s verification framework to support the computer assisted verification and application of program transformations; see [25]. She presented one of the most difficult transformational proofs in the literature a formal derivation of Tarjan s graph reducibility algorithm (see [84] as a convincing case study. This early work inspired Cantone, Ferro, and Omodeo s work on fast decision procedures for fragments of ....

....The program shown in Figure 6 consolidates the preceding simplifications, and also implements the split operations in terms of the more primitive split operations with which it is defined. This is achieved with a SETL for loop implementation by application of what E. Schonberg (cited as Deak, [25]) calls a compilation transformation. The space improvement to Hopcroft s algorithm is achieved as follows. Represent the thin partition T as the preimages of a single valued map T1 (as described in the last section) i.e. so that identity T = Phi T1 Gamma1 fqg : q 2 range T1 Psi ....

Deak, E., A Transformational Approach to the Development and Verification of Programs in a Very High Level Language, Courant Computer Science Report 22, Courant Institute, New York University, New York, November 1980.

....in F , if every assumption in E holds, then (OE; holds. Davis and Schwartz proposed a logic of programs L for establishing the correctness of praas. Deak in her 1980 PhD thesis showed how this logic could be applied to derive several variants of searching algorithms from a common root algorithm [Dea77, Dea80]. The Davis Schwartz vision of the ideal verification tool T was one in which the inference rules I of L could be extended by decision procedures for commonly occurring programming language constructs, subject to the restriction that the set R of correct praas verifiable in L would not change ....

Edith Gail Deak. A Transformational Approach to the Development and Verification of Programs in a Very High Level Language. PhD thesis, Computer Science Dept, NYU, June 1980.

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