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
Book ChapterDOI

Stateful Black-Box Fuzzing of Bluetooth Devices Using Automata Learning

TL;DR: In this paper , the authors present a stateful black-box fuzzing technique that uses a behavioral model of the system under test, instead of manually creating the model, they apply active automata learning to automatically infer the model.
Book ChapterDOI

Symbolic Execution and Recent Applications to Worst-Case Execution, Load Testing, and Security Analysis

TL;DR: Symbolic execution as mentioned in this paper is a technique which executes programs on symbolic inputs, representing multiple concrete inputs, and represents the program behavior using mathematical constraints over the symbolic inputs. But symbolic execution is not suitable for handling programs with complex inputs, coping with path explosion, and ameliorating the cost of constraint solving.
Dissertation

Editing composed languages

TL;DR: An incremental parser is extended to create an approach that bridges the two extremes: an editor that ‘feels’ like a normal text editor, but always operates on a valid tree as in syntax-directed editing, which allows users to compose arbitrary syntaxes.
Proceedings ArticleDOI

Using Behavioral Profiles to Detect Software Flaws in Network Servers

João Antunes, +1 more
TL;DR: The detection approach consists in inferring a behavioral profile of a network server that models its correct execution by combining information about the implemented state machine protocol and the server's internal execution.
Proceedings ArticleDOI

Ori: A Greybox Fuzzer for SOME/IP Protocols in Automotive Ethernet

TL;DR: Ori as mentioned in this paper is a greybox fuzzer for Some/IP applications, which features two key innovations: the attach fuzzing mode and structural mutation, which enables Ori to test server programs efficiently, and the structural mutation allows Ori to generate valid SOME/IP packets to reach deep paths.
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.