407 search results - page 6 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
LOPSTR
1997
Springer
13 years 11 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
PLDI
2010
ACM
13 years 11 months ago
2010
ACM
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
IWFM
1998
13 years 9 months ago
1998
The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...