样式: 排序: IF: - GO 导出 标记为已读
-
A Method to Identify Overfitting Program Repair Patches Based on Expression Tree Sci. Comput. Program. (IF 1.3) Pub Date : 2024-03-05 Yukun Dong, Xiaotong Cheng, Yufei Yang, Lulu Zhang, Shuqi Wang, Lingjie Kong
The primary aim of Automatic Program Repair (APR) is to automatically repair defective programs, with the intention of reducing the amount of effort required by developers. However, APR techniques may produce overfitting patches that do not truly repair the program, allowing the program to pass all test cases. This paper provides a comprehensive review of the overfitting problem and adds to the existing
-
Diagnosis of package installation incompatibility via knowledge base Sci. Comput. Program. (IF 1.3) Pub Date : 2024-03-01 Yulu Cao, Zhifei Chen, Xiaowei Zhang, Yanhui Li, Lin Chen, Linzhang Wang
Python package installation is far from trivial. Users encounter a variety of errors when installing Python libraries, including dependency conflicts and incompatibilities. Existing solutions focus on parsing third-party dependencies but ignore the impact of local settings and user requirements. In this paper, we propose a novel approach, HELP, to help Python users tackle installation errors. We first
-
Sibilla: A tool for reasoning about collective systems Sci. Comput. Program. (IF 1.3) Pub Date : 2024-02-28 Nicola Del Giudice, Lorenzo Matteucci, Michela Quadrini, Aniqa Rehman, Michele Loreti
Formal approaches and tools have been defined, implemented and successfully applied to support the design and development of Collective Adaptive Systems. These tools are highly specialised in their fields, and their integration requires an effort.
-
Narrowing and heuristic search for symbolic reachability analysis of concurrent object-oriented systems Sci. Comput. Program. (IF 1.3) Pub Date : 2024-02-23 Byeongjee Kang, Kyungmin Bae
A concurrent system specified as a rewrite theory can be analyzed symbolically using narrowing-based reachability analysis. Narrowing-based approaches have been applied to formally analyze cryptographic protocols and parameterized protocols. However, existing narrowing-based analysis methods, based on a breadth-first-search strategy, cannot deal with generic distributed systems with objects and messages
-
Exploratory Study on the Syntactic and Semantic Consistency of Terms in Project Management Glossaries to provide Recommendations for a Project Management Ontology Sci. Comput. Program. (IF 1.3) Pub Date : 2024-02-20 Pablo Becker, María Fernanda Papa, Luis Olsina
-
Neighborhood contrastive learning-based graph neural network for bug triaging Sci. Comput. Program. (IF 1.3) Pub Date : 2024-02-20 Haozhen Dong, Hongmin Ren, Jialiang Shi, Yichen Xie, Xudong Hu
Researchers have been developing automatic bug triaging techniques by leveraging bug information sourced from bug tracking systems. Recent studies have modeled the bug-developer relationship as a graph, introducing graph neural networks for bug triaging. Despite achieving positive outcomes, these methods overlook issues related to data sparsity and fail to fully exploit implicit relationships within
-
Introduction to the TASE 2022 Special issue Sci. Comput. Program. (IF 1.3) Pub Date : 2024-02-10 Yamine Ait-Ameur, Florin Craciun
-
Preface for the Special Issue on Tools and Demonstrations in Model-Driven Engineering Sci. Comput. Program. (IF 1.3) Pub Date : 2024-02-09 Davide Di Ruscio, Jessie Galasso, Richard Paige
-
The Modeling Assistant Recommender: A UML class diagram recommender system Sci. Comput. Program. (IF 1.3) Pub Date : 2024-02-09 Maxime Savary-Leblanc, Xavier Le Pallec, Sébastien Gérard
IDEs are in full mutation thanks to more and more intelligent code completion and validation functionalities. These intelligent features also facilitate the creation of new ways of programming such as low-code or no-code. In the meantime, modeling environments still suffer, for the most part, from their outdated interfaces, their too basic features, or their lack of usability. Our research work on
-
A model-checker exploiting structural reductions even with stutter sensitive LTL Sci. Comput. Program. (IF 1.3) Pub Date : 2024-02-06 Yann Thierry-Mieg, Etienne Renault, Emmanuel Paviot-Adet, Denis Poitrenaud
In we proposed to verify LTL properties using a fine grain analysis classifying formulae into four classes (stutter, shortening, lengthening insensitive or none of these). With this classification we extend the applicability of structural reduction to two new classes of formulas, when classical techniques are only applicable for stutter insensitive formulas. This comes at the price of a semi-decision
-
Operationally proving memory access violations in Isabelle/HOL Sci. Comput. Program. (IF 1.3) Pub Date : 2024-01-29 Sharar Ahmadi, Brijesh Dongol, Matt Griffin
Security-critical applications often rely on memory isolation mechanisms to ensure integrity of critical data (e.g., keys) and program instructions (e.g., implementing an attestation protocol). These include software-based security microvisor S μV or hardware-based (e.g., TrustLite or SMART) techniques. Here, we must guarantee that during an execution of a program, none of the assembly-level instructions
-
An industrial experience of using reference architectures for mapping features to code Sci. Comput. Program. (IF 1.3) Pub Date : 2024-01-23 Karam Ignaim, João M. Fernandes, André L. Ferreira
Software Product Lines (SPLs) constitute a popular method for encouraging the methodical reuse of software artefacts. Just like any other piece of software, SPLs require management throughout their evolution, namely to preserve the consistency between requirements and the code. Over time, for a given SPL, many change requests are made and all of them need to be integrated in a consistent and coordinated
-
A framework for higher-order effects & handlers Sci. Comput. Program. (IF 1.3) Pub Date : 2024-01-17 Birthe van den Berg, Tom Schrijvers
Algebraic effects & handlers are a modular approach for modeling side-effects in functional programming. Their syntax is defined in terms of a signature of effectful operations, encoded as a functor, that are plugged into the free monad; their denotational semantics is defined by fold-style handlers that only interpret their part of the syntax and forward the rest. However, not all effects are algebraic:
-
-
ISTA+: Test case generation and optimization for intelligent systems based on coverage analysis Sci. Comput. Program. (IF 1.3) Pub Date : 2024-01-12 Xiaoxue Wu, Yizeng Gu, Lidan Lin, Wei Zheng, Xiang Chen
With the increasing use of intelligent systems in various domains such as self-driving cars, robotics, and smart cities, it is crucial to ensure the quality of intelligent systems for their reliable and effective use in various domains. However, testing intelligent systems poses unique challenges due to their complex structure, low efficiency, and the high cost associated with manually collecting a
-
HFCommunity: An extraction process and relational database to analyze Hugging Face Hub data Sci. Comput. Program. (IF 1.3) Pub Date : 2024-01-10 Adem Ait, Javier Luis Cánovas Izquierdo, Jordi Cabot
Social coding platforms such as or have become the standard for developing Open-Source Software (OSS) projects. With the emergence of Machine Learning (ML), platforms specifically designed for hosting and developing ML-based projects have appeared, being (HFH) one of the most popular ones. HFH aims at sharing datasets, pre-trained ML models and the applications built with them. With over 400 K repositories
-
CrossFuzz: Cross-contract fuzzing for smart contract vulnerability detection Sci. Comput. Program. (IF 1.3) Pub Date : 2024-01-04 Huiwen Yang, Xiguo Gu, Xiang Chen, Liwei Zheng, Zhanqi Cui
Smart contracts are computer programs that run on a blockchain. As the functions implemented by smart contracts become increasingly complex, the number of cross-contract interactions within them also rises. Consequently, the combinatorial explosion of transaction sequences poses a significant challenge for smart contract security vulnerability detection. Existing static analysis-based methods for detecting
-
Verification of message-passing uninterpreted programs Sci. Comput. Program. (IF 1.3) Pub Date : 2024-01-02 Weijiang Hong, Zhenbang Chen, Yufeng Zhang, Hengbiao Yu, Yide Du, Ji Wang
Message-passing programs involve several processes with channel-based communications to deal with tasks concurrently. The complex computations and communications between processes make the verification of message-passing programs hard. By regarding the functions in programs as uninterpreted functions, we focus on the verification problem of message-passing uninterpreted programs. Although the usage
-
Monitoring and forecasting usability indicators: A business intelligence approach for leveraging user-centered evaluation data Sci. Comput. Program. (IF 1.3) Pub Date : 2023-12-30 José A Macías, Clemente R. Borges
Monitoring performance indicators has become a main concern for most organizations today. While much attention has been paid to developing economic, bioinformatics, health, and social media dashboards, little or no attention has been devoted to monitoring and forecasting usability indicators. This can be of interest for analyzing the degree of perceived satisfaction and usability of interactive software
-
Symbolic Analysis and Parameter Synthesis for Networks of Parametric Timed Automata with Global Variables using Maude and SMT Solving Sci. Comput. Program. (IF 1.3) Pub Date : 2023-12-14 Jaime Arias, Kyungmin Bae, Carlos Olarte, Peter Csaba Ölveczky, Laure Petrucci, Fredrik Rømming
This paper presents a rewriting logic “interpreter” for networks of parametric timed automata with global variables (NPTAVs) in Real-Time Maude style. Since explicit-state analysis is not sound and complete for such dense-time systems, we explain how our real-time rewrite theory can be systematically transformed into a rewrite theory that is amenable to symbolic analysis using the integration of Maude
-
TDFix: A lightweight tool for fixing deadlocks based on templates Sci. Comput. Program. (IF 1.3) Pub Date : 2023-12-14 Wangjie Ji, Lili Bo, Yanchi Yuan, Xiaobing Sun
Deadlock is notoriously difficult to detect and fix correctly. Existing approaches aim at fixing deadlocks under the premise of having known the deadlock and the buggy code involved in the deadlock, which leads to a certain gap from the practical multithreaded software development. In this paper, we describe the design and implementation of TDFix, which can detect, localize, and fix deadlocks in Java
-
Preface to the special issue on success stories in model driven engineering Sci. Comput. Program. (IF 1.3) Pub Date : 2023-12-05 Paula Muñoz, Steffen Zschaler, Richard F. Paige
Abstract not available
-
Preface for the Special Issue on SBST’22: Search-Based Software Testing - Tools Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-30
Abstract not available
-
WebDraw: A machine learning-driven tool for automatic website prototyping Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-28 Thisaranie Kaluarachchi, Manjusri Wickramasinghe
To overcome the time-consuming nature and improve the cost-effectiveness of classical web development, being automatic is the most convenient alternative recent researchers suggest. Over the years, researchers have been working on inventing new approaches to generating websites automatically. In this paper, a novel approach is presented that automates the website generation process by incorporating
-
Model based component development and analysis with ComMA Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-22 Ivan Kurtev, Jozef Hooman, Mathijs Schuts, Daan van der Munnik
The lack of explicit and precise specifications of software interfaces between components often leads to integration issues during development and maintenance. To address this, we have developed a framework named ComMA (Component Modeling and Analysis) that supports model-based engineering of high-tech systems by precisely defining components and their interfaces. The framework is a family of Domain
-
What makes a real change in software performance? An empirical study on analyzing the factors that affect the triagement of performance change points Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-22 Jie Chen, Ziyuan Zhang, Dongjin Yu, Haiyang Hu
Performance tests can be automatically done on each commit version with a continuous integration system. After code changes are pushed to the repository, multiple benchmark tests are run to measure system's performance. Change point detection technology analyzes all these outcomes to identify commits that significantly change performance automatically. However, a considerable number of automatically
-
Preface for “Selected papers from the 25th Ibero-American Conference on Software Engineering (CIbSE 2022)” Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-17 Jose Luis de la Vara, Monalessa Barcellos, Marcela Genero, Renata Guizzardi
Abstract not available
-
OnTrack: Reflecting on domain specific formal methods for railway designs Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-15 Phillip James, Faron Moller, Filippos Pantekis
OnTrack is a tool that supports workflows for railway verification that has been implemented using model driven engineering frameworks. Starting with graphical scheme plans and finishing with automatically generated formal models set-up for verification, OnTrack allows railway engineers to interact with verification procedures through encapsulating formal methods. OnTrack is grounded on a domain specification
-
Translation Certification for Smart Contracts Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-07 Jacco O.G. Krijnen, Manuel M.T. Chakravarty, Gabriele Keller, Wouter Swierstra
Compiler correctness is an old problem, but with the emergence of smart contracts on blockchains that problem presents itself in a new light. Smart contracts are self-contained pieces of software that control (valuable) assets in an adversarial environment; once committed to the blockchain, these smart contracts cannot be modified. Smart contracts are typically developed in a high-level contract language
-
An industrial experience report on model-based, AI-enabled proposal development for an RFP/RFI Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-10 Padmalata Nistala, Asha Rajbhoj, Vinay Kulkarni, Sapphire Noronha, Ankit Joshi
Large organizations respond to huge volumes of Request for Proposals (RFP)/ Request for Information (RFI) every year. The process of developing a proposal for an RFP/ RFI is completely manual and time-, effort-, and intellect-intensive. While Model Driven Engineering (MDE) approaches have been popular in downstream Software Development Lifecycle (SDLC) phases to transform the design models into code
-
Reasoning about logical systems in the Coq proof assistant Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-10 Conor Reynolds, Rosemary Monahan
The theory of institutions provides an abstract mathematical framework for specifying logical systems and their semantic relationships. Institutions are based on category theory and have deep roots in a well-developed branch of algebraic specification. However, there are no machine-assisted proofs of correctness for institution-theoretic constructions—chiefly satisfaction conditions for institutions
-
Testing and incremental conformance testing of timed state machines Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-07 Aleksandr Tvardovskii, Khaled El-Fakih, Nina Yevtushenko
We present methods for testing and incremental testing of systems modeled as finite state machines with timeouts (TFSMs). For testing, we establish an appropriate fault model and show how a complete test suite can be derived for a given TFSM specification using traditional FSM-based test derivation approaches considering an untimed FSM abstraction of the given specification. In addition, we consider
-
Preface for the special issue on “Fundamental Approaches to Software Engineering” (FASE 2022) Sci. Comput. Program. (IF 1.3) Pub Date : 2023-11-04 Marie-Christine Jakobs, Einar Broch Johnsen, Eduard Kamburjan, Manuel Wimmer
Abstract not available
-
AnimUML: A practical tool for partial model animation and analysis Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-31 Frédéric Jouault, Valentin Besnard, Matthias Brun, Théo Le Calvar, Fabien Chhel, Mickaël Clavreul, Jérome Delatour, Maxime Méré, Matthias Pasquier, Ciprian Teodorov
Each software modeling tool typically supports only a few tasks among model creation, simulation, debugging, analysis, transformation, deployment, and monitoring. Therefore, multiple tools must generally be jointly used. However, few guarantees are generally provided regarding their semantic compatibility. This paper presents AnimUML, a UML modeling tool supporting most modeling tasks, and helping
-
Enhancing test reuse with GUI events deduplication and adaptive semantic matching Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-31 Shuqi Liu, Yu Zhou, Longbing Ji, Tingting Han, Taolue Chen
Developers typically employ Graphical User Interface (GUI) testing to ensure the expected behavior of applications, but they face the challenge of designing appropriate test cases with functional features. Recently, researchers have proposed several test reuse methods based on semantic matching to alleviate the burden. However, the limited text semantic information and semantic matching rules between
-
Preface for the special issue on NLBSE’22: Natural Language-based Software to support software engineering processes Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-28
Abstract not available
-
An iterative approach for model-based requirements engineering in large collaborative projects: A detailed experience report Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-23 Andrey Sadovykh, Bilal Said, Dragos Truscan, Hugo Bruneliere
In this paper, we report on our 7 years of practical experience designing, developing, deploying, using, and evolving an iterative Model-based Requirements Engineering (MBRE) approach and language in the context of five large European collaborative projects providing complex software-intensive solutions. Based on significant data sets collected both during project execution and via surveys realized
-
Web Augmentation: A systematic mapping study Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-23 Iñigo Aldalur
The potential of Web Augmentation lies in the fact that all users need to adapt the content, style, or behavior of the web pages they visit. This is because every human being has different desires and needs, yet everyone accesses web pages designed for the general public, which cannot satisfy everyone. Web Augmentation tools have diverse objectives, such as modifying content, style, or behavior. Similarly
-
A formal approach for the correct deployment of cloud applications Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-21 Amel Mammar, Meriem Belguidoum, Saddam Hocine Hiba
The deployment of cloud applications is a complex task. It refers to the enablement of SaaS, PaaS or IaaS solutions that may be accessed on demand by end users. It encompasses all the activities from installation to uninstallation, including reconfiguration, etc. To facilitate the deployment of cloud applications, it is essential to design them as component-based applications in order to favor the
-
TyphonML: Tool support for hybrid polystores Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-16 Francesco Basciani, Juri Di Rocco, Ludovico Iovino, Alfonso Pierantonio
Polystore technology supports transparent data access, however building and deploying hybrid data persistence structures is unsupported, complex, and error-prone. Existing methods do not separate conceptual and storage concepts or technology components from modeling data items. Thus, a transparent data layer across technologies is unsupported. This document describes TyphonML's hybrid polystore modeling
-
XACML2mCRL2: Automatic transformation of XACML policies into mCRL2 specifications Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-20 Hamed Arshad, Ross Horne, Christian Johansen, Olaf Owe, Tim A.C. Willemse
The eXtensible Access Control Markup Language (XACML) is a popular OASIS standard for the specification of fine-grained access control policies. However, the standard does not provide a proper solution for the verification of XACML access control policies before their deployment. The first step for the formal verification of XACML policies is to formally specify such policies. Hence, this paper presents
-
SolAR: Automated test-suite generation for solidity smart contracts Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-12 S.W. Driessen, D. Di Nucci, D.A. Tamburri, W.J. van den Heuvel
Smart contracts have rapidly gained popularity as self-contained pieces of code, especially those run on the Ethereum blockchain. On the one hand, smart contracts are immutable, have transparent workings, and execute autonomously. On the other hand, these qualities make it essential to properly test the behavior of a smart contract before deploying it. In this paper, we introduce SolAR, a tool and
-
Exploring complex models with picto web Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-10 Alfa Yohannis, Dimitris Kolovos, Antonio García-Domínguez
Picto Web is a multi-tenant web-based tool for complex model exploration. It can transform different types of models into a variety of transient web-based views in formats such as HTML, Graphviz and PlantUML using rule-based model-to-text transformations. Picto Web implements a lazy view computation approach to support large models and complex transformations efficiently, and includes model and transformation
-
Program generation meets program verification: A case study on number-theoretic transform Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-06 Masahiro Masuda, Yukiyoshi Kameyama
Program generation allows us to produce high-performance code specialized to each application domain. Although it has had great success in various domains, it remains to be seen whether it is effective for cryptography, where the correctness of programs is indispensable. This work presents a unified approach to program generation, analysis, and verification. Our target is Number-Theoretic Transform
-
Denotational and operational semantics for interaction languages: Application to trace analysis Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-05 Erwan Mahe, Christophe Gaston, Pascale Le Gall
Graphical depictions of distributed systems' behaviors in the form of Sequence Diagrams (SD) are widely used, with formalisms such as Message Sequence Charts (MSC) or UML-SD. Yet, only restricted subsets of these languages are associated to formal semantics, most of which are given by translation towards other formalisms. These translational approaches are the only ones enabling formal verification
-
Applying model-driven engineering to the domain of chatbots: The Xatkit experience Sci. Comput. Program. (IF 1.3) Pub Date : 2023-10-02 Gwendal Daniel, Jordi Cabot
Chatbots are becoming a common component of many types of software systems. But they are typically developed as a side feature using ad-hoc tools and custom integrations. Moreover, current frameworks are efficient only when designing simple chatbot applications while they still require advanced technical knowledge to define complex interactions and are difficult to evolve along with the company needs
-
Lessons learned from applying model-driven engineering in 5 domains: The success story of the MontiGem generator framework Sci. Comput. Program. (IF 1.3) Pub Date : 2023-09-29 Constantin Buschhaus, Arkadii Gerasimov, Jörg Christian Kirchhof, Judith Michael, Lukas Netz, Bernhard Rumpe, Sebastian Stüber
We report on our success stories in developing and using Model-Driven Engineering (MDE) tools for information systems on real-world projects within different application domains. It is necessary that we ensure the extensibility and adaptability of code generators if we want to reuse them for different domains. Up to now, research on reusing software has been mainly conducted in the software product
-
A monitoring tool for linear-time μHML Sci. Comput. Program. (IF 1.3) Pub Date : 2023-09-27 Luca Aceto, Antonis Achilleos, Duncan Paul Attard, Léo Exibard, Adrian Francalanza, Anna Ingólfsdóttir
We present detectEr, a monitoring tool that targets software applications written for Erlang/OTP. The tool runtime checks specifications expressed in a safety fragment of the linear-time modal μ-calculus called , used to describe properties about the current system execution. Our technical development is founded on previous theoretical results that are lifted to a first-order setting, where systems
-
DescribeML: A dataset description tool for machine learning Sci. Comput. Program. (IF 1.3) Pub Date : 2023-09-12 Joan Giner-Miguelez, Abel Gómez, Jordi Cabot
Datasets are essential for training and evaluating machine learning models. However, they are also the root cause of many undesirable model behaviors, such as biased predictions. To address this issue, the machine learning community is proposing as a best practice the adoption of common guidelines for describing datasets. However, these guidelines are based on natural language descriptions of the dataset
-
GaMoVR: Gamification-based UML learning environment in virtual reality Sci. Comput. Program. (IF 1.3) Pub Date : 2023-09-09 Enes Yigitbas, Maximilian Schmidt, Antonio Bucchiarone, Sebastian Gottschalk, Gregor Engels
Over the years, UML has become the de facto modeling language used in conceptual design and systems design leading to its adoption in computer science university courses. To improve learning outcomes, motivation, and fun of students learning about modeling UML and modeling in general, a variety of interactive learning applications has been presented over the years. However, so far, they fail to create
-
Stochastic formal model of PI3K/mTOR pathway in Alzheimer's disease for drug repurposing: An evaluation of rapamycin, LY294002, and NVP-BEZ235 Sci. Comput. Program. (IF 1.3) Pub Date : 2023-09-06 Herbert Rausch Fernandes, Giovanni Freitas Gomes, Antonio Carlos Pinheiro de Oliveira, Sérgio Vale Aguiar Campos
Alzheimer's disease is the most common form of dementia characterized by the gradual loss of memory and cognition of patients. There is no drug capable of curing or preventing the disease, being the discovery of an efficient treatment for the disease is of vital importance. An approach that can contribute to this purpose of reducing time and costs of new discoveries is drug repositioning and in silico
-
How accessibility affects other quality attributes of software? A case study of GitHub Sci. Comput. Program. (IF 1.3) Pub Date : 2023-09-04 Yaxin Zhao, Lina Gong, Wenhua Yang, Yu Zhou
Accessible design focuses on enabling as many people as possible to access software products and services, which has drawn extensive attention from software engineering researchers and developers. Currently, developers are improving the accessibility of software in a simple way, and researchers are putting much effort into investigating the characteristics of accessibility issues. No studies have explored
-
FCPP to aggregate them all Sci. Comput. Program. (IF 1.3) Pub Date : 2023-09-01 Giorgio Audrito, Gianluca Torta
Aggregate computing is a promising approach to the self-organisation of distributed devices, allowing to express on a high level of abstraction complex distributed algorithms with robust behaviour guarantees. This approach has been argued to be fruitfully applicable to many different contexts: wireless sensor networks, internet of things, self-organising edge, fog or cloud computing scenarios, and
-
A method of test case set generation in the commutativity test of reduce functions Sci. Comput. Program. (IF 1.3) Pub Date : 2023-08-25 Xiangyu Mu, Lei Liu, Peng Zhang, Jingyao Li, Hui Li
MapReduce framework has become one of the more popular big data processing frameworks. In the MapReduce framework, the test of the commutativity problem of the reduce function may take a lot of time and space. The aim of this study is to reduce the size of the test case set required to detect the commutativity problem of the reduce function when the initial test cases are available. With the initial
-
Generating C: Heterogeneous metaprogramming system description Sci. Comput. Program. (IF 1.3) Pub Date : 2023-08-25 Oleg Kiselyov
Heterogeneous metaprogramming systems use a higher-level host language to generate code in a lower-level object language. Their appeal is taking advantage of the module system, higher-order functions, data types, type system and verification tools of the host language to quicker produce high-performant lower-level code with some correctness guarantees. We present two heterogeneous metaprogramming systems
-
An empirical evaluation of RAIDE: A semi-automated approach for test smells detection and refactoring Sci. Comput. Program. (IF 1.3) Pub Date : 2023-08-23 Railana Santana, Luana Martins, Tássio Virgínio, Larissa Rocha, Heitor Costa, Ivan Machado
Effective test code refactoring is essential for maintaining the quality and efficiency of software development. Automated support for test code refactoring can significantly enhance its cost-effectiveness. However, there is limited evidence on the effectiveness of such automated support, especially for addressing Assertion Roulette and Duplicate Assert test smells. To address this gap, we present
-
Asynchronous unfold/fold transformation for fixpoint logic Sci. Comput. Program. (IF 1.3) Pub Date : 2023-08-23 Mahmudul Faisal Al Ameen, Naoki Kobayashi, Ryosuke Sato
Various program verification problems for functional programs can be reduced to the validity checking problem for formulas of a fixpoint logic. Recently, Kobayashi et al. have shown that the unfold/fold transformation originally developed for logic programming can be extended and applied to prove the validity of fixpoint logic formulas. In the present paper, we refine their unfold/fold transformation
-
The complexity of evaluating nfer Sci. Comput. Program. (IF 1.3) Pub Date : 2023-08-22 Sean Kauffman, Martin Zimmermann
Nfer is a rule-based language for abstracting event streams into a hierarchy of intervals with data. Nfer has multiple implementations and has been applied in the analysis of spacecraft telemetry and autonomous vehicle logs. This work provides the first complexity analysis of nfer evaluation, i.e., the problem of deciding whether a given interval is generated by applying rules. We show that the full
-
Structured development of implementations for divide-and-conquer specifications Sci. Comput. Program. (IF 1.3) Pub Date : 2023-08-18 Maksym Bortin
The paper presents a systematic approach to the derivation of implementations from abstract specifications featuring a few structural properties common to a large variety of algorithmic problems starting with sorting. The method is applied in a case study which is first concerned with weighted finite matroids and the algorithmic construction of their optimal bases in general, and then with the computation
-
Forward- or reverse-mode automatic differentiation: What's the difference? Sci. Comput. Program. (IF 1.3) Pub Date : 2023-08-15 Birthe van den Berg, Tom Schrijvers, James McKinna, Alexander Vandenbroucke
Automatic differentiation (AD) has been a topic of interest for researchers in many disciplines, with increased popularity since its application to machine learning and neural networks. Although many researchers appreciate and know how to apply AD, it remains a challenge to truly understand the underlying processes. From an algebraic point of view, however, AD appears surprisingly natural: it originates