Program synthesis from hierarchical state diagrams has for long been discussed in various communities. My aim is to provide an efficient, lightweight code generation scheme suitable for resource constrained microcontrollers. I describe an initial implementation of SCOPE—a hierarchical code generator for a variant of the statechart language. I shall discuss several techniques implemented in the tool, namely imposing and exploiting a regular hierarchy structure, labeling schemes for fast ancestor queries, improvements in exiting states, compile-time scope resolution for transitions, and various details of compact runtime representation. The resulting algorithm avoids the exponential code growth exhibited by tools based on flattening of hierar...
Emerging design problems are prompting the use of code motion and speculation in high–level synthesi...
We show a subexponential but superpolynomial lower bound for flattening problem for statecharts. The...
AbstractWe show a subexponential but superpolynomial lower bound for flattening problem for statecha...
Abstract. Despite the success of statecharts, surprisingly little research eort has been devoted to ...
Since visual modelling languages are getting more and more popular, the automatic generation of the ...
Abstract: This paper describes a strategy for synthesizing efficient code from UML statecharts based...
Hiermit erkläre ich an Eides Statt, dass ich die vorliegende Arbeit selbstständig verfasst und keine...
We formalize in Isabelle/HOL the abtract syntax and a synchronous step semantics for the specificati...
Associated research group: Critical Systems Research GroupFormal specification languages are often c...
We formalize in Isabelle/HOL the abtract syntax and a synchronous step semantics for the specificati...
The Unified Modeling Language (UML) statechart diagram is a powerful tool for specifying the dynamic...
Traditional description techniques like Finite State Machines (FSMs) are inadequate for current day ...
Abstract. Hierarchical state machines are nite state machines whose states themselves can be other m...
We present some of the main results of the research obtained by Benjamin De Leeuw in his PhD thesis:...
We present a polynomial upper bound for flattening of UML statecharts. An e#cient flattening techniq...
Emerging design problems are prompting the use of code motion and speculation in high–level synthesi...
We show a subexponential but superpolynomial lower bound for flattening problem for statecharts. The...
AbstractWe show a subexponential but superpolynomial lower bound for flattening problem for statecha...
Abstract. Despite the success of statecharts, surprisingly little research eort has been devoted to ...
Since visual modelling languages are getting more and more popular, the automatic generation of the ...
Abstract: This paper describes a strategy for synthesizing efficient code from UML statecharts based...
Hiermit erkläre ich an Eides Statt, dass ich die vorliegende Arbeit selbstständig verfasst und keine...
We formalize in Isabelle/HOL the abtract syntax and a synchronous step semantics for the specificati...
Associated research group: Critical Systems Research GroupFormal specification languages are often c...
We formalize in Isabelle/HOL the abtract syntax and a synchronous step semantics for the specificati...
The Unified Modeling Language (UML) statechart diagram is a powerful tool for specifying the dynamic...
Traditional description techniques like Finite State Machines (FSMs) are inadequate for current day ...
Abstract. Hierarchical state machines are nite state machines whose states themselves can be other m...
We present some of the main results of the research obtained by Benjamin De Leeuw in his PhD thesis:...
We present a polynomial upper bound for flattening of UML statecharts. An e#cient flattening techniq...
Emerging design problems are prompting the use of code motion and speculation in high–level synthesi...
We show a subexponential but superpolynomial lower bound for flattening problem for statecharts. The...
AbstractWe show a subexponential but superpolynomial lower bound for flattening problem for statecha...