Sökning: "constraint solving"

Visar resultat 1 - 5 av 71 avhandlingar innehållade orden constraint solving.

  1. 1. Parallelism in Constraint Programming

    Författare :Carl Christian Rolf; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Parallelism; Constraint Programming; Parallel Consistency; Parallel Search; Distributed Constraint Programming;

    Sammanfattning : Writing efficient parallel programs is the biggest challenge of the software industry for the foreseeable future. We are currently in a time when parallel computers are the norm, not the exception. Soon, parallel processors will be standard even in cell phones. LÄS MER

  3. 2. Analysis, synthesis and application of automaton-based constraint descriptions

    Författare :María Andreína Francisco Rodríguez; Justin Pearson; Pierre Flener; Christopher Jefferson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; constraint predicates; global constraints; automata; automaton-described constraint predicates; automaton-induced constraint decompositions; implied constraints; time-series constraints; transducers; automaton invariants; Computer Science; Datavetenskap;

    Sammanfattning : Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjunction of constraints on variables ranging over given initial domains, and optionally an objective function on the variables. Such a model is given to a general-purpose solver performing systematic search to find constraint-satisfying domain values for the variables, giving an optimal value to the objective function. LÄS MER

  4. 3. 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

  5. 4. Learning-based Software Testing using Symbolic Constraint Solving Methods

    Författare :Fei Niu; Karl Meinke; Reiner Hähnle; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Testing; Machine learning; Symbolic constraint solving; Model checking;

    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

  7. 5. Applications of SAT solving

    Författare :Niklas Sörensson; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In the area of formal verification it is well known that there can be no single logic that suits all needs. This insight motivates the diversity of this dissertation: it contains contributions to SAT solving, First Order theorem proving and Model Finding, and Symbolic Model Checking. LÄS MER