Sciweavers

233 search results - page 29 / 47
» Applications of Polytypism in Theorem Proving
Sort
View
FROCOS
2009
Springer
15 years 6 months ago
Combining Theories with Shared Set Operations
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
Thomas Wies, Ruzica Piskac, Viktor Kuncak
CRYPTO
2007
Springer
116views Cryptology» more  CRYPTO 2007»
15 years 5 months ago
Random Oracles and Auxiliary Input
We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain informa...
Dominique Unruh
IUI
2006
ACM
15 years 5 months ago
Eye-tracking to model and adapt to user meta-cognition in intelligent learning environments
In this paper we describe research on using eye-tracking data for on-line assessment of user meta-cognitive behavior during the interaction with an intelligent learning environmen...
Christina Merten, Cristina Conati
TPHOL
2005
IEEE
15 years 5 months ago
From PSL to LTL: A Formal Validation in HOL
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
Thomas Tuerk, Klaus Schneider
LOPSTR
2004
Springer
15 years 5 months ago
Natural Rewriting for General Term Rewriting Systems
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
Santiago Escobar, José Meseguer, Prasanna T...