Sciweavers

1322 search results - page 198 / 265
» Unsound Theorem Proving
Sort
View
RANDOM
1997
Springer
14 years 29 days ago
Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞ ; the study of resource-bounded measure ...
Steven M. Kautz
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
14 years 17 days ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
CARDIS
2006
Springer
114views Hardware» more  CARDIS 2006»
14 years 17 days ago
A Low-Footprint Java-to-Native Compilation Scheme Using Formal Methods
Ahead-of-Time and Just-in-Time compilation are common ways to improve runtime performances of restrained systems like Java Card by turning critical Java methods into native code. H...
Alexandre Courbot, Mariela Pavlova, Gilles Grimaud...
ITP
2010
230views Mathematics» more  ITP 2010»
13 years 10 months ago
On the Formalization of the Lebesgue Integration Theory in HOL
Lebesgue integration is a fundamental concept in many mathematical theories, such as real analysis, probability and information theory. Reported higher-order-logic formalizations o...
Tarek Mhamdi, Osman Hasan, Sofiène Tahar
TPCD
1994
157views Hardware» more  TPCD 1994»
13 years 10 months ago
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
John W. O'Leary, Miriam Leeser, Jason Hickey, Mark...