4513 search results - page 366 / 903 » Logic programming with satisfiability |
116
Voted
TSE
1998
15 years 4 months ago
1998
—Masking fault-tolerance guarantees that programs continually satisfy their specification in the presence of faults. By way of contrast, nonmasking fault-tolerance does not guara...
134
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
130
click to vote
APLAS
2009
ACM
15 years 11 months ago
2009
ACM
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
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...
124
click to vote
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...