Cycle de vie d'un logiciel

vignette| Le cycle de vie d'un logiciel (à traduire) Le cycle de vie d'un logiciel désigne l'ensemble des étapes de développement d'un logiciel, du début de son développement jusqu'à la fin de vie. Ces étapes incluent également les potentielles mises à jour du logiciel, une fois une version publiée (à des fins de perfectionnement ou de correction de bugs encore présents dans le logiciel) Histoire L'utilisation de la terminologie de test alpha / bêta a commencé chez IBM. Durant les années 1950 (et probablement plus tôt), des personnes impliquées chez IBM utilisaient des terminologies similaires : le test A pour la vérification d'un nouveau produit finalisé, effectuée juste avant l'annonce de la sortie ; le test B pour la vérification finale avant de confirmer la fabrication du produit ; le test C pour l'ultime test (après le B) avant la sortie du produit dans le marché. Un peu plus tard chez IBM, la terminologie de test alpha a commencé à être utilisée pour désigner le tes

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (13)

Chargement

Afficher plus

Publications associées

Chargement

Personnes associées

Chargement

Unités associées

Chargement

Concepts associés (40)

Concepts associés

Chargement

Cours associés (5)

Cours associés

Chargement

Séances de cours associées (6)

Séances de cours associées

Chargement

ME-516: Lifecycle performance of product systems

Provide the conceptual, technical and methodological understanding of measuring and evaluating the production/consumption decisions on the environmental, social and economic performance of products and services over their life cycle.

CS-305: Software engineering

This course teaches the basics of modern software development: designing software, working in a team, writing good code, shipping software, and evolving software. It emphasizes building software that meets high standards of quality, reliability, security, and manageability.

CS-412: Software security

This course focuses on software security fundamentals, secure coding guidelines and principles, and advanced software security concepts. Students learn to assess and understand threats, learn how to design and implement secure software systems, and get hands-on experience with security pitfalls.

Proposal of a Closed Loop Framework for the Improvement of Industrial Systems' Life Cycle Performances: Experiences from the LinkedDesign Project

Ana Milicic

The context where European manufacturers of industrial systems operate has dramatically changed over recent years: the pressure of emerging countries they have to face, policy makers' environmental laws and industrial companies' interests are pushing towards sustainable manufacturing and a holistic view of industrial systems. Designers and system engineers are the main actors involved, because they have high influence on product life cycle costs and environmental impacts. However they need tools to pursue a holistic view. The aim of this paper is to propose a closed loop framework to improve life cycle performances of industrial systems, focusing on the automotive sector. (C) 2015 The Authors. Published by Elsevier B.V.

Elsevier Science Bv2015

Chargement

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Lars Rohwedder

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. The input consists of a set of jobs, characterized by their processing times, release times, and weights and we want to compute a (possibly preemptive) schedule for them. The objective is to minimize the sum of the weighted flow times of the jobs, where the flow time of a job is the time between its release date and its completion time. It had been a long-standing open problem to find a polynomial time O(1)-approximation algorithm for this setting. In a recent break-through result, Batra, Garg, and Kumar (FOCS 2018) found such an algorithm if the input data are polynomially bounded integers, and Feige, Kulkarni, and Li (SODA 2019) presented a black-box reduction to this setting. The resulting approximation ratio is a (not explicitly stated) constant which is at least 10000. In this paper we improve this ratio to 2 + epsilon. The algorithm by Batra, Garg, and Kumar (FOCS 2018) reduces the problem to DEMAND MULTICUT ON TREES and solves the resulting instances via LP-rounding and a dynamic program. Instead, we first reduce the problem to a (different) geometric problem while losing only a factor 1 + epsilon, and then solve its resulting instances up to a factor of 2 + epsilon by a dynamic program. In particular, our reduction ensures certain structural properties, thanks to which we do not need LP-rounding methods. We believe that our result makes substantial progress towards finding a PTAS for weighted flow time on a single machine.

ASSOC COMPUTING MACHINERY2021

Chargement

Integrity and Metadata Protection in Data Retrieval

Kirill Nikitin

Secure retrieval of data requires integrity, confidentially, transparency, and metadata-privacy of the process. Existing protection mechanisms, however, provide only partially these properties: encryption schemes still expose cleartext metadata, protocols for private information retrieval neglect data integrity, and data-distribution architectures forego transparency. In this dissertation, by designing new cryptographic primitives and security architectures that provide a more comprehensive protection, we improve on the current security and privacy practices in data retrieval. First, we propose a new format for encrypted data; it protects both content and all encryption metadata, such as the application, the intended recipients, and the algorithms used. The format comes with a cryptographically-agile encoding scheme that facilitates efficient decryption of such ciphertexts without cleartext markers. Second, to address the lack of integrity in privacy-preserving data-retrieval protocols, we introduce the concept of single-server verifiable private information retrieval. In contrast to existing solutions where, in some deployment scenarios, a malicious server can violate client privacy by selectively tampering with the data, our approach ensures that an honest client either correctly obtains the data from the systemâs server or detects server misbehavior and aborts. Finally, we present a software-update framework that reinforces software-distribution processes. Building on the concepts of decentralization and verifiability, our framework eliminates single points of failure, enforces transparency, and ensures integrity and authenticity of software releases. By implementing and experimentally evaluating our primitives and framework, we demonstrate that better protection is practical and incurs only a modest additional cost.

EPFL2021

Chargement

Afficher plus

Microsoft

Microsoft Corporation ( ) est une multinationale informatique et micro-informatique américaine, fondée en 1975 par Bill Gates et Paul Allen. Microsoft fait partie des principales capitalisations bours

Microsoft Windows

(littéralement « Fenêtres » en anglais) est au départ une interface graphique unifiée produite par Microsoft, qui est devenue ensuite une gamme de systèmes d’exploitation à part entière, principalem

Open-source software

Open-source software (OSS) is computer software that is released under a license in which the copyright holder grants users the rights to use, study, change, and distribute the software and its sourc