1410 search results - page 39 / 282 » Proving theorems by reuse |
ICFCA
2007
Springer
14 years 1 months ago
2007
Springer
Several fuzzifications of formal concept analysis have been proposed to deal with uncertainty or incomplete information. In this paper, we focus on the new paradigm of multi-adjoin...
DAM
2007
13 years 10 months ago
2007
We show that the logical theory QLA proves the Cayley–Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Sin...
TPHOL
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe t...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
ZUM
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We present a new methodology that permits to reuse an existing hardware component that has not been developed within the B framework while maintaining a correct design ï¬...