Sökning: "Algebraic Techniques"

Visar resultat 1 - 5 av 47 avhandlingar innehållade orden Algebraic Techniques.

1. 1. A Verification Framework for Component Based Modeling and Simulation : “Putting the pieces together”

   Författare :Imran Mahmood; Rassul Ayani; Gary Tan; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Modeling and Simulation; Component-based development; Composability; Semantic Composability; Dynamic-Semantic Composability; Verification; Correctness; Petri Nets Analysis; Algebraic Techniques; Colored Petri Nets; State-space Analysis; Communicating Sequential Processes; Model Checking.; SRA - ICT; SRA - Informations- och kommunikationsteknik;

   Sammanfattning : The discipline of component-based modeling and simulation offers promising gains including reduction in development cost, time, and system complexity. This paradigm is very profitable as it promotes the use and reuse of modular components and is auspicious for effective development of complex simulations. LÄS MER

3. 2. Algorithmic Verification Techniques for Mobile Code

   Författare :Irem Aktug; Dilian Gurov; Mads Dam; Ulfar Erlingsson; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Verification; Mobile Code Security; Reference Monitoring; Maximal Models; Compositional Verification; Theoretical computer science; Teoretisk datalogi;

   Sammanfattning : Modern computing platforms strive to support mobile code without putting system security at stake. These platforms can be viewed as open systems, as the mobile code adds new components to the running system. Establishing that such platforms function correctly can  be divided into two steps. LÄS MER

4. 3. Topics in computation, numerical methods and algebraic  geometry

   Författare :David Eklund; Sandra di Rocco; Wolfram Decker; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Algebra and geometry; Algebra och geometri;

   Sammanfattning : This thesis concerns computation and algebraic geometry. On the computational side we have focused on numerical homotopy methods. These procedures may be used to numerically solve systems of polynomial equations. The thesis contains four papers. LÄS MER

5. 4. Automated Derivation of Random Generators for Algebraic Data Types

   Författare :Claudio Agustin Mista; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Random Testing; Penetration Testing; Meta-programming; Haskell;

   Sammanfattning : Many testing techniques such as generational fuzzing or random property-based testing require the existence of some sort of random generation process for the values used as test inputs. Implementing such generators is usually a task left to end-users, who do their best to come up with somewhat sensible implementations after several iterations of trial and error. LÄS MER

7. 5. On Numerical Solution Methods for Block-Structured Discrete Systems

   Författare :Petia Boyanova; Maya Neytcheva; Oleg Iliev; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Preconditioning techniques; Finite element method; Two-by-two block matrices; Optimal order methods; AMLI method; Cahn-Hilliard equation; Multiphase flow; Inexact Newton method; Beräkningsvetenskap med inriktning mot numerisk analys; Scientific Computing with specialization in Numerical Analysis;

   Sammanfattning : The development, analysis, and implementation of efficient methods to solve algebraic systems of equations are main research directions in the field of numerical simulation and are the focus of this thesis. Due to their lesser demands for computer resources, iterative solution methods are the choice to make, when very large scale simulations have to be performed. LÄS MER