• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 267
  • 111
  • 90
  • 36
  • 26
  • 24
  • 21
  • 14
  • 7
  • 6
  • 6
  • 3
  • 3
  • 3
  • 3
  • Tagged with
  • 733
  • 140
  • 138
  • 131
  • 101
  • 90
  • 87
  • 82
  • 81
  • 68
  • 66
  • 64
  • 63
  • 63
  • 62
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
401

Relational approach of graph grammars / Abordagem relacional de gramática de grafos

Cavalheiro, Simone André da Costa January 2010 (has links)
Gramática de grafos é uma linguagem formal bastante adequada para sistemas cujos estados possuem uma topologia complexa (que envolvem vários tipos de elementos e diferentes tipos de relações entre eles) e cujo comportamento é essencialmente orientado pelos dados, isto é, eventos são disparados por configurações particulares do estado. Vários sistemas reativos são exemplos desta classe de aplicações, como protocolos para sistemas distribuídos e móveis, simulação de sistemas biológicos, entre outros. A verificação de gramática de grafos através da técnica de verificação de modelos já é utilizada por diversas abordagens. Embora esta técnica constitua um método de análise bastante importante, ela tem como desvantagem a necessidade de construir o espaço de estados completo do sistema, o que pode levar ao problema da explosão de estados. Bastante progresso tem sido feito para lidar com esta dificuldade, e diversas técnicas têm aumentado o tamanho dos sistemas que podem ser verificados. Outras abordagens propõem aproximar o espaço de estados, mas neste caso não é possível a verificação de propriedades arbitrárias. Além da verificação de modelos, a prova de teoremas constitui outra técnica consolidada para verificação formal. Nesta técnica tanto o sistema quanto suas propriedades são expressas em alguma lógica matemática. O processo de prova consiste em encontrar uma prova a partir dos axiomas e lemas intermediários do sistema. Cada técnica tem argumentos pró e contra o seu uso, mas é possível dizer que a verificação de modelos e a prova de teoremas são complementares. A maioria das abordagens utilizam verificadores de modelos para analisar propriedades de computações, isto é, sobre a seqüência de passos de um sistema. Propriedades sobre estados alcançáveis só são verificadas de forma restrita. O objetivo deste trabalho é prover uma abordagem para a prova de propriedades de grafos alcançáveis de uma gramática de grafos através da técnica de prova de teoremas. Propõe-se uma tradução (da abordagem Single-Pushout) de gramática de grafos para uma abordagem lógica e relacional, a qual permite a aplicação de indução matemática para análise de sistemas com espaço de estados infinito. Definiu-se gramática de grafos utilizando estruturas relacionais e aplicações de regras com linguagens lógicas. Inicialmente considerou-se o caso de grafos (tipados) simples, e então se estendeu a abordagem para grafos com atributos e gramáticas com condições negativas de aplicação. Além disso, baseado nesta abordagem, foram estabelecidos padrões para a definição, codificação e reuso de especificações de propriedades. O sistema de padrões tem o objetivo de auxiliar e simplificar a tarefa de especificar requisitos de forma precisa. Finalmente, propõe-se implementar definições relacionais de gramática de grafos em estruturas de event-B, de forma que seja possível utilizar os provadores disponíveis para event-B para demonstrar propriedades de gramática de grafos. / Graph grammars are a formal language well-suited to applications in which states have a complex topology (involving not only many types of elements, but also different types of relations between them) and in which behaviour is essentially data-driven, that is, events are triggered basically by particular configurations of the state. Many reactive systems are examples of this class of applications, such as protocols for distributed and mobile systems, simulation of biological systems, and many others. The verification of graph grammar models through model-checking is currently supported by various approaches. Although model-checking is an important analysis method, it has as disadvantage the need to build the complete state space, which can lead to the state explosion problem. Much progress has been made to deal with this difficulty, and many techniques have increased the size of the systems that may be verified. Other approaches propose to over- and/or under-approximate the state-space, but in this case it is not possible to check arbitrary properties. Besides model checking, theorem proving is another wellestablished approach for verification. Theorem proving is a technique where both the system and its desired properties are expressed as formulas in some mathematical logic. A logical description defines the system, establishing a set of axioms and inference rules. The process of verification consists of finding a proof of the required property from the axioms or intermediary lemmas of the system. Each verification technique has arguments for and against its use, but we can say that model-checking and theorem proving are complementary. Most of the existing approaches use model checkers to analyse properties of computations, that is, properties over the sequences of steps a system may engage in. Properties about reachable states are handled, if at all possible, only in very restricted ways. In this work, our main aim is to provide a means to prove properties of reachable graphs of graph grammar models using the theorem proving technique. We propose an encoding of (the Single-Pushout approach of) graph grammar specifications into a relational and logical approach which allows the application of the mathematical induction technique to analyse systems with infinite state-spaces. We have defined graph grammars using relational structures and used logical languages to model rule applications. We first consider the case of simple (typed) graphs, and then we extend the approach to the non-trivial case of attributed-graphs and grammars with negative application conditions. Besides that, based on this relational encoding, we establish patterns for the presentation, codification and reuse of property specifications. The pattern has the goal of helping and simplifying the task of stating precise requirements to be verified. Finally, we propose to implement relational definitions of graph grammars in event-B structures, such that it is possible to use the event-B provers to demonstrate properties of a graph grammar.
402

