Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compilation of the ELECTRE reactive language into finite transition systems
Theoretical Computer Science
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Effective Recognizability and Model Checking of Reactive Fiffo Automata
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
The High Road to Formal Validation
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
| Hi-index | 0.00 |
This paper tackles the problem of model-checking SDL programs that use the save operator. Previous work on model-checking SDL programs with SPIN consisted in translating SDL into IF (using sdl2if) and finally IF to Promela (if2pml). However, the save operator of SDL is not handled by the (final) translator if2pml. We propose an extension of the if2pml tool that translates IF into Promela programs with save operators. We also add an abstraction method on buffer messages to if2pml allowing the user to gather some buffer messages into one abstract value. We use our extended version of if2pml to validate an Unmanned Under-water Vehicle (UUV) subsystem specified with SDL.