Sökning: "SMT"

Visar resultat 1 - 5 av 25 avhandlingar innehållade ordet SMT.

  1. 1. On scheduling using optimizing SMT-solvers

    Författare :Sabino Francesco Roselli; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; MILP; Vehicle Routing; Bin Sorting; SMT; Job Shop;

    Sammanfattning : Modern production systems are becoming more complex by the year and flexibility of production is one of the key factors to success. Companies want to be able to provide a customized product that fits exactly the customer requirements and, therefore production systems have to be able to produce a wide range of product variants. LÄS MER

  3. 2. From Machine Arithmetic to Approximations and back again : Improved SMT Methods for Numeric Data Types

    Författare :Aleksandar Zeljic; Philipp Ruemmer; Christoph M. Wintersteiger; Yi Wang; Armin Biere; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; SMT; Model construction; Approximations; floating-point arithmetic; machine arithmetic; bit-vectors; Computer Science; Datavetenskap;

    Sammanfattning : Safety-critical systems, especially those found in avionics and automotive industries, rely on machine arithmetic to perform their tasks: integer arithmetic, fixed-point arithmetic or floating-point arithmetic (FPA). Machine arithmetic exhibits subtle differences in behavior compared to the ideal mathematical arithmetic, due to fixed-size representation in memory. LÄS MER

  4. 3. Quantifiers and Theories : A Lazy Approach

    Författare :Peter Backeman; Philipp Rümmer; Jie-Hong Roland Jiang; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Automated Reasoning; Automated Theorem Proving; SMT; Unification; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

    Sammanfattning : In this thesis we study Automated Theorem Proving (ATP) as well as Satisfiability Modulo Theories (SMT) and present lazy strategies for improving reasoning within these areas. A lazy strategy works by simplifying a problem, and gradually refines the abstraction only when necessary. LÄS MER

  5. 4. Conflict-Free Routing of Mobile Robots

    Författare :Sabino Francesco Roselli; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; SMT; Job Shop; Bin Sorting; Vehicle Routing; MILP;

    Sammanfattning : The recent advances in perception have enabled the development of more autonomous mobile robots in the sense that they can operate in a more dynamic environment where obstacles surrounding the robot emerge, disappear, and move. The increased perception of Autonomous Mobile Robots (AMRs) allows them to plan detailed on-line trajectories in order to avoid previously unforeseen obstacles, making AMRs useful in dynamic environments where humans, traditional fork-lifts, and also other mobile robots operate. LÄS MER

  7. 5. On Solving String Constraints

    Författare :Phi Diep Bui; Mohamed Faouzi Atig; Parosh Abdulla; Matthew Hague; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; String constraint solving; SMT; Verification;

    Sammanfattning : Software systems are deeply involved in diverse human activities as everyone uses a variety of software systems on a daily basis. It is essential to guarantee that software systems all work correctly. Two popular methods for finding failures of software systems are testing and model checking. LÄS MER