Facilitate flight missions : An interview study about what could be made easier during planning and evaluation of flight missions.

Johansson, Hanna January 2018 (has links)
This thesis was in collaboration with Saab AB Aeronautics and aimed to investigate the information requirements at Saab AB, and then to write at least one software specification for something that could facilitate planning and/or evaluation of flight missions. Today, different support systems are used at Saab AB to help with planning and evaluation of flight missions. The most commonly used is the Mission Support System, but systems external to Saab AB such as applications for tablets are also used. Through semi-structured interviews and an analysis of the interviews based on the Grounded Theory approach several ideas for what could be done to facilitate planning and/or evaluation emerged. Two ideas were looked closer at; a statistical overview over missions implemented in the Mission Support System and an integration of an external program called SkyDemon and the Mission Support System. The statistical conclusions could help with getting an easier overview over one or several missions, which facilitates evaluation and how to forward information about the mission. To integrate SkyDemon with the MSS is something that tries to fulfill the wishes about accessibility and having everything at the same place, making the planning of missions run easier and faster.
403

Um processo ágil para especificação de requisitos em programas interativos com foco em roteiros de TV

Lula., Mariana Meirelles de Mello 21 November 2011 (has links)
Made available in DSpace on 2015-05-14T12:36:31Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 5528255 bytes, checksum: a0288caf46be4569d85b7a218a0a4dc7 (MD5) Previous issue date: 2011-11-21 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / The addition of software to TV programs through the implantation of the Brazilian Digital TV boosted the integration of these two major industries: software and TV. These two directions have different thoughts and ways of working, however, with the release of the Digital TV these two professional, communication and information technology need to work together. The software requirements specification follows some of the activities defined in accordance with the procedure being used. In digital television requirements elicitation, we find a different environment in which there are several professional profiles involved in this activity. This research present an agile process for requirements specification in interactive programs that integrate audiovisual content and interactive applications, in order to facilitate understanding and development of the interactive program by the team involved. The approach presented is based on a screenplay and interactive user stories. The interactive script will add the interactive application information to the communication team script and the storyboard will facilitate the understanding of the application. The process was used in a real project, where twelve interactive programs were developed. Finally, we discuss the results and perspectives. / A adição de software aos programas de TV através da implantação do Sistema Brasileiro de TV Digital impulsionou a integração dessas duas grandes indústrias: software e TV. Essas duas linhas de trabalho possuem diferentes pensamentos e formas de trabalhar, contudo, com a chegada da TV Digital estes dois perfis profissionais, comunicação e informática necessitam trabalhar juntos. A especificação de requisitos do software segue algumas atividades determinadas de acordo com o processo que está sendo utilizado. Na televisão digital a elicitação de requisitos encontra um ambiente diferente, no qual, temos perfis profissionais diversos que estão envolvidos nesta atividade. Neste trabalho apresentamos um processo ágil para a especificação de requisitos em programas interativos que integram conteúdo audiovisual e aplicações interativas, buscando facilitar o entendimento e desenvolvimento do programa interativo pela equipe envolvida. A abordagem apresentada é baseada em roteiro interativo e histórias de usuário. O roteiro interativo vai adicionar as informações da aplicação interativa ao roteiro da equipe de comunicação e, o storyboard irá facilitar o entendimento da aplicação. O processo foi utilizado em um projeto real, onde doze programas interativos foram desenvolvidos. Por fim, são discutidos os resultados obtidos e perspectivas.
404

