Stefan Kugele

Learn More
Model-driven development has become common practice in design of safety-critical real-time systems. High-level modeling constructs help to reduce the overall system complexity apparent to developers. This abstraction caters for fewer implementation errors in the resulting systems. In order to retain correctness of the model down to the software executed on(More)
In this paper we introduce the component language COLA for the design and development of embedded systems. We present the formal syntax and semantics of COLA which is based upon synchronous dataflow. Utilizing the abstraction provided by this paradigm, the designer is freed from implementation details and is able to focus on the core-functionality to be(More)
—Model-driven development (MDD) is an emerging paradigm and has become state-of-the-art for embedded systems software design. In the overall design process, several steps have to be taken in order to get from a high-level system design to the deployed binaries on the target platform: starting from model design, software partitioning and code generation(More)
In this paper we present an approach of generating SystemC executable models from software designs captured in a new component-based modeling language, COLA, which follows the paradigm of synchronous dataflow. COLA has rigorous semantics and specification mechanisms. Due to its well-founded semantics, it is possible to establish an integrated development(More)
This paper describes an approach to model-based testing where a test suite is generated from a model and automatically con-cretized to drive an implementation. Motivated by an industrial project involving DO-178B compliant avionics software, where the models are UML activity diagrams and the implementation is ANSI C, we developed a seamless testing(More)
Erklärung Ich versichere, dass ich diese Diplomarbeit selbstständig verfasst und nur die angegebe-nen Quellen und Hilfsmittel verwendet habe. Abstract In this thesis we focus on Boolean Satisfiability (Sat), a classical search problem in computer science. Stephen A. Cook and Leonid Levin showed, that this problem is NP-complete, i.e., great many differently(More)