Visualization and interpretation of analysis results within the context of formalized UML diagrams
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
VIP: A Visual Interface for Promela
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
VIP: A Visual Editor and Compiler for v-Promela
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
Proceedings of the 16th IEEE international conference on Automated software engineering
Enhancing Partial-Order Reduction via Process Clustering
Proceedings of the 16th IEEE international conference on Automated software engineering
Cluster-Based Partial-Order Reduction
Automated Software Engineering
Implementing Hierarchical Features in a Graphically Based Formal Modelling Language
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Verifying Object-Based Graph Grammars
Electronic Notes in Theoretical Computer Science (ENTCS)
Timed sequence diagrams and tool-based analysis: a case study
UML'99 Proceedings of the 2nd international conference on The unified modeling language: beyond the standard
Correct transformation: From object-based graph grammars to PROMELA
Science of Computer Programming
Hi-index | 0.00 |
We describe the design of VIP, a graphical front-end to the model checker SPIN. VIP supports a visual formalism, called v-Promela that connects the model checker to modern hierarchical notations for the specification of object-oriented, reactive systems. The formalism is comparable to formalisms such as UML-RT, ROOM, and Statecharts, but is presented here in a framework that allows us to combine the benefits of a visual, hierarchical specification method with the power of LTL model checking provided by SPIN. Like comparable formalisms, VIP can describe hierarchies of behaviour and of system structure. The formalism is designed to be transparent to the SPIN model checker itself, by allowing all central constructs to be translated mechanically into basic PROMELA, as already supported by the existing model checker.