Modelagem em SystemC-AMS de uma plataforma compat?vel com o sistema de coleta de dados brasileiro

Costa, Haulisson Jody Batista da 03 September 2009 (has links)
Made available in DSpace on 2014-12-17T14:55:39Z (GMT). No. of bitstreams: 1 HaulissonJBC.pdf: 4077011 bytes, checksum: fcba1ed8fcdc3b273e8994b6775327be (MD5) Previous issue date: 2009-09-03 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / This work presents simulation results of an identification platform compatible with the INPE Brazilian Data Collection System, modeled with SystemC-AMS. SystemC-AMS that is a library of C++ classes dedicated to the simulation of heterogeneous systems, offering a powerful resource to describe models in digital, analog and RF domains, as well as mechanical and optic. The designed model was divided in four parts. The first block takes into account the satellite s orbit, necessary to correctly model the propagation channel, including Doppler effect, attenuation and thermal noise. The identification block detects the satellite presence. It is composed by low noise amplifier, band pass filter, power detector and logic comparator. The controller block is responsible for enabling the RF transmitter when the presence of the satellite is detected. The controller was modeled as a Petri net, due to the asynchronous nature of the system. The fourth block is the RF transmitter unit, which performs the modulation of the information in BPSK ?60o. This block is composed by oscillator, mixer, adder and amplifier. The whole system was simulated simultaneously. The results are being used to specify system components and to elaborate testbenchs for design verification / Este trabalho apresenta resultados de simula??o de uma plataforma de identifica??o compat?vel com o Sistema de Coleta de Dados Brasileiro do INPE, modelado com SystemC-AMS. SystemC-AMS, que ? uma biblioteca de classes C++ dedicada ? simula??o de sistemas heterog?neos, oferece um recurso poderoso para descrever modelos nos dom?nios digital, anal?gico e de RF, bem como sistemas mec?nicos e ?ticos. O modelo projetado foi dividido em quatro partes. O primeiro bloco leva em considera??o a ?rbita do sat?lite, necess?rio para modelar corretamente o canal, inclui o efeito Doppler, a atenua??o e o ru?do t?rmico. O bloco identifica??o que detecta a presen?a de sat?lite ? composto por um amplificador de baixo ru?do, filtro passa-banda, detector de pot?ncia e um comparador l?gico. O bloco controlador ? respons?vel por habilitar o transmissor RF, quando a presen?a do sat?lite ? detectada. O controlador foi modelado por uma rede de Petri, devido ? natureza ass?ncrona do sistema. O quarto bloco ? o transmissor, que realiza a modula??o da informa??o em BPSK ?60o. Este bloco ? composto por oscilador, misturadores, somador e amplificador. Todo o sistema foi simulado simultaneamente. Os resultados ser?o utilizados para especificar componentes de sistema e para a elabora??o de banco de testes para a verifica??o do projeto
405

Uma metodologia de modelagem de sistemas computacionais baseada em gramáticas de grafos

