Martin Davis and Jacob Theodore Schwartz. Metamathematical extensibility for theorem verifiers. Technical Report Courant Computer Science Report 12. Reprinted as [DS79]., NYU CS Dept, 1977.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... Cox, Lars Ericson, and Bud Mishra Abstract An approach to the problem of developing provably correct programs has been to enrich a theorem prover for Hoare logic with decision procedures for a number of decidable sublanguages of set theory ( EMLS, MLS, and extensions) and arithmetic (FPILP ) [Sch77]. Citing results of Goldberg [Gol79] on average case behavior of algorithms for SAT , it was hoped that these decision procedures would perform well on average. So far, it has been fairly difficult to prove average case NP hardness under the various definitions ( Lev86] BDCGL89] BG91] ....

.... Floyd Hoare problem , formulated around 1967 [Flo67, Hoa69] Around 1977, Davis and Schwartz proposed an extension of the Floyd Hoare problem in which there are multiple assumptions and assertions, referring to the state of a program as execution passes through different places in the program [DS77, Sch77]. A placed proposition is then a pair (OE; where is either a line of a program or the name of a function. A placed proposition 1 (OE; holds when, if execution reaches and the value of the variables X in P is V , then OE(V ) is valid. A program with assumptions and assertions or praa is ....

Jacob Theodore Schwartz. On correct-program technology. Technical Report Courant Computer Science Report 12, NYU CS Dept, 1977.

.... Floyd Hoare problem , formulated around 1967 [Flo67, Hoa69] Around 1977, Davis and Schwartz proposed an extension of the Floyd Hoare problem in which there are multiple assumptions and assertions, referring to the state of a program as execution passes through different places in the program [DS77, Sch77]. A placed proposition is then a pair (OE; where is either a line of a program or the name of a function. A placed proposition 1 (OE; holds when, if execution reaches and the value of the variables X in P is V , then OE(V ) is valid. A program with assumptions and assertions or praa is ....

Martin Davis and Jacob Theodore Schwartz. Metamathematical extensibility for theorem verifiers. Technical Report Courant Computer Science Report 12. Reprinted as [DS79]., NYU CS Dept, 1977.

.... Floyd Hoare problem , formulated around 1967 [Flo67, Hoa69] Around 1977, Davis and Schwartz proposed an extension of the Floyd Hoare problem in which there are multiple assumptions and assertions, referring to the state of a program as execution passes through di#erent places # in the program [DS77, Sch77]. A placed proposition is then a pair (#, #) where # is either a line of a program or the name of a function. A placed proposition (#, #) holds when, if execution reaches # and the value of the variables X in P is V , then #(V ) is valid. A program with assumptions and assertions or praa is then ....

....of deciding EMLS for practical problem sizes. We conclude, in Chapter 9, with a summary of our main conclusions and of the 7 key areas that remain to be clarified. 8 Chapter 2 Correct program technology 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, ....

[Article contains additional citation context not shown here]

Martin Davis and Jacob Theodore Schwartz. Metamathematical extensibility for theorem verifiers. Technical Report Courant Computer Science Report 12. Reprinted as [DS79]., NYU CS Dept, 1977.

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