5506 search results - page 374 / 1102 » Minimal Logic Programs |
141
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
172
click to vote
ESOP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
189
click to vote
RTA
2010
Springer
15 years 10 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 ...
167
Voted
CSL
2008
Springer
15 years 8 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...
184
click to vote
LOGCOM
2010
15 years 28 days 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,...