1410 search results - page 61 / 282 » Proving theorems by reuse |
AIR
2005
13 years 10 months ago
2005
As software organisations mature, their repositories of reusable software components from previous projects will also grow considerably. Remaining conversant with all components in...
WADS
2009
Springer
14 years 4 months ago
2009
Springer
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedro...
TCC
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
CADE
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
DM
2007
13 years 10 months ago
2007
Arrow’s impossibility theorem [1] shows that the set of acyclic tournaments is not closed to non dictatorial Boolean aggregation. In this paper we extend the notion of aggregati...