Search for dissertations about: "computer-aided verification applications"

Found 4 swedish dissertations containing the words computer-aided verification applications.

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

    Author : Joseph Scott; Pierre Flener; Parosh Abdulla; Justin Pearson; Michel Rueher; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; constraint programming; string constraint problems; Galois connections; abstraction; constraint propagation; computer-aided verification applications; Datavetenskap; Computer Science;

    Abstract : 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. READ MORE

  4. 2. Computer integrated design systems in concurrent engineering

    Author : Peter Jeppsson; Luleå tekniska universitet; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Datorstödd maskinkonstruktion; Computer Aided Design;

    Abstract : This thesis comprises six papers dealing with implementations and techniques for linking computer-aided applications for design and analysis into a concurrent engineering environment. Each paper deals with a part of the environment - together they constitute an integrated design system for concurrent engineering. READ MORE

  5. 3. Dominator-based Algorithms in Logic Synthesis and Verification

    Author : René Krenz-Bååth; Johnny Öberg; Joao Marques-Silva; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; graph dominators; formal verification; logic synthesis; equivalence checking; decomposition; Electrical engineering; Elektroteknik;

    Abstract : Today's EDA (Electronic Design Automation) industry faces enormous challenges. Their primary cause is the tremendous increase of the complexity of modern digital designs. Graph algorithms are widely applied to solve various EDA problems. READ MORE

  6. 4. Combinatorial Optimization for Infinite Games on Graphs

    Author : Henrik Björklund; Sergei Vorobyov; Erich Grädel; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; infinite games; combinatorial optimization; randomized algorithms; model checking; strategy evaluation functions; linear programming; iterative improvement; local search; Computer science; Datavetenskap;

    Abstract : Games on graphs have become an indispensable tool in modern computer science. They provide powerful and expressive models for numerous phenomena and are extensively used in computer- aided verification, automata theory, logic, complexity theory, computational biology, etc. READ MORE