Skip to content

A Java implementation of the oneMinimal algorithm for delta debugging. This tool helps identify the minimal input that reproduces a failure in code, aiding in efficient bug isolation. Includes examples for simplifying HTML and identifying problematic input strings.

Notifications You must be signed in to change notification settings

JoyAlbertini/1_minimal

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Joy Albertini

Java Implementation of one minimal algorithm for delta debugging.

OneMinimal algorithm

The oneMinimal algorithm is designed to find the minimal input that reproduces a failure (bug) by systematically reducing the size of the input while ensuring that the failure still occurs.

Examples HtmlPage

ExampleWebPage

For example, in a web page with multiple <\SELECT> elements and options, the delta debugging process would simplify the input to find the smallest subset of HTML that still causes a segmentation fault or browser crash. Real-world Scenario

Examples of a program

Example42

a program crashes when its input contains 42. By applying delta debugging with character granularity, you progressively minimize the input until finding that "42" is the minimal input that causes the crash.

About

A Java implementation of the oneMinimal algorithm for delta debugging. This tool helps identify the minimal input that reproduces a failure in code, aiding in efficient bug isolation. Includes examples for simplifying HTML and identifying problematic input strings.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages