scispace - formally typeset
Journal ArticleDOI

An empirical study of the reliability of UNIX utilities

Reads0
Chats0
TLDR
The following section describes the tools built to test the utilities, including the fuzz (random character) generator, ptyjig (to test interactive utilities), and scripts to automate the testing process.
Abstract
The following section describes the tools we built to test the utilities. These tools include the fuzz (random character) generator, ptyjig (to test interactive utilities), and scripts to automate the testing process. Next, we will describe the tests we performed, giving the types of input we presented to the utilities. Results from the tests will follow along with an analysis of the results, including identification and classification of the program bugs that caused the crashes. The final section presents concluding remarks, including suggestions for avoiding the types of problems detected by our study and some commentary on the bugs we found. We include an Appendix with the user manual pages for fuzz and ptyjig.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Automated Vulnerability Analysis: Leveraging Control Flow for Evolutionary Input Crafting

TL;DR: This work presents an extension of traditional "black box" fuzz testing using a genetic algorithm based upon a dynamic Markov model fitness heuristic that is superior to random black box fuzzing for increasing code coverage and depth of penetration into program control flow logic.
Proceedings ArticleDOI

Random testing of interrupt-driven software

TL;DR: RID, a restricted interrupt discipline that hardens embedded software with respect to unexpected interrupts, making it possible to perform random interrupt testing and also protecting it from spurious interrupts after deployment, is designed, implemented, and evaluated.
Proceedings ArticleDOI

SemFuzz: Semantics-based Automatic Generation of Proof-of-Concept Exploits

TL;DR: SemFuzz is presented, a novel technique leveraging vulnerability-related text to guide automatic generation of PoC exploits for the vulnerability types never automatically attacked, indicating that more complicated flaws can also be automatically attacked.
Journal ArticleDOI

Genetic Algorithms for Randomized Unit Testing

TL;DR: Nighthawk is described, a system which uses a genetic algorithm (GA) to find parameters for randomized unit testing that optimize test coverage that suggest that FSS could significantly optimize metaheuristic search-based software engineering tools.
Proceedings ArticleDOI

Software Vulnerability Discovery Techniques: A Survey

TL;DR: This paper has done research on software vulnerability techniques, including static analysis, Fuzzing, penetration testing and vulnerability discovery models as an example of software vulnerability analysis methods which go hand in hand with vulnerability discovery techniques.
References
More filters
Journal ArticleDOI

On the criteria to be used in decomposing systems into modules

TL;DR: In this paper, the authors discuss modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time, and the effectiveness of modularization is dependent upon the criteria used in dividing the system into modules.
Journal ArticleDOI

Letters to the editor: go to statement considered harmful

TL;DR: My considerations are that, although the programmer's activity ends when he has constructed a correct program, the process taking place under control of his program is the true subject matter of his activity, and that his intellectual powers are rather geared to master static relations and his powers to visualize processes evolving in time are relatively poorly developed.
Book

Go to statement considered harmful

TL;DR: In form and content, Dijkstra's letter is similar to his 1965 paper, and the last few paragraphs underscore once again why the subject of structured programming stayed out of the mainstream of the data processing industry for so long.
Journal ArticleDOI

Efficient learning of context-free grammars from positive structural examples

TL;DR: It is shown that the class of reversible context-free grammars can be identified in the limit frompositive samples of structural descriptions and there exists an efficient algorithm to identify them from positive samples ofStructural descriptions, where a structural description of a context- free grammar is an unlabelled derivation tree of the grammar.
Journal ArticleDOI

Crisis and aftermath

TL;DR: Last November the Internet was infected with a worm program that eventually spread to thousands of machines, disrupting normal activities and Internet connectivity for many days.