Sciweavers

1410 search results - page 125 / 282
» Proving theorems by reuse
Sort
View
174
Voted
CDC
2009
IEEE
112views Control Systems» more  CDC 2009»
15 years 11 months ago
A Floquet-like factorization for linear periodic systems
In this note, the novel representation is proposed for a linear periodic continuous-time system with T-periodic real-valued coefficients. We prove that a T-periodic real-valued fac...
Ichiro Jikuya, Ichijo Hodaka
171
Voted
BIRTHDAY
2006
Springer
15 years 10 months ago
Reductio ad Absurdum: Planning Proofs by Contradiction
Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
Erica Melis, Martin Pollet, Jörg H. Siekmann
190
Voted
BIRTHDAY
2006
Springer
15 years 10 months ago
Best-First Rippling
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
Moa Johansson, Alan Bundy, Lucas Dixon
CAV
2008
Springer
131views Hardware» more  CAV 2008»
15 years 9 months ago
Validating High-Level Synthesis
The growing design-productivity gap has made designers shift toward using high-level languages like C, C++ and Java to do system-level design. High-Level Synthesis (HLS) is the pro...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta
147
Voted
CORR
2006
Springer
82views Education» more  CORR 2006»
15 years 7 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...