26 search results - page 1 / 6 » Parameterizing a Groundness Analysis of Logic Programs |
SAS
2001
Springer
13 years 9 months ago
2001
Springer
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
ICLP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
KBSE
2000
IEEE
13 years 8 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...