Sökning: "Karl Meinke"
Visar resultat 1 - 5 av 7 avhandlingar innehållade orden Karl Meinke.
1. Combinatorial Slice Theory
Sammanfattning : Slices are digraphs that can be composed together to form larger digraphs.In this thesis we introduce the foundations of a theory whose aim is to provide ways of defining and manipulating infinite families of combinatorial objects such as graphs, partial orders, logical equations etc. LÄS MER
2. Primitive Direcursion and Difunctorial Semantics of Typed Object Calculus
Sammanfattning : In the first part of this thesis, we contribute to the semantics of typed object calculus by giving (a) a category-theoretic denotational semantics using partial maps making use of an algebraic compactness assumption, (b) a notion of "wrappers'' by which algebraic datatypes can be represented as object types, and (c) proofs of computational soundness and adequacy of typed object calculus via Plotkin's FPC (with lazy operational semantics), thus making models of FPC suitable also for first-order typed object calculus (with recursive objects supporting method update, but not subtyping). It follows that a valid equation in the model induces operationally congruent terms in the language, so that program algebras can be studied. LÄS MER
3. Learning-based Testing for Automotive Embedded Systems : A requirements modeling and Fault injection study
Sammanfattning : This thesis concerns applications of learning-based testing (LBT) in the automotive domain. In this domain, LBT is an attractive testing solution, since it offers a highly automated technology to conduct safety critical requirements testing based on machine learning. LÄS MER
4. An ALARP Stop-Test Decision for the Worst-Case Timing Characteristics of Safety-Critical Systems
Sammanfattning : Safety-critical systems are those in which failure can lead to loss of people’s lives, or catastrophic damage to the environment. Timeliness is an important requirement in safety-critical systems, which relates to the notion of response time, i.e., the time a system takes to respond to stimuli from the environment. LÄS MER
5. Learning-based Software Testing using Symbolic Constraint Solving Methods
Sammanfattning : Software testing remains one of the most important but expensive approaches to ensure high-quality software today. In order to reduce the cost of testing, over the last several decades, various techniques such as formal verification and inductive learning have been used for test automation in previous research. LÄS MER