barrucadu/dejafu

Add test using fair or length bounding without preemption bounding

Open

#209 opened on Feb 16, 2018

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Haskell (18 forks)github user discovery
T: enhancementgood first issue

Repository metrics

Stars
 (201 stars)
PR merge metrics
 (Avg merge 21m) (1 merged PR in 30d)

Description

All the systematic tests use preemption bounding (PB). The backtracking for fair bounding (FB) is disabled when doing PB, as the set of backtracking points identified by PB is sufficient. But this means we're not testing the case where we have FB but no PB.

Similarly, we're not testing the case where we only length bounding (LB).

I think this would be best tested by adding some examples with spinlocks, and running them (a) with FB and LB but no PB, and (b) with just LB.

W and TEST introduced in #197 makes it possible to test arbitrary Ways.

Contributor guide

Research direction
Study existing systematic tests that use preemption bounding (PB). Then create new test examples with spinlocks that use fair bounding (FB) and length bounding (LB) but no PB, as well as LB only. Use the `W` and `TEST` from the framework to specify arbitrary ways.
Tech stack
haskell
Domain
testing
Issue type
Test
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Haskelldejafu testing framework
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
50