3481 search results - page 342 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
168
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
141
click to vote
CSL
2008
Springer
15 years 6 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
158
click to vote
LOGCOM
2010
14 years 11 months ago
2010
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
129
click to vote
KI
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Rule-based programming paradigm is omnipresent in number of engineering domains. However, there are some fundamental semantical differences between it, and classic progr...
131
click to vote
LOPSTR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...