45 search results - page 2 / 9 » cats 2006 |
CATS
2006
13 years 6 months ago
2006
We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed ...
CATS
2006
13 years 6 months ago
2006
In this paper, we study the formalization of one-pass call-by-value CPS compilation using higher-order abstract syntax. In particular, we verify mechanically that the source progr...
CATS
2006
13 years 6 months ago
2006
This paper gives an overview of a pilot project on the specification and verification of the L4 highperformance microkernel. Of the three aspects examined in the project, we descr...
IJON
2000
13 years 4 months ago
2000
CATS
2006
13 years 6 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...