Results 1  10
of
3,963
Register allocation by proof transformation
 Science of Computer Programming
, 2004
"... Abstract. This paper presents a prooftheoretical framework for register allocation that accounts for the entire process of register allocation. Liveness analysis is proof reconstruction (similar to type inference), and register allocation is proof transformation from a proof system with unrestricte ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Abstract. This paper presents a prooftheoretical framework for register allocation that accounts for the entire process of register allocation. Liveness analysis is proof reconstruction (similar to type inference), and register allocation is proof transformation from a proof system
Proof Transformation by CERES
 MATHEMATICAL KNOWLEDGE MANAGEMENT (MKM) 2006, VOLUME 4108 OF LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
, 2006
"... Cutelimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cutelimination method CERES (cutelimination by resolution) works by constructing a set o ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
Cutelimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cutelimination method CERES (cutelimination by resolution) works by constructing a set
Proof Transformations and Structural Invariance
 Algebraic and Prooftheoretic Aspects of Nonclassical Logics
, 2007
"... Abstract. In this paper we define the concept of a profile, which is a characteristic clause set, corresponding to an LKproof in firstorder logic, which is invariant under rule permutations. It is shown (via cutelimination) that the profile is even invariant under a large class of proof transforma ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
transformations (called “simple transformations”), which includes transformations to negation normal form. As proofs having the same profile show the same behavior w.r.t. cutelimination (which can be formally defined via the method CERES), proofs obtained by simple transformations can be considered as equal
Proof Transformation with Builtin . . .
, 1991
"... One of the main reasons why computer generated proofs are not widely accepted is often their complexity and incomprehensibility. Especially proofs of mathematical theorems with equations are normally presented in an inadequate and not intuitive way. This is even more of a problem for the presentatio ..."
Abstract
 Add to MetaCart
for the presentation of inferences drawn by automated reasoning components in other Al systems. For first order logic, proof transformation procedures have been designed in order to structure proofs and state them in a formalism that is more familiar to human mathematicians. In this report we generalize
Program Derivation by Proof Transformation
, 1993
"... In the proofsasprograms methodology, verified programs are developed through theoremproving in a constructive logic. Under this approach, the theoremproving process can be regarded as a program derivation process. The merits of this approach to programming are twofold. First, working with proofs ..."
Abstract
 Add to MetaCart
. This thesis investigates the use of proof transformations as a way to address important concerns in program derivation that are not addressed by theoremproving alone. One difficulty with the proofsasprograms strategy arises from the conflict between elegance and efficiency. A simple, elegant proof may lead
Program development by proof transformation
"... We begin by reviewing the natural deduction rules for the!^8fragment of minimal logic. It is shown how intuitionistic and classical logic can be embedded. Recursion and induction is added to obtain a more realistic proof system. Simple types are added in order to make the language more expressive. ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We begin by reviewing the natural deduction rules for the!^8fragment of minimal logic. It is shown how intuitionistic and classical logic can be embedded. Recursion and induction is added to obtain a more realistic proof system. Simple types are added in order to make the language more expressive
Program Development by Proof Transformation
 Fakultät für Mathematik, Informatik und Statistik der LMU, München
, 2009
"... iv With all its sinful doings, I must say, Con tutti i suoi pe
ati, devo dire That Italy's a pleasant pla
e for me, Che l'Italia mi pia
e,
he mi pia
e Who love to see the Sun shine every day, Vedere il sole splendere ogni giorno, And vines (not nail'd to walls) from tree to tree E ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
iv With all its sinful doings, I must say, Con tutti i suoi pe
ati, devo dire That Italy's a pleasant pla
e for me, Che l'Italia mi pia
e,
he mi pia
e Who love to see the Sun shine every day, Vedere il sole splendere ogni giorno, And vines (not nail'd to walls) from tree to tree E le viti non piantate su un muro, Festoon'd, mu
h like the ba
k s
ene of a play Ma abbarbi
ate ai trali
i, fondi Or melodrame, whi
h people o
k to see D'opera dove la gente a
orre When the rst a
t is ended by a dan
e Quando una danza
hiude il primo atto, In vineyards
opied from the south of Fran
e. Tra vigne rosseggianti
ome in Fran
ia. I also like to dine on be
a
as, Mi pia
e poi mangiare be
a
hi, To see the Sun set, sure he'll rise tomorrow, Guardare il sole
he tramonta,
erto Not through a misty morning twinkling weak as Che domani risorge e non opa
o A drunken man's dead eye in maudlin sorrow, Come un o
hio ubria
o tra le nubi, But with all Heaven t'himself; that day will break as Ma in pieno
ielo rinas
erà il giorno, Beauteous as
loudless, nor be fore'd to borrow Lu
ente e senza nuvole, e non gono
Program development through proof transformation
 CONTEMPORARY MATHEMATICS
, 1990
"... We present a methodology for deriving verified programs that combines theorem proving and proof transformation steps. It extends the paradigm employed in systems like NuPrl where a program is developed and verified through the proof of the specification in a constructive type theory. We illustrate ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We present a methodology for deriving verified programs that combines theorem proving and proof transformation steps. It extends the paradigm employed in systems like NuPrl where a program is developed and verified through the proof of the specification in a constructive type theory. We
Proof Transformations in HigherOrder Logic
, 1987
"... We investigate the problem of translating between different styles of proof systems in higherorder logic: analytic proofs which are well suited for automated theorem proving, and nonanalytic deductions which are well suited for the mathematician. Analytic proofs are represented as expansion proofs, ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
We investigate the problem of translating between different styles of proof systems in higherorder logic: analytic proofs which are well suited for automated theorem proving, and nonanalytic deductions which are well suited for the mathematician. Analytic proofs are represented as expansion proofs
Representing Proof Transformations for Program Optimization
 IN PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION
, 1994
"... In the proofs as programs methodology a program is derived from a formal constructive proof. Because of the close relationship between proof and program structure, transformations can be applied to proofs rather than to programs in order to improve performance. We describe a method for implementing ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In the proofs as programs methodology a program is derived from a formal constructive proof. Because of the close relationship between proof and program structure, transformations can be applied to proofs rather than to programs in order to improve performance. We describe a method
Results 1  10
of
3,963