TY  - CHAP
SN  - 0302-9743
AV  - none
T2  - Logic-Based Program Synthesis and Transformation
SP  - 106
EP  - 122
UR  - http://dx.doi.org/10.1007/978-3-642-32211-2_8
PB  - Springer-Verlag
ID  - eprints1343
N2  - We propose a program specialization technique for locally stratified CLP(?) programs, that is, logic programs with linear constraints over the set ? of the integer numbers. For reasons of efficiency our technique makes use of a relaxation from integers to reals. We reformulate the familiar unfold/fold transformation rules for CLP programs so that: (i) the applicability conditions of the rules are based on the satisfiability or entailment of constraints over the set ? of the real numbers, and (ii) every application of the rules transforms a given program into a new program with the same perfect model constructed over ?. Then, we introduce a strategy which applies the transformation rules for specializing CLP(?) programs with respect to a given query. Finally, we show that our specialization strategy can be applied for verifying properties of infinite state reactive systems specified by constraints over ?.
N1  - 21st International Symposium, LOPSTR 2011, Odense, Denmark, July 18-20, 2011. Revised Selected Papers
TI  - Using Real Relaxations during Program Specialization
A1  - Fioravanti, Fabio
A1  - Pettorossi, Alberto
A1  - Proietti, Maurizio
A1  - Senni, Valerio
T3  - Lecture Notes in Computer Science
Y1  - 2012///
ER  -