367 search results - page 13 / 74 » Adapting functional programs to higher order logic |
CRYPTO
2006
Springer
14 years 9 days ago
2006
Springer
Abstract. One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always w...
VISUALIZATION
2005
IEEE
14 years 2 months ago
2005
IEEE
Techniques in numerical simulation such as the finite element method depend on basis functions for approximating the geometry and variation of the solution over discrete regions ...
CADE
2000
Springer
14 years 29 days ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
TPHOL
1998
IEEE
14 years 26 days ago
1998
IEEE
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns o...
ITP
2010
14 years 16 days ago
2010
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...