Typing Linear Constraints for Moding CLP() Programs - Université de La Réunion Access content directly
Conference Papers Year : 2008

Typing Linear Constraints for Moding CLP() Programs

Abstract

We present a type system for linear constraints over reals and its use in mode analysis of CLP programs. The type system is designed to reason about the properties of deØniteness, lower and upper bounds of variables of a linear constraint. Two proof procedures are resented for checking validity of type assertions. The Ørst one considers lower and upper bound types, and it relies on solving homogeneous linear programming problems. The second procedure, which deals with deØniteness as well, relies on computing the Minkowski's form of a parameterized poly-hedron. The two procedures are sound and complete. We extend the approach to deal with strict inequalities and disequalities. Type assertions are at the basis of moding constraint logic programs. We extend the notion of well-moding from pure logic programming to CLP(R).
No file

Dates and versions

hal-01188719 , version 1 (31-08-2015)

Identifiers

  • HAL Id : hal-01188719 , version 1

Cite

Salvatore Ruggieri, Frédéric Mesnard. Typing Linear Constraints for Moding CLP() Programs. Static Analysis, 15th International Symposium, SAS 2008, Jul 2008, Valencia, Spain. pp.128--143. ⟨hal-01188719⟩
116 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More