Sciweavers

1818 search results - page 34 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
AAAI
2010
13 years 9 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
AIML
2004
13 years 9 months ago
A Systematic Proof Theory for Several Modal Logics
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame s...
Charles Stewart, Phiniki Stouppa
DIAGRAMS
2010
Springer
13 years 8 months ago
An Attention Based Theory to Explore Affordances of Textual and Diagrammatic Proofs
Shimojima and Katagiri have demonstrated that diagrams reduce "inferential load" during reasoning by scaffolding visual-spatial aspects of memory. In response, we wondere...
Peter Coppin, Jim Burton, Stephen Hockema
JLP
2008
129views more  JLP 2008»
13 years 7 months ago
Program and proof optimizations with type systems
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented...
Ando Saabas, Tarmo Uustalu