Abstract
We present the design of the model-checking engine and internal data structures for the next generation of UPPAAL. The design is based on a pipeline architecture where each stage represents one independent operation in the verification algorithms. The architecture is based on essentially one shared data structure to reduce redundant computations in state exploration, which unifies the so-called passed and waiting lists of the traditional reachability algorithm. In the implementation, instead of using standard memory management functions from general-purpose operating systems, we have developed a special-purpose storage manager to best utilize sharing in physical storage. We present experimental results supporting these design decisions. It is demonstrated that the new design and implementation improves the efficiency of the current distributed version of UPPAAL by about 60% in time and 80% in space.
Originalsprog | Engelsk |
---|---|
Titel | 10th International SPIN Workshop 2003 |
Forlag | IEEE Computer Society Press |
Publikationsdato | 2003 |
Sider | 225-229 |
Status | Udgivet - 2003 |
Begivenhed | International SPIN Workshop 2003 - Portland, USA Varighed: 5 maj 2003 → 10 maj 2003 Konferencens nummer: 10th |
Konference
Konference | International SPIN Workshop 2003 |
---|---|
Nummer | 10th |
Land/Område | USA |
By | Portland |
Periode | 05/05/2003 → 10/05/2003 |
Navn | Lecture Notes in Computer Science |
---|---|
Nummer | 2648 |
Bibliografisk note
ISSN ; -Emneord
- Sharing
- Passed list
- Waiting list
- Verification
- Model checker