Fioravanti, Fabio and Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio Using Real Relaxations during Program Specialization. In: Logic-Based Program Synthesis and Transformation. Lecture Notes in Computer Science (7225). Springer-Verlag, pp. 106-122. ISBN 978-3-642-32210-5 (2012)Full text not available from this repository.
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 ℤ.
|Item Type:||Book Section|
|Additional Information:||21st International Symposium, LOPSTR 2011, Odense, Denmark, July 18-20, 2011. Revised Selected Papers|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 40 not found.|
|Date Deposited:||13 Sep 2012 10:29|
|Last Modified:||07 Mar 2013 12:56|
Actions (login required)