- Full text PDF available (5)
- This year (0)
- Last 5 years (1)
- Last 10 years (4)
Journals and Conferences
DNSSEC protocol deployment has taken place in phases, beginning with protocol development and followed by the signing of top-level zones and early-adopter “leaf” zones. The next phase is to encourage wide-scale validation, as that will improve the overall DNS system and enable new applications. In order to quantify DNSSEC usage for audiences it is important… (More)
Since mid-November 1966 a chess program has been under development at the Artificial Intelligence Laboratory of Project MAC at M.I.T. This paper describes the state of the program as of August 1967 and gives some of the details of the heuristics and algorithms employed.
DNSSEC is properly understood as a component in an ecology of security protocols and measures.
The Advanced Research Projects Agency (ARPA) Computer Network (hereafter referred to as the "ARPA network") is one of the most ambitious computer networks attempted to date. The types of machines and operating systems involved in the network vary widely. For example, the computers at the first four sites are an XDS 940 (Stanford Research Institute), an IBM… (More)
Much has been said about the mechanics of the ARPA Computer Network (ARPANET) and especially about the organization of its communications subnet. Until recently the main effort has gone into the implementation of an ARPANET user-level communications interface. Operating just above the communications subnet in ARPANET HOST Computers, this ARPANET interface… (More)
Classically the preponderance of measurements made on information processing systems is done for purposes of prediction or diagnosis of malfunction. The environment is monitored with observations of the ambient temperature, common system voltages and currents, and clocking pulse streams. Micromeasurements of system elements are made on-line with… (More)
This paper is a progress report on an experimental system, the state delta verification system (SDVS), for verifying microcode correctness. The goal of this project is to solve some of the problems, both theoretical and engineering, obstructing the realization of a usable and applicable program for checking proofs of microcode correctness. The ideal result… (More)
The concept of least fixed-point of a continuous function can be considered as the unifying thread of this dissertation. The connections between fixed-points and recursive programs are detailed in Chapter 2, providing some insights on practical implementations of recursion. There are two usual characterizations of the least fixed-point of a continuous… (More)