700 search results - page 11 / 140 » On Termination of Constraint Logic Programs |
95
Voted
TOPLAS
2008
15 years 13 days ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
95
Voted
LOPSTR
2009
Springer
15 years 7 months ago
2009
Springer
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...
100
Voted
LATA
2009
Springer
15 years 7 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
121
Voted
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
94
Voted
CADE
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...