English
Related papers

Related papers: Formalizing Traceability and Derivability in Softw…

200 papers

Software product line (SPL) engineers put a lot of effort to ensure that, through the setting of a large number of possible configuration options, products are acceptable and well-tailored to customers' needs. Unfortunately, options and…

Software Engineering · Computer Science 2019-09-17 Paul Temple , Mathieu Acher , Gilles Perrouin , Battista Biggio , Jean-marc Jezequel , Fabio Roli

Software measurement is an essential management tool to develop robust and maintainable software systems. Software metrics can be used to control the inherent complexities in software design. To guarantee that the components of the software…

Software Engineering · Computer Science 2022-01-26 Mamdouh Alenezi

The number of studies focusing on onboarding in software organizations has increased significantly during the last years. However, current literature overlooks onboarding in Software Product Lines (SPLs). SPLs have been proven effective in…

Software Engineering · Computer Science 2021-04-13 Raul Medeiros

Nowadays, the use of feature modeling technique, in software requirements specification, increased the variation support in Data Intensive Software Product Lines (DISPLs) requirements modeling. It is considered the easiest and the most…

Software Engineering · Computer Science 2019-04-30 Eman Muslah , Said Ghoul

In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is…

Computational Complexity · Computer Science 2015-03-03 Hubie Chen

This paper presents our approach to the quantitative modeling and analysis of highly (re)configurable systems, such as software product lines. Different combinations of the optional features of such a system give rise to combinatorially…

Software Engineering · Computer Science 2018-04-05 Maurice H. ter Beek , Axel Legay , Alberto Lluch Lafuente , Andrea Vandin

Parameter identifiability describes whether, for a given differential model, one can determine parameter values from model equations. Knowing global or local identifiability properties allows construction of better practical experiments to…

Mathematical Software · Computer Science 2021-07-02 Ilia Ilmer , Alexey Ovchinnikov , Gleb Pogudin

Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual notion of solution inappropriate. As a consequence, basic…

Logic in Computer Science · Computer Science 2007-05-25 Lucas Bordeaux , Marco Cadoli , Toni Mancini

Testability is the probability whether tests will detect a fault, given that a fault in the program exists. How efficiently the faults will be uncovered depends upon the testability of the software. Various researchers have proposed…

Software Engineering · Computer Science 2013-08-16 Sujata Khatri , R. S. Chhillar , V. B. Singh

Observability helps ensure the reliability and maintainability of cloud-native applications. As software architectures become increasingly distributed and subject to change, it becomes a greater challenge to diagnose system issues…

Software Engineering · Computer Science 2025-10-06 Carlos Albuquerque , Filipe F. Correia

Object oriented approach is one of the popular software development approach for managing complex systems with massive set of requirements. Unlike procedural approach, this approach captures the requirements as set of data rather than…

Software Engineering · Computer Science 2014-02-12 Poornima U. S. , Suma. V

In critical software engineering, structured assurance cases (ACs) are used to demonstrate how key properties (e.g., safety, security) are supported by evidence artifacts (e.g., test results, proofs). ACs can also be studied as formal…

Software Engineering · Computer Science 2024-07-16 Logan Murphy , Torin Viger , Alessio Di Sandro , Marsha Chechik

Property Specification Patterns (PSPs) have been proposed to solve recurring specification needs, to ease the formalization of requirements, and enable automated verification thereof. In this paper, we extend PSPs by considering Boolean as…

Logic in Computer Science · Computer Science 2017-12-13 Massimo Narizzano , Luca Pulina , Armando Tacchella , Simone Vuotto

Monitorability delineates what properties can be verified at runtime. Although many monitorability definitions exist, few are defined explicitly in terms of the guarantees provided by monitors, i.e., the computational entities carrying out…

Logic in Computer Science · Computer Science 2019-06-04 Luca Aceto , Antonis Achilleos , Adrian Francalanza , Anna Ingólfsdóttir , Karoliina Lehtinen

Software fault localization is one of the most expensive, tedious, and time-consuming activities in program debugging. This activity becomes even much more challenging in Software Product Line (SPL) systems due to the variability of…

Software Engineering · Computer Science 2021-09-22 Kien-Tuan Ngo , Thu-Trang Nguyen , Son Nguyen , Hieu Dinh Vo

The synthesis problem asks for the automatic construction of a system from its specification. In the traditional setting, the system is "constructed from scratch" rather than composed from reusable components. However, this is rare in…

Logic in Computer Science · Computer Science 2015-02-18 Krishnendu Chatterjee , Laurent Doyen , Moshe Y. Vardi

Model-driven engineering is the automatic production of software artefacts from abstract models of structure and functionality. By targeting a specific class of system, it is possible to automate aspects of the development process, using…

Software Engineering · Computer Science 2013-01-03 Chen-Wei Wang , Jim Davies

Software analytics has been the subject of considerable recent attention but is yet to receive significant industry traction. One of the key reasons is that software practitioners are reluctant to trust predictions produced by the analytics…

Software Engineering · Computer Science 2018-02-05 Hoa Khanh Dam , Truyen Tran , Aditya Ghose

The usual advantages put forward for including nullability declarations in the type systems of programming languages are that they improve program reliability or performance. But there is another, entirely different, reason for doing so. In…

Programming Languages · Computer Science 2011-08-25 William Harrison , Tim Walsh , Paul Biggar

In distributed applications, Brewer's CAP theorem tells us that when networks become partitioned (P), one must give up either consistency (C) or availability (A). Consistency is agreement on the values of shared variables; availability is…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-01-24 Edward A. Lee , Ravi Akella , Soroush Bateni , Shaokai Lin , Marten Lohstroh , Christian Menard
‹ Prev 1 3 4 5 6 7 10 Next ›