1
0%
develop: 0%

Ran 11 Dec 2015 10:10PM UTC

Files 27

Run time 1s

Badge

Embed ▾

Committed 11 Dec 2015 08:19AM UTC coverage: 96.677% (-0.03%) from 96.708%

Job # PATH=$PATH:`pwd`/install/bin

Build Type

push

travis-ci

Committed by

rakhimov

Commit Message

Add a script to generate a fault tree of N Queens

This is a fault tree representation of the N Queens problem.
The problem can serve as a benchmark for BDD implementation.
MOCUS and ZBDD also solve the default (8 Queens) problem
in a short time as BDD (< 0.2s).

The major surprise came from the Preprocessor.
It takes from 0.5s to 1s depending on the analysis algorithm.

Run Details

5674 of 5869 relevant lines covered (96.68%)

7090.06 hits per line

rakhimov / scram / 739 / 1
0%
develop: 0%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 739.1 (PATH=$PATH:`pwd`/install/bin)

rakhimov / scram / 739 / 1 0% develop: 0%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 739.1 (PATH=$PATH:`pwd`/install/bin)

rakhimov / scram / 739 / 1
0%
develop: 0%

README BADGES
x