Sciweavers

4850 search results - page 65 / 970
» Proof and Computation in Geometry
Sort
View
55
Voted
DM
2006
95views more  DM 2006»
14 years 11 months ago
Extending a matroid by a cocircuit
Our main result describes how to extend a matroid so that its ground set is a modular hyperplane of the larger matroid. This result yields a new way to view Dowling lattices and ne...
Joseph E. Bonin
CIE
2006
Springer
15 years 2 months ago
Coinductive Proofs for Basic Real Computation
We describe two representations for real numbers, signed digit streams and Cauchy sequences. We give coinductive proofs for the correctness of functions converting between these tw...
Tie Hou
JCS
2010
121views more  JCS 2010»
14 years 9 months ago
Computational soundness of symbolic zero-knowledge proofs
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
Michael Backes, Dominique Unruh
CCS
2009
ACM
15 years 5 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
82
Voted
EUROCAST
2005
Springer
97views Hardware» more  EUROCAST 2005»
15 years 4 months ago
Extracting Computer Algebra Programs from Statements
In this paper, an approach to synthesize correct programs from specifications is presented. The idea is to extract code from definitions appearing in statements which have been me...
Jesús Aransay, Clemens Ballarin, Julio Rubi...