smc_scan_core 0.1.0

Core module for the Scan model checker.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147

use criterion::{BenchmarkId, Criterion, criterion_group, criterion_main};
use rand::SeedableRng;
use rand::rngs::SmallRng;
use scan_core::program_graph::*;
use scan_core::*;

#[inline(always)]
fn run_to_completion(pg: &mut ProgramGraphRun) {
    let mut rng = SmallRng::from_seed([0; 32]);

    while let Some((action, post)) = pg
        .possible_transitions()
        .filter_map(|(a, iter)| {
            iter.into_iter()
                .map(|v| v.last())
                .collect::<Option<Vec<_>>>()
                .map(|l| (a, l))
        })
        .last()
    {
        assert!(pg.transition(action, post.as_slice(), &mut rng).is_ok());
    }
}

#[inline(always)]
fn simple_pg() -> ProgramGraphBuilder {
    let mut pg = ProgramGraphBuilder::new();
    let pre = pg.new_initial_location();
    let action = pg.new_action();
    let post = pg.new_location();
    pg.add_transition(pre, action, post, None).unwrap();
    pg
}

#[inline(always)]
fn condition_pg() -> ProgramGraphBuilder {
    let mut pg = ProgramGraphBuilder::new();
    let pre = pg.new_initial_location();
    let action = pg.new_action();
    let post = pg.new_location();
    pg.add_transition(
        pre,
        action,
        post,
        Some(BooleanExpr::Implies(Box::new((
            Expression::less_than_or_equal_to(
                ((((Expression::from(Val::Integer(1)) + Expression::from(Val::Integer(2)))
                    .unwrap()
                    + Expression::from(Val::Integer(3)))
                .unwrap()
                    + Expression::from(Val::Integer(4)))
                .unwrap()
                    + Expression::from(Val::Integer(5)))
                .unwrap(),
                Expression::from(Val::Integer(100)),
            )
            .unwrap(),
            Expression::greater_than(
                Expression::from(Val::Integer(5)),
                Expression::from(Val::Integer(6)),
            )
            .unwrap(),
        )))),
    )
    .unwrap();
    pg
}

#[inline(always)]
fn long_pg() -> ProgramGraphBuilder {
    let mut pg = ProgramGraphBuilder::new();
    let mut pre = pg.new_initial_location();
    let action = pg.new_action();
    for _ in 0..10 {
        let post = pg.new_location();
        pg.add_transition(pre, action, post, None).unwrap();
        pre = post;
    }
    pg
}

#[inline(always)]
fn counter_pg() -> ProgramGraphBuilder {
    let mut pg = ProgramGraphBuilder::new();
    let initial = pg.new_initial_location();
    let action = pg.new_action();
    let var = pg.new_var(Val::Integer(0)).unwrap();
    pg.add_effect(
        action,
        var,
        (Expression::from_var(var, Type::Integer) + Expression::from(Val::Integer(1))).unwrap(),
    )
    .unwrap();
    for counter in 0..10 {
        let guard = Expression::equal_to(
            Expression::from_var(var, Type::Integer),
            Expression::from(Val::Integer(counter)),
        )
        .unwrap();
        pg.add_transition(initial, action, initial, Some(guard))
            .unwrap();
    }
    pg
}

fn possible_transitions(c: &mut Criterion) {
    let pgs = [
        (simple_pg(), "simple pg"),
        (condition_pg(), "condition pg"),
        (long_pg(), "long pg"),
        (counter_pg(), "counter pg"),
    ];
    for (pg, name) in pgs.into_iter() {
        let pg = pg.build();
        let pg = pg.new_instance();
        c.bench_with_input(
            BenchmarkId::new("possible transitions", name),
            &pg,
            |b, pg| {
                b.iter(|| pg.possible_transitions().count());
            },
        );
    }
}

fn run(c: &mut Criterion) {
    let pgs = [
        (simple_pg(), "simple pg"),
        (condition_pg(), "condition pg"),
        (long_pg(), "long pg"),
        (counter_pg(), "counter pg"),
    ];
    for (pg, name) in pgs.into_iter() {
        let pg = pg.build();
        c.bench_with_input(
            BenchmarkId::new("execute to termination", name),
            &pg,
            |b, pg| {
                let mut pg = pg.new_instance();
                b.iter(|| run_to_completion(&mut pg));
            },
        );
    }
}

criterion_group!(benches, possible_transitions, run);
criterion_main!(benches);