Efficient Algorithms for Verification of UML Statechart Models

@article{Prashanth2009EfficientAF,
  title={Efficient Algorithms for Verification of UML Statechart Models},
  author={Chikmagalur Manjappa Prashanth and K. Chandrashekar Shet},
  journal={JSW},
  year={2009},
  volume={4},
  pages={175-182}
}
In this article, we present algorithms devised for the automatic verification of UML(Unified Modeling Language) statechart models. The basic algorithm checks the safety property violation during the construction (on-the-fly) of the state space graph and if any property violation is found, it generates a counter example. The second algorithm builds the state space considering only those events, which could lead to the negative behavior of the system. In other words, a set of relevant events is… CONTINUE READING

Figures, Tables, Results, and Topics from this paper.

Key Quantitative Results

  • The case study results show that event based verification algorithm yields 59% reduction in the state space for the GRC example.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Model Checking Large Software Specifications

  • IEEE Trans. Software Eng.
  • 1998
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Dr

C. M. Prashanth
  • K.C. Shet, Janees Elamkulam, “Verification Framework for Detecting Safety Violations in UML statecharts”, Second Asia International conference on Modeling and Simulation
  • 2008
VIEW 1 EXCERPT

UML Automatic Verification Tool (TABU)

M. Beato et. al
  • 12th ACM SIGSOFT symposium on the foundations of software engineering,
  • 2004
VIEW 2 EXCERPTS

Model checking UML Statechart diagrams using JACK

  • Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering
  • 1999
VIEW 1 EXCERPT

v-Promela: a visual, object-oriented language for SPIN

  • Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)
  • 1999
VIEW 2 EXCERPTS

Similar Papers