171
click to vote
SPIN
15 years 10 months ago
2005 Springer 
Abstract. This paper presents a technique that uses code to automatically generate its own test cases at run-time by using a combination of symbolic and concrete (i.e., regular) ex...
130
click to vote
SPIN
15 years 10 months ago
2005 Springer 
We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by...
146
Voted
SPIN
15 years 10 months ago
2005 Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
136
click to vote
SPIN
15 years 10 months ago
2005 Springer
We present a novel algorithm for repairing structurally complex data. Given an assertion that represents desired structural integrity constraints and a structure that violates them...
143
Voted
SPIN
15 years 10 months ago
2005 Springer
We describe a method for the specification and verification of the dynamic behaviour of component systems. Building applications using a component framework allows the developers...
|
Theoretical Computer Science