5506 search results - page 361 / 1102 » Minimal Logic Programs |
136
click to vote
FMCO
2003
Springer
15 years 10 months ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
127
Voted
LICS
1989
IEEE
15 years 9 months ago
1989
IEEE
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the...
168
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
160
click to vote
ICTAC
2010
Springer
15 years 3 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
155
Voted
SCAM
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we describe an improved formalisation of slicing in WSL transformation theory and apply the result to a particularly challenging slicing problem: the SCAM mug [1]. W...