Computer worm 2026-11-05
A computer worm is a self-contained computer program that propagates by creating further copies across computing systems, often through a computer network. In the usual security classification it is malware. Unlike a computer virus, it need not attach its code to another program in order to replicate.[ref]
A worm's impact can include resource exhaustion from replication itself, independently of any additional destructive action. Eugene H. Spafford's analysis of the November1988 Internet worm is an early primary study of a large network incident and its program behavior.[ref]
An original population model shows why replication matters. Suppose each affected machine remains affected and produces exactly one newly affected machine per time interval, with no overlap or shortage of susceptible machines. If counts affected machines, then
This stipulated exponential growth model is not a forecast of a real outbreak. Repeated contacts, limited connectivity and containment change the growth pattern. It separates the potential for multiplying copies from the behavior of any particular implementation.
The concept is useful in computer security because one compromised machine can become a source of further disruption. Network structure and the timing of defensive containment matter alongside the behavior observed on an individual host.
Eugene H. Spafford 2026-11-05
Eugene H. Spafford researches computer security and analyzed the computer worm that disrupted Internet systems in November 1988. His technical report reconstructed the program's behavior using independent reverse-compilations and a disassembly, connecting observed failures with weaknesses in the affected systems.[ref]
The historical program copied itself between vulnerable machines running versions of Unix. Its disruption illustrates a security failure involving computation and connectivity, even without defining the event solely by altered user files. Spafford's analysis treated program behavior, system assumptions and possible mitigations as related parts of the explanation.[ref]
An original resource model separates stored-data correctness from service availability. Suppose legitimate work requires 25 percent of a CPU's capacity, and each unwanted running copy requires another two percent. Twenty copies demand of capacity; 40 demand . In this stipulated model, the latter demand exceeds what that CPU can supply, so some work must wait or fail. No changed document is required for users to lose timely service. These invented loads are an explanatory model, not measurements of the 1988 incident.
Reconstructing what a computer program did therefore supports a more precise security claim than merely observing that a machine became slow. The tested resource and the evidence for the failure mechanism must both be stated.
Figure 1.
Eugene H. Spafford, named portrait in Purdue University's Department of Computer Science profile
.