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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
package testing;
import java.util.*;
import java.util.regex.*;
import java.util.function.Predicate;
/**
* Flexible verification system for checking protocol behavior through log analysis.
* Supports pattern matching, sequence verification, and count-based assertions.
*/
public class ProtocolVerifier {
private final List<VerificationRule> rules;
public ProtocolVerifier() {
this.rules = new ArrayList<>();
}
/**
* Add a custom verification rule.
*/
public ProtocolVerifier withRule(VerificationRule rule) {
rules.add(rule);
return this;
}
/**
* Expect a log message containing the pattern at least once.
*/
public ProtocolVerifier expectLog(String pattern) {
rules.add(new PatternRule(pattern, 1, Integer.MAX_VALUE));
return this;
}
/**
* Expect a log message containing the pattern exactly n times.
*/
public ProtocolVerifier expectLogExactly(String pattern, int count) {
rules.add(new PatternRule(pattern, count, count));
return this;
}
/**
* Expect a log message containing the pattern at least n times.
*/
public ProtocolVerifier expectLogAtLeast(String pattern, int minCount) {
rules.add(new PatternRule(pattern, minCount, Integer.MAX_VALUE));
return this;
}
/**
* Expect a log message containing the pattern at most n times.
*/
public ProtocolVerifier expectLogAtMost(String pattern, int maxCount) {
rules.add(new PatternRule(pattern, 0, maxCount));
return this;
}
/**
* Expect a sequence of patterns in order.
*/
public ProtocolVerifier expectSequence(String... patterns) {
rules.add(new SequenceRule(Arrays.asList(patterns)));
return this;
}
/**
* Expect no log messages containing the pattern.
*/
public ProtocolVerifier expectNoLog(String pattern) {
rules.add(new PatternRule(pattern, 0, 0));
return this;
}
/**
* Expect a log from a specific process.
*/
public ProtocolVerifier expectLogFromProcess(int processNum, String pattern) {
rules.add(new ProcessPatternRule(processNum, pattern, 1, Integer.MAX_VALUE));
return this;
}
/**
* Verify all rules against the provided logs.
*/
public VerificationResult verify(List<LogEntry> logs) {
List<RuleResult> results = new ArrayList<>();
for (VerificationRule rule : rules) {
results.add(rule.verify(logs));
}
return new VerificationResult(results);
}
// Rule implementations
/**
* Rule that matches log messages against a pattern.
*/
private static class PatternRule implements VerificationRule {
private final Pattern pattern;
private final int minCount;
private final int maxCount;
private final String description;
public PatternRule(String pattern, int minCount, int maxCount) {
// Try to compile as regex first, if it fails, use literal matching
Pattern compiledPattern;
try {
compiledPattern = Pattern.compile(pattern);
} catch (PatternSyntaxException e) {
// If not a valid regex, escape it for literal matching
compiledPattern = Pattern.compile(Pattern.quote(pattern));
}
this.pattern = compiledPattern;
this.minCount = minCount;
this.maxCount = maxCount;
this.description = String.format(
"Pattern '%s' should appear %s times",
pattern,
minCount == maxCount ?
String.valueOf(minCount) :
minCount + "-" + (maxCount == Integer.MAX_VALUE ? "∞" : maxCount)
);
}
@Override
public RuleResult verify(List<LogEntry> logs) {
int count = 0;
List<LogEntry> matches = new ArrayList<>();
for (LogEntry log : logs) {
if (pattern.matcher(log.getMessage()).find()) {
count++;
matches.add(log);
}
}
boolean passed = count >= minCount && count <= maxCount;
String message = String.format(
"%s (found %d occurrences)",
description, count
);
return new RuleResult(passed, message, matches);
}
}
/**
* Rule that verifies a sequence of patterns appear in order.
*/
private static class SequenceRule implements VerificationRule {
private final List<Pattern> patterns;
private final String description;
public SequenceRule(List<String> patterns) {
this.patterns = new ArrayList<>();
for (String p : patterns) {
try {
this.patterns.add(Pattern.compile(p));
} catch (PatternSyntaxException e) {
this.patterns.add(Pattern.compile(Pattern.quote(p)));
}
}
this.description = "Sequence: " + String.join(" → ", patterns);
}
@Override
public RuleResult verify(List<LogEntry> logs) {
int patternIndex = 0;
List<LogEntry> matches = new ArrayList<>();
for (LogEntry log : logs) {
if (patternIndex < patterns.size() &&
patterns.get(patternIndex).matcher(log.getMessage()).find()) {
matches.add(log);
patternIndex++;
}
}
boolean passed = patternIndex == patterns.size();
String message = String.format(
"%s (%d/%d patterns matched)",
description, patternIndex, patterns.size()
);
return new RuleResult(passed, message, matches);
}
}
/**
* Rule that matches patterns from a specific process.
*/
private static class ProcessPatternRule implements VerificationRule {
private final int processNum;
private final Pattern pattern;
private final int minCount;
private final int maxCount;
private final String description;
public ProcessPatternRule(int processNum, String pattern, int minCount, int maxCount) {
this.processNum = processNum;
Pattern compiledPattern;
try {
compiledPattern = Pattern.compile(pattern);
} catch (PatternSyntaxException e) {
compiledPattern = Pattern.compile(Pattern.quote(pattern));
}
this.pattern = compiledPattern;
this.minCount = minCount;
this.maxCount = maxCount;
this.description = String.format(
"Process %d: Pattern '%s' should appear %s times",
processNum, pattern,
minCount == maxCount ?
String.valueOf(minCount) :
minCount + "-" + (maxCount == Integer.MAX_VALUE ? "∞" : maxCount)
);
}
@Override
public RuleResult verify(List<LogEntry> logs) {
int count = 0;
List<LogEntry> matches = new ArrayList<>();
for (LogEntry log : logs) {
if (log.isFromProcess(processNum) &&
pattern.matcher(log.getMessage()).find()) {
count++;
matches.add(log);
}
}
boolean passed = count >= minCount && count <= maxCount;
String message = String.format(
"%s (found %d occurrences)",
description, count
);
return new RuleResult(passed, message, matches);
}
}
}
|
