Search results
Results from the WOW.Com Content Network
The concept behind a fork bomb — the processes continually replicate themselves, potentially causing a denial of service. In computing, a fork bomb (also called rabbit virus) is a denial-of-service (DoS) attack wherein a process continually replicates itself to deplete available system resources, slowing down or crashing the system due to resource starvation.
Article mentions that bash fork bomb was created by Jaromil in 2002. I was able to find posts of a polish white hat - lcamtuf from 1999 in usenet, in which he had this fork bomb in his signature. Necc 17:25, 13 March 2008 (UTC) If you can cite a source of this update the page ;) You might want to tell Jaromil too!
One of the earliest references to a fork concept appeared in A Multiprocessor System Design by Melvin Conway, published in 1962. [1] Conway's paper motivated the implementation by L. Peter Deutsch of fork in the GENIE time-sharing system, where the concept was borrowed by Ken Thompson for its earliest appearance [2] in Research Unix.
The Rabbit (or Wabbit) virus, more a fork bomb than a virus, is written. The Rabbit virus makes multiple copies of itself on a single computer (and was named "rabbit" for the speed at which it did so) until it clogs the system, reducing system performance, before finally reaching a threshold and crashing the computer. [10]
The first use of a time bomb in software may have been in 1979 with the Scribe markup language and word processing system, developed by Brian Reid.Reid sold Scribe to a software company called Unilogic (later renamed Scribe Systems [2]), and agreed to insert a set of time-dependent functions (called "time bombs") that would deactivate freely copied versions of the program after a 90-day ...
Fork bomb: a similar method to exhaust a system's resources through recursion; Zip bomb: a similar attack utilizing zip archives; XML external entity attack: an XML attack to return arbitrary server files; Document type definition: a template for validating XML files
When starvation is impossible in a concurrent algorithm, the algorithm is called starvation-free, lockout-freed [2] or said to have finite bypass. [3] This property is an instance of liveness , and is one of the two requirements for any mutual exclusion algorithm; the other being correctness .
In C++, because dereferencing a null pointer is undefined behavior, compiler optimizations may cause other checks to be removed, leading to vulnerabilities elsewhere in the code. [ 29 ] [ 30 ] Some lists may also include race conditions (concurrent reads/writes to shared memory) as being part of memory safety (e.g., for access control).