Pretz, Eduardo January 2000 (has links)
Vários métodos de especificação procuram realizar a modelagem de sistemas sob três visões: uma visão funcional, que procura apresentar as informações que trafegam entre os diversos componentes do sistema, uma visão de dados, que apresenta as relações entre as estruturas de dados estáticas do sistema e a visão dinâmica, que mostra as transformações que o sistema pode sofrer ao longo do tempo. Alguns modelos procuram integrar mais de uma visão, mas, em geral, os modelos possuem sérias deficiências ao tentarem representar mais de um aspecto do sistema ao mesmo tempo, sendo necessário o apoio de outros métodos. Este trabalho apresenta um método de especificação de sistemas que procura integrar a modelagem de dados com a modelagem funcional e dinâmica utilizando-se, para isso, das Gramáticas de Grafos como método formal de especificação. Sendo um grafo formado por vértices, arestas e rótulos, pode-se facilmente criar uma camada de abstração em que o usuário (em geral responsável pela análise de sistemas) manipule um método de especificação com o qual já convive, agora com uma semântica formal definida. Espera-se, com a aplicação do método, gerar modelos passíveis de prova, não ambíguos e que promovam um incremento de qualidade no sistema gerado. / Several specification methods try to realize system modeling following three visions: the functional vision, which is based on representing the information exchange among the several components of the system; the data vision, which represents the relations among the static data structures of the system; and the dynamic vision, which presents the transformations the system may endure over the time. Some models exist that try to integrate more than one of these visions, but, in general, they suffer from deficiencies when trying to represent more than one aspect of the system at the same time, in which case the use of other methods is necessary. This work presents a novel method of systems specification that attempts to integrate data modeling with functional and dynamic modelings using, for this, Graph Grammars as its formal specification method. A graph, being made of nodes, edges and labels, is appropriate for creating, easily, an abstraction layer in which the user (usually responsible for the system analysis) manipulates a specification method which is known to him, but now with a well defined formal semantics. We hope, by applying this method, to generate provable, unambiguous models which promote an increase in the quality of the generated system.
406

Predicting and Estimating Execution Time of Manual Test Cases - A Case Study in Railway Domain

Ameerjan, Sharvathul Hasan January 2017 (has links)
Testing plays a vital role in the software development life cycle by verifying and validating the software's quality. Since software testing is considered as an expensive activity and due to thelimitations of budget and resources, it is necessary to know the execution time of the test cases for an efficient planning of test-related activities such as test scheduling, prioritizing test cases and monitoring the test progress. In this thesis, an approach is proposed to predict and estimate the execution time of manual test cases written in English natural language. The method uses test specifications and historical data that are available from previously executed test cases. Our approach works by obtaining timing information from each and every step of previously executed test cases. The collected data is used to estimate the execution time for non-executed test cases by mapping them using text from their test specifications. Using natural language processing, texts are extracted from the test specification document and mapped with the obtained timing information. After estimating the time from this mapping, a linear regression analysis is used to predict the execution time of non-executed test cases. A case study has been conducted in Bombardier Transportation (BT) where the proposed method is implemented and the results are validated. The obtained results show that the predicted execution time of studied test cases are close to their actual execution time.
407

Requirements Specifications Simplified and Adapted

Martinsson, Christoffer January 2008 (has links)
Systems development projects and their documents are more or less standardized and can mainly be applied on systems that are supposed to be built from scratch, or updated. In pace with the number of IT-systems are increasing worldwide there is no need for every organization to build their own IT-system. Nowadays it is also possible to purchase licenses which allow the purchaser to modify or add functions to the system. Along with those changes, there have been an increased amount of “rapid development methods” such as Agile and “Quick and Dirty” solutions, but these methods and perspectives are mainly focusing on entire systems development processes, as the old ones, but quicker. If a company purchases an off-the-shelf system with source code available, there is no real need to go through a proper systems development process. During interviews with a small company that has acquired a system as mentioned above, the researcher realized that only one single document is needed, the requirements specification. Today’s requirements specifications can be either well detailed or less, but a project still needs the details specified. Combining a known agile development process with IEEE’s standardized requirements specification, a new way to proceed with projects based on one single document (the requirements specification) has been made. This document also has a focus on simplicity for the inexperienced readers, but with the depth that every developer has got a use for.
408

Modelagem temporal de sistemas : uma abordagem fundamentada em redes de petri / Temporal modeling of information systems: a Petri net based approach

