Sciweavers

195 search results - page 14 / 39
» Matrix-based Constructive Theorem Proving
Sort
View
ACISP
2009
Springer
13 years 10 months ago
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
Abstract. We establish a framework for bounding the efficiency of cryptographic reductions in terms of their security transfer. While efficiency bounds for the reductions have been...
Ahto Buldas, Aivo Jürgenson, Margus Niitsoo
AIED
2005
Springer
14 years 8 days ago
Advanced Geometry Tutor: An intelligent tutor that teaches proof-writing with construction
: Two problem solving strategies, forward chaining and backward chaining, were compared to see how they affect students’ learning of geometry theorem proving with construction. I...
Noboru Matsuda, Kurt VanLehn
ALC
1997
13 years 8 months ago
Predicative semantics of loops
A predicative semantics is a mapping of programs to predicates. These predicates characterize sets of acceptable observations. The presence of time in the observations makes the o...
Theodore S. Norvell
CSFW
2000
IEEE
13 years 10 months ago
Towards Automatic Verification of Authentication Protocols on an Unbounded Network
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
James Heather, Steve Schneider
JSC
2008
73views more  JSC 2008»
13 years 6 months ago
Standard bases in K
In this paper we study standard bases for submodules of K[[t1, . . . , tm]][x1, . . . , xn]s respectively of their localisation with respect to a t-local monomial ordering. The mai...
Thomas Markwig