Sciweavers

1302 search results - page 71 / 261
» Free-Style Theorem Proving
Sort
View
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 8 months ago
A tight quantitative version of Arrow's impossibility theorem
The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelev...
Nathan Keller
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
13 years 11 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider
GC
2007
Springer
13 years 7 months ago
An Ore-type analogue of the Sauer-Spencer Theorem
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
Alexandr V. Kostochka, Gexin Yu
WADS
2009
Springer
237views Algorithms» more  WADS 2009»
14 years 2 months ago
A Pseudopolynomial Algorithm for Alexandrov's Theorem
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...
Daniel M. Kane, Gregory N. Price, Erik D. Demaine
TCC
2004
Springer
118views Cryptology» more  TCC 2004»
14 years 1 months ago
A General Composition Theorem for Secure Reactive Systems
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...
Michael Backes, Birgit Pfitzmann, Michael Waidner