Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Location Consistency-A New Memory Model and Cache Consistency Protocol
IEEE Transactions on Computers
Unified Modeling Language User Guide, The (2nd Edition) (Addison-Wesley Object Technology Series)
Unified Modeling Language User Guide, The (2nd Edition) (Addison-Wesley Object Technology Series)
Implementation of CTL model checker update
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
UML data models from an ORM (object-role modeling) perspective: data modeling at conceptual level
WSEAS Transactions on Information Science and Applications
Management and object behavior of statecharts through statechart DNA
WSEAS Transactions on Information Science and Applications
ICAI'09 Proceedings of the 10th WSEAS international conference on Automation & information
SVtL: system verification through logic tool support for verifying sliced hierarchical statecharts
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
WSEAS Transactions on Information Science and Applications
Hi-index | 0.00 |
We present some of the main results of the research obtained by Benjamin De Leeuw in his PhD thesis: "Statechart DNA: Formal and Psychological Investigation into a State Machine Theory". The Simplified Statechart language was derived by excluding all redundant constructs of the UML (Unified Modeling Language) metamodel on statecharts. Simplified state machines and their memory model are the central abstraction used throughout this work. Any UML state machine or procedural program transforms to exactly one simplified state machine. The language grammar for simplified state machines was derived by composing a scripting language that further abstracts any useful state machine. Each grammar rule gets a visual counterpart within the state machine diagram. All useful state machines can be "grown" from these scripts. The parse tree of this grammar can be normalized such that any state machine has exactly one script, called statechart dna. In this paper we concentrate on an execution model for simplified statecharts, and graft on these semantics a useful technique for (temporal) value propagation. We determine the values of all variables in the reachable and useful states of the simplified statechart. Hence we can check for temporal properties on each of the executions of simplified statecharts, by modeling the possible values in a Kripke Model and applying model checking techniques on it.