Sökning: "abstraction"

Visar resultat 1 - 5 av 285 avhandlingar innehållade ordet abstraction.

  1. 1. Other Things Besides Number Abstraction, Constraint Propagation, and String Variable Types

    Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis

    Författare :Joseph Scott; Uppsala universitet.; Uppsala universitet.; [2016]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; string constraint problems; Galois connections; abstraction; constraint propagation; computer-aided verification applications; Datavetenskap; Computer Science;

    Sammanfattning : Constraint programming (CP) is a technology in which a combinatorial problem is modeled declaratively as a conjunction of constraints, each of which captures some of the combinatorial substructure of the problem. Constraints are more than a modeling convenience: every constraint is partially implemented by an inference algorithm, called a propagator, that rules out some but not necessarily all infeasible candidate values of one or more unknowns in the scope of the constraint. LÄS MER

  2. 2. Semantics, Decision Procedures, and Abstraction Refinement for Symbolic Trajectory Evaluation

    Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis

    Författare :Jan-Willem Roorda; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Semantics; Abstraction; Satisfiability Solver; Symbolic Trajectory Evaluation; Formal Verification.; Model Checking;

    Sammanfattning : The rapid growth in hardware complexity has led to a need for formal verification of hardware designs to prevent bugs from entering the final silicon. Model-checking is a verification method in which a model of a system is checked against a property, describing the desired behaviour of the system over time. LÄS MER

  3. 3. Dynamic Abstraction for Interleaved Task Planning and Execution

    Detta är en avhandling från Institutionen för datavetenskap

    Författare :Per Nyblom; Linköpings universitet.; Linköpings universitet.; [2008]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Artificial Intelligence; Dynamic Abstraction; Task Planning; Automatic Model Construction; Meta-modelling; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap;

    Sammanfattning : It is often beneficial for an autonomous agent that operates in a complex environment to make use of different types of mathematical models to keep track of unobservable parts of the world or to perform prediction, planning and other types of reasoning. Since a model is always a simplification of something else, there always exists a tradeoff between the model’s accuracy and feasibility when it is used within a certain application due to the limited available computational resources. LÄS MER

  4. 4. Abstraction and authority in textbooks The textual paths towards specialized language

    Detta är en avhandling från Uppsala : Universitetsbiblioteket

    Författare :Agnes Edling; Uppsala universitet.; [2006]
    Nyckelord :HUMANIORA; HUMANITIES; textbook research; text linguistics; content area reading; reader text relationship; literacy education; systemic linguistics; applied linguistics; HUMANITIES and RELIGION Languages and linguistics Linguistic subjects Linguistics; HUMANIORA och RELIGIONSVETENSKAP Språkvetenskap Lingvistikämnen Lingvistik;

    Sammanfattning : During a few hours of a school day, a student might read textbook texts which are highly diversified in terms of abstraction. Abstraction is a central feature of specialized language and the transition from everyday language to specialized language is one of the most important things formal education can offer students. LÄS MER

  5. 5. Few is Just Enough! Small Model Theorem for Parameterized Verification and Shape Analysis

    Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis

    Författare :Frédéric Haziza; Uppsala universitet.; Uppsala universitet.; [2015]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; program verification; model checking; parameterized systems; infinite-state systems; reachability; approximation; safety; tree systems; shape analysis; small model properties; view abstraction; monotonic abstraction; Computer Science; Datavetenskap;

    Sammanfattning : This doctoral thesis considers the automatic verification of parameterized systems, i.e. systems with an arbitrary number of communicating components, such as mutual exclusion protocols, cache coherence protocols or heap manipulating programs. The components may be organized in various topologies such as words, multisets, rings, or trees. LÄS MER