632 search results - page 16 / 127 » Combining programming with theorem proving |
FAC
2010
13 years 5 months ago
2010
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
MFPS
1991
13 years 11 months ago
1991
The problem of decomposing domains into sensible factors is addressed and solved for the case of dI-domains. A decomposition theorem is proved which allows the represention of a l...
PLILP
1998
Springer
13 years 12 months ago
1998
Springer
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
JCT
2010
13 years 2 months ago
2010
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
EPIA
2001
Springer
14 years 7 days ago
2001
Springer
Abstract. Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connect...