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

Cognitive radio testing framework based on USRP

TL;DR: A flexible testing framework for CR devices implemented using the Universal Software Radio Peripheral (USRP) Software Defined Radio (SDR) platform is proposed and described, together with a case study on a commercially available device.
Proceedings ArticleDOI

SymJEx: symbolic execution on the GraalVM

TL;DR: This paper presents a novel symbolic execution engine called SymJEx, implemented on top of the multi-language Java Virtual Machine GraalVM, which uses the Graal compiler's intermediate representation to derive and evaluate path conditions, allowingGraalVM users to leverage the engine to improve software quality.

Web application vulnerability detection using dynamic analysis with peneteration testing

TL;DR: Extensions to the Tainted Mode Model (TMM) are presented which allows inter module vulnerabilities detection and a new approach to vulnerability is presented.

Dynamic test generation for large binary programs

TL;DR: This thesis develops new methods for addressing the problem of software security bugs, shows that these methods scale to large commodity software, and lays the foundation for a service that makes automatic, effective security testing available at a modest cost per bug found.
Posted Content

Inputs from Hell: Generating Uncommon Inputs from Common Samples.

TL;DR: This work uses a context-free grammar to parse a set of sample input files that represent the program's common usage, and determines probabilities for individual grammar production as they occur during parsing the inputs to obtain inputs that are close to the samples.
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.