126 search results - page 4 / 26 » Advanced Logic Program Specialisation |
113
Voted
TCS
2008
15 years 1 months ago
2008
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
89
Voted
WLP
1997
Springer
15 years 5 months ago
1997
Springer
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
ESOP
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most ...
125
Voted
WLP
1997
Springer
15 years 5 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
123
Voted
DAGSTUHL
1996
15 years 2 months ago
1996
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...