Antunes, Dante Carlos January 1997 (has links)
Neste trabalho e proposta a abordagem TempER-Tr, uma técnica de modelagem conceitual, fundamentada em rede de Petri, que integra a especificação das propriedades dinâmicas de um sistema a um modelo de dados temporal do tipo entidade relacionamento. Um modelo ou esquema conceitual descreve as propriedades identificadas de um sistema a ser desenvolvido. Estas propriedades podem ser classificadas em propriedades estáticas e propriedades dinâmicas As propriedades estáticas descrevem os estados que o sistema pode alcançar, enquanto que as propriedades dinâmicas descrevem as transições entre estes estados. A modelagem conceitual das propriedades estáticas é normalmente conhecida como modelagem de dados. A modelagem das propriedades dinâmicas é denominada de modelagem funcional ou comportamental. Mais especificamente, o modelo TempER-Tr é uma extensão de um trabalho anterior, conhecido como ER-Tr. No modelo ER-Tr, para descrever as propriedades estáticas de um sistema utiliza-se o modelo entidade-relacionamento convencional. No modelo TempER-Tr passa-se a adotar um modelo entidade-relacionamento temporal. Aliado a isto, uma nova linguagem de anotação, baseada em SQL, com mais poder de expressão é proposta. O modelo entidade-relacionamento convencional não possui dispositivos de modelagem capazes de especificar restrições que envolvam a associação dos objetos com o tempo, exigindo que isto se faca ao nível da modelagem das propriedades dinâmicas. Em um modelo entidade-relacionamento convencional, os conjuntos de entidades e relacionamentos apresentam apenas duas dimensões: a primeira refere-se as instâncias (linhas) e a segunda aos atributos (colunas). Em uma abordagem entidade relacionamento temporal, uma nova dimensão e acrescentada: o eixo temporal, possibilitando que as restrições temporais decorrentes da associação entre os objetos possam ser especificadas ao nível do modelo estático. Um requisito importante a ser preenchido por um modelo de dados temporal é permitir que em um mesmo diagrama seja possível associar objetos (entidades, relacionamentos ou atributos) temporalizados com objetos não temporalizados. lsto porque em sistemas de informação alguns dados precisam ser explicitamente referenciados ao tempo e outros não, ou porque não mudam com o tempo, ou porque é irrelevante ao usuário saber quando os fatos ocorreram. O modelo de dados temporal proposto neste trabalho, denominado TempER, pressupõe que todas as entidades, sejam elas temporalizadas ou não temporalizadas, apresentam uma "existência", ou seja, uma validade temporal. No caso das entidades temporalizadas esta existência é um subconjunto de pontos do eixo temporal. Em virtude disto são chamadas de entidades transitórias. Em relação as entidades não temporalizadas, e assumido que "existem sempre", ou seja, a sua validade temporal é constante, implícita e igual a todo o eixo temporal. Por isto são denominadas entidades perenes. Tanto as entidades transitórias quanto as entidades perenes, são focalizadas pelo modelo TempER através de duas perspectivas: uma intemporal e outra temporal. Através da perspectiva intemporal as entidades apresentam duas dimensões, semelhança do que ocorre em um modelo entidade-relacionamento convencional. Através da perspectiva temporal as entidades apresentam três dimensões, as duas convencionais e mais o tempo. Enquanto que o modelo de dados temporal descreve as propriedades estáticas de um sistema, o modelo comportamental, a outra face da abordagem TempER-Tr, focaliza as transações executadas no interior do sistema, em resposta a eventos que ocorrem no ambiente externo. Estas transações, quando efetivadas, provocam mudanças de estados no sistema. Entretanto, para estarem habilitadas a ocorrer, é necessário que um determinado conjunto de restrições dinâmicas sejam atendidas, o que se configura em um comportamento análogo ao de uma rede de Petri. O modelo TempER-Tr é completamente mapeável, inclusive o modelo de dados temporal, para a rede CEM, um tipo de rede de Petri de alto nível. Isto permite que a sua semântica seja formalmente especificada e possibilita o aproveitamento das características das redes de Petri. / This dissertation presents TempER-Tr approach. TempER-Tr is a conceptual modeling technique based on Petri nets that integrates the specification of the dynamic properties of system to a temporal entity-relationship data model. A model or conceptual schema describes the identified properties of a system. These properties can be classified into static and dynamic properties. The static properties describe the states that the system can reach, while the dynamic properties describe the transitions between the states. The conceptual modeling of the static properties is usually known as data modeling, while behavioral or functional modeling deals with dynamic properties. The TempER-Tr model is an extension of a model known as ER-Tr. In the ER-Tr model, the conventional entity-relationship model is used to describe the static properties of a system. In the TempER-Tr model, it is adopted a kind of temporal entityrelationship model. In addition, a new notation language is proposed, based on SQL, with more expression power. The conventional entity-relationship model doesn't provide tools to specify constraints that involve the association of objects with the time dimension, requiring that this have to be done at the dynamic properties modeling level. At the conventional entityrelationship model the entities and relationships sets present just two dimensions: the first one is related to the instance (lines) and the second to the attributes (columns). At a temporal entity-relationship approach, a new dimension is added: the time line. This way, the temporal constraints can be specified at the level of the static diagrams. An important requirement to be supplied by any temporal data model is the possibility to relate, into the same diagram, time-varying objects with time-invarying objects. This is due to the fact that in information systems some data need to be explicitly related to time and others don't, either because they don't change with time, or because users don't need to know when the facts occurred. • The temporal data model proposed in this work, nominated TempER, presupposes that all entities, being them time-varying or time-invarying, have an "existence", or a temporal validity. At the time-varying entities, named transitory entities, this existence is a subset of points from the time line. In time-invarying entities, named perennial entities, it is assumed that they "always exist", i.e., their temporal validity is constant, implicit, and equal to all points of the time line. Transitory entities, as much as perennial entities, are focused by the TempER model through two perspectives: a temporal perspective and a non-temporal perspective. Through the non-temporal perspective the entities present two dimensions - lines and columns - similar to a conventional entity-relationship model. Through the temporal perspective the entities present three dimensions: the two conventional dimensions and, in addition, the time dimension. While the temporal data model describes the static properties of a system, the behavioral model in the TempER-Tr approach focus the transactions that are executed by the system, in response to the events that occur at the external environment. A certain set of dynamic constraints must be attended so that transactions are enable to occur. This configures a behavior similar to a Petri net. The TempER-Tr model is completely mappeable, inclusive the temporal data model, to the CEM net, a kind of high level Petri net. This way, the semantic of TempER-Tr model is formally specified. In addition, the utilization of the characteristics of Petri nets is possible.
409

Comparative Selection of Requirements Validation Techniques Based on Industrial Survey / Jämförande Val av kravvalidering baserad på Industrial Survey

Sulehri, Latif January 2010 (has links)
In software engineering the requirements validation has very core importance. The requirements validation very helpful to judge that software requirements specification (SRS) is complete and free of bugs. The requirements validation is a assurance that the software requirements document is free of unwanted requirements and completely consistent. In order to remove inconsistency, detect defects and make the software requirements document fully functional the requirements validation is key factor. All possible requirements validation techniques available in academia such requirements reviews , requirements prototyping, requirements testing and viewpoint-oriented requirements validation are explained properly in this thesis report. In a very readable and understandable way the thesis presents all pros and cons of these requirements validation techniques practiced in different software companies in Sweden and available in academia. This report explains all possible advantages and issues related with these RVTs. In order to judge the best performance of these RVTs and to make their comparison I used a proper channel. I have designed a very effective survey questionnaire with the help of my colleges and literature review. To make creative comparison I conduct interviews and send survey questionnaire to different people working in requirements engineering departments in different software industries in Sweden. Finally the satisfaction levels of different software industries with these requirements validation techniques presents in this thesis report. These variables such as defect detection, time and cost are used to measure the satisfaction levels. / I Software Engineering kraven validering har en mycket central betydelse. Den kravvalidering very helpful att bedöma att Kravspecifikation (SRS) är klar och felfria. Kraven validering är en garanti för att programvaran kravdokument är fri från oönskade krav och helt konsekvent. För att undanröja inkonsekvens, upptäcka brister och göra programvaran kravdokument fullt funktionella kraven validering är viktig faktor. Alla möjliga kravvalidering tekniker inom den akademiska sådana krav recensioner, krav prototyper, provning och synpunkt-orienterade kravvalidering förklaras ordentligt i denna avhandling rapport. I ett mycket lättläst och begripligt sätt avhandling presenterar alla fördelar och nackdelar med dessa krav validera metoder praktiseras i olika mjukvaruföretag i Sverige och finns i den akademiska världen. Denna rapport förklarar alla möjliga fördelar och frågor kring dessa RVTs. För att bedöma de bästa resultaten i dessa RVTs och göra en jämförelse av dem använde jag en riktig kanal. Jag har skapat en mycket effektiv frågeformulär med hjälp av min högskolor och litteraturgenomgång. Skapa kreativa jämförelse jag intervjua och skicka frågeformuläret till olika personer som arbetar inom tekniska kraven för dessa avdelningar i olika programvaruföretag i Sverige. Slutligen tillfredsställande nivåer av olika programvaruföretag med dessa krav validering teknik presenteras i denna avhandling rapport. Dessa variabler såsom Upptäcka, tid och kostnader används för att mäta tillfredsställande nivåer. / Author: Latif Hussain Sulehri E-mail: latifsulehry@hotmail.com Phone: +46 704 917 140
410

Effektivisering av mjukvaruinstallationer : Genom automatiserad mjukvarudistribution / Making the work of installations of software more efficient : Through automated software distribution

Andersson, Daniel, Edman, Glen January 2014 (has links)
Software deployment, eller mjukvarudistribution översatt till svenska kan ses som processen där alla aktiviteter ingår för att göra en mjukvara tillgänglig för användare utan en manuell installation på användarens dator eller annan maskin. Det finns ett flertal software deployment-verktyg, som hanterar automatiska installationer, tillgängliga för företag på marknaden idag.  Avdelningen HVDC på ABB i Ludvika har behov att börja använda ett verktyg för automatiserade installationer av mjukvaror då installationer idag utförs manuellt och är tidsödande. Som Microsoftpartners vill ABB se hur Microsofts verktyg för mjukvarudistribution skulle kunna hjälpa för detta behov.  Vår studie syftade till att undersöka hur arbetet med installationer av mjukvara ser ut idag, samt hitta förbättringsmöjligheter för installationer som inte kan automatiseras i nuläget. I studien ingick även att ta fram ett generellt ramverk för hur verksamheter kan gå tillväga när de vill börja använda sig utav software deployment-verktyg. I ramverket ingår en utformad kravspecifikation som ska utvärderas mot Microsofts verktyg.  För att skapa en uppfattning om hur arbetet i verksamheten ser ut idag har vi utfört enkätundersökning och intervjuer med personal på HVDC. För att utveckla ett ramverk har vi använt oss av insamlade data från de intervjuer, enkätundersökning och gruppintervju som utförts, detta för att identifiera krav och önskemål från personalen hos ett software deployment-verktyg. Litteraturstudier utfördes för att skapa en teoretisk referensram att utgå ifrån vid utvecklande av ramverket och kravspecifikationen.  Studien har resulterat i en beskrivning av software deployment, förbättringsmöjligheter i arbetet med installationer av mjukvara samt ett generellt ramverk som beskriver hur verksamheter kan gå tillväga när de ska börja använda ett software deployment-verktyg. Ramverket innehåller också en kravspecifikation som använts för att utvärdera Microsofts verktyg för mjukvarudistribution. I vår studie har vi inte sett att någon tidigare har tagit fram ett generellt ramverk och kravspecifikation som verksamheter kan använda sig av som underlag när de ska börja använda ett software deployment-verktyg. Vårt resultat av studien kan täcka upp detta kunskapsgap. / Software deployment can be seen as the process where all activities are included to make a software available to users without a manual installation on the user’s computer or other machine. There are several software deployment tools that manage automated installations available to enterprises on the market today. The department HVDC at ABB in Ludvika has needs of starting to use a tool for automated installations of software which currently is installed manually and is time consuming. As Microsoft partners ABB wants to see how Microsoft’s tool for software deployment could help for this need.  Our study aimed to investigate how the department´s work with installations of software looks like today and to find opportunities for improvement for installations that can’t be automated at this time. The study also includes to develop a general framework for how businesses can proceed when they want to start using a software deployment tool. The framework also includes a designed requirement specification that will be evaluated against Microsoft´s tool. To create an idea of how the work in the business looks like today, we have performed surveys and interviews with staff in HVDC. In order to develop a framework, we have used the data collected from the interviews, questionnaires and group interviews conducted to identify requirements and wishes from the staff of a software deployment tool. Literature studies were also conducted to create a theoretical framework to use when developing the framework and the requirement specification.  Our studies have resulted in a description of software deployment, opportunities for improvement in the work of software installations and a general framework that describes how businesses can proceed when they are about to start using a software deployment tool. The framework also provides a set of requirements that have used to evaluate Microsoft's tool for software distribution. In our study we have not seen that anyone before have developed a general framework and requirements specification that businesses can use as a basis when to start using a software deployment tool. Our results of the study can cover up this knowledge gap.

Page generated in 0.3816 seconds