当前期刊: Science of Computer Programming Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Dynamic creation of source code models for the extraction of code metrics data through grammar querying
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-05-19
    Alberto S. Nuñez-Varela; Héctor G. Pérez-Gonzalez; Francisco E. Martínez-Perez; Carlos Soubervielle-Montalvo; Oscar E. Perez-Cham

    Source code metrics extraction is a complex task that has to be done automatically given the current size of software. They are extracted using software metric tools and more generic extraction mechanisms. These mechanisms usually work by querying a source code representation model. These models are static, and the information that can be obtained from them is limited. In this work an extraction methodology

    更新日期:2020-05-19
  • Linked weak reference arrays: A hybrid approach to efficient bulk finalization
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-05-14
    Andrés Valloud

    The present work describes a challenging, real-life finalization scenario that applies combined scalability and resource utilization pressure. Neither weak reference arrays nor ephemerons satisfactorily address the performance-critical demands, hence addressing these existing limitations requires a new strategy. This paper puts forward a hybrid weak arrayed container with properties from both weak

    更新日期:2020-05-14
  • Synthesizing and optimizing FDIR recovery strategies from fault trees
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-05-13
    Sascha Müller; Liana Mikaelyan; Andreas Gerndt; Thomas Noll

    Redundancy concepts are major design drivers in fault-tolerant space systems. It can be a difficult task to decide when to activate which redundancy, and which component should be replaced. In this paper, we refine a methodology where recovery strategies are synthesized from a model of non-deterministic dynamic fault trees. The synthesis is performed by transforming non-deterministic dynamic fault

    更新日期:2020-05-13
  • Handling B models in the PERF integrated verification framework: Formalised and certified embedding
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-05-07
    Alexandra Halchin; Yamine Ait-Ameur; Neeraj Kumar Singh; Julien Ordioni; Abderrahmane Feliachi

    The design of complex systems involves several design models supporting different analysis techniques for validation and verification purposes. These activities lead to the definition of heterogeneous modelling languages and analysis techniques. In this setting, meeting certification standards becomes a key issue in system engineering. Reducing heterogeneity due to the presence of different modelling

    更新日期:2020-05-07
  • Safe automated refactoring for intelligent parallelization of Java 8 streams
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-05-06
    Raffi Khatchadourian; Yiming Tang; Mehdi Bagherzadeh

    Streaming APIs are becoming more pervasive in mainstream Object-Oriented programming languages and platforms. For example, the Stream API introduced in Java 8 allows for functional-like, MapReduce-style operations in processing both finite, e.g., collections, and infinite data structures. However, using this API efficiently involves subtle considerations such as determining when it is best for stream

    更新日期:2020-05-06
  • Improving the success rate of applying the extract method refactoring
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-04-30
    Juan Pablo Sandoval Alcocer; Alejandra Siles Antezana; Gustavo Santos; Alexandre Bergel

    Context: Most modern programming environments support refactorings. Although refactorings are relevant to improve the quality of software source code, they unfortunately suffer from severe usability issues. In particular, the extract method refactoring, one of the most prominent refactorings, has a failure rate of 49% when users attempt to use it. Objective: Our main objective is to improve the success

    更新日期:2020-04-30
  • A new modular implementation for stateful traits
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-04-29
    Pablo Tesone; Stéphane Ducasse; Guillermo Polito; Luc Fabresse; Noury Bouraqadi

    The term traits is overloaded in the literature. In this work we refer to traits as the stateless model and implementation described in Schaerli et al. articles. Traits provide a flexible way to support multiple inheritance code reuse in the context of a single inheritance language. The Pharo programming language includes the second implementation of stateless traits based on the original version of

    更新日期:2020-04-29
  • Formalizing the dependency pair criterion for innermost termination
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-04-28
    Ariane Alves Almeida; Mauricio Ayala-Rincón

    Rewriting is a framework for reasoning about functional programming. The dependency pair criterion is a well-known mechanism to analyze termination of term rewriting systems. Functional specifications with an operational semantics based on evaluation are related, in the rewriting framework, to the innermost reduction relation. This paper presents a PVS formalization of the dependency pair criterion

    更新日期:2020-04-28
  • Ready, set, Go!
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-04-24
    Daniel Schnetzer Fava; Martin Steffen

    Data races are often discussed in the context of lock acquisition and release, with race-detection algorithms routinely relying on vector clocks as a means of capturing the relative ordering of events from different threads. In this paper, we present a data-race detector for a language with channel communication as its sole synchronization primitive, and provide a semantics directly tied to the happens-before

    更新日期:2020-04-24
  • The Prevalence and Severity of Persistent Ambiguity in Software Requirements Specifications: Is a Special Effort Needed to Find Them?
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-04-24
    Cristina Ribeiro; Daniel Berry

    Context and motivation All the research in methods and tools for avoiding, detecting, and removing ambiguities in requirements specifications assumes that doing so is necessary and that the methods and tools for doing so are worth the effort to use them. Each of two attempts by de Bruijn et al and Philippo et al to test these assumptions empirically with a case study examined a random sampling of the

    更新日期:2020-04-24
  • Lean formalization of bounded grids and computable cellular automata defined thereover
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-04-22
    František Silváši; Martin Tomášek

    We present a formalization of bounded grids using Lean proof assistant and provide a formalized implementation along with an interface consisting of various definitions together with their proven–correct properties serving to manipulate grids in general fashion regardless of the intended use case. We then proceed to demonstrate the applicability of the grids by interpreting them as matrices, followed

    更新日期:2020-04-22
  • Formal verification of input-output mappings of tree ensembles
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-03-19
    John Törnblom; Simin Nadjm-Tehrani

    Recent advances in machine learning and artificial intelligence are now being considered in safety-critical autonomous systems where software defects may cause severe harm to humans and the environment. Design organizations in these domains are currently unable to provide convincing arguments that their systems are safe to operate when machine learning algorithms are used to implement their software

    更新日期:2020-04-18
  • Programming language foundations in Agda
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-03-24
    Wen Kokke; Jeremy G. Siek; Philip Wadler

    One of the leading textbooks for formal methods is Software Foundations (SF), written by Benjamin Pierce in collaboration with others, and based on Coq. After five years using SF in the classroom, we came to the conclusion that Coq is not the best vehicle for this purpose, as too much of the course needs to focus on learning tactics for proof derivation, to the cost of learning programming language

    更新日期:2020-04-18
  • A debugging approach for live Big Data applications
    Sci. Comput. Program. (IF 1.088) Pub Date : 2020-04-03
    Matteo Marra; Guillermo Polito; Elisa Gonzalez Boix

    Many frameworks exist for programmers to develop and deploy Big Data applications such as Hadoop Map/Reduce and Apache Spark. However, very little debugging support is currently provided in those frameworks. When an error occurs, developers are lost in trying to understand what has happened from the information provided in log files. Recently, new solutions allow developers to record & replay the application

    更新日期:2020-04-18
  • Comparison of eigensolvers for symmetric band matrices.
    Sci. Comput. Program. Pub Date : 2014-09-15
    Michael Moldaschl,Wilfried N Gansterer

    We compare different algorithms for computing eigenvalues and eigenvectors of a symmetric band matrix across a wide range of synthetic test problems. Of particular interest is a comparison of state-of-the-art tridiagonalization-based methods as implemented in Lapack or Plasma on the one hand, and the block divide-and-conquer (BD&C) algorithm as well as the block twisted factorization (BTF) method on

    更新日期:2019-11-01
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
智控未来
聚焦商业经济政治法律
跟Nature、Science文章学绘图
控制与机器人
招募海内外科研人才,上自然官网
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
湖南大学化学化工学院刘松
上海有机所
李旸
南方科技大学
西湖大学
伊利诺伊大学香槟分校
支志明
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug