14 search results - page 1 / 3 » The Nuggetizer: Abstracting Away Higher-Orderness for Progra... |
APLAS
2007
ACM
13 years 8 months ago
2007
ACM
TPHOL
1998
IEEE
13 years 8 months ago
1998
IEEE
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
APLAS
2010
ACM
13 years 4 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
ESOP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
APLAS
2010
ACM
13 years 4 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...