检索结果-内蒙古大学图书馆

Two N-of-1 self-trials on readability differences between anonymous inner classes (AICs) and lambda expressions (LEs) on Java code snippets

引用

EMPIRICAL SOFTWARE ENGINEERING 2022年第2期27卷 1-39页

作者： Hanenberg, Stefan Mehlhorn, Nils Univ Duisburg Essen Paluno Ruhr Inst Software Technol Essen Germany

In Java, lambda expressions (LEs) were introduced at a time where the similar language construct anonymous inner class (AIC) already existed for years. But while LEs became quite popular in mainstream programming languages in general, their usability is hardly studied. From the Java perspective the need to study the relationship between LEs and AICs was and is quite obvious, because both language constructs co-exist. However, it is quite usual that new language constructs are introduced although they are not or hardly studied using scientific methods - and an often heard argument from programming language designers is that the effort or the costs for the application of the scientific method on language constructs is too high. The present paper contributes in two different ways. First, with respect to LEs in comparison to AICs, this paper presents two N-of-1 studies (i.e. randomized control trials executed on a single subject) where LEs and AICs are used as listeners in Java code. Both experiments had two similar and rather simple tasks ("count the number of parameters", respectively "count the number of used parameters") with the dependent variable being reaction time. The first experiment used the number of parameters, the second the number of used parameters as the controlled, independent variable (in addition to the technique LE and AIC). Other variables (LOC, etc.) were randomly generated within given boundaries. The main result of both experiments is that LEs without type annotations require less reading time (p hs .2, reduction of reaction time of at most 35%). The results are based on 9,600 observations (one N-of-1 trial with eight replications). This gives evidence that the readability of LEs without type annotations improves the readability of code. However, the effect seems to be so small, that we do not expect this to have a larger impact on daily programming. Second, we see the contribution of this paper in the application of N-of-1 trials. Such experime

关键词： programming programming language Readability Lambda expressions

来源：评论

学校读者我要写书评

暂无评论

ACCESS CONTROL IN PARALLEL PROGRAMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1979年第1期5卷 1-9页

作者： MCGRAW, JR ANDREWS, GR Department of Applied Science University of California

An important component of a programming language for writing operating systems, or other large parallel systems, is the set of access control facilities. Two principles for access control, expressive power and access validation, are discussed. Then two new language mechanisms are presented: one for expressing the static structure and access rights of parallel systems, the other for controlling dynamic access to shared objects (monitors). The use of the proposed mechanisms is illustrated by examples including a file system. Finally, the relationships between the mechanisms, access validation, and the safety problem are discussed.

关键词： Security Access Control Access Safety Monitors Processes programming language Protection

来源：评论

学校读者我要写书评

暂无评论

An extensive empirical study on C plus plus concurrency constructs

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2016年第Aug.期76卷 1-18页

作者： Wu, Di Chen, Lin Zhou, Yuming Xu, Baowen Nanjing Univ State Key Lab Novel Software Technol Nanjing 210046 Jiangsu Peoples R China Nanjing Univ Dept Comp Sci & Technol Nanjing 210046 Jiangsu Peoples R China

Context: Nowadays concurrent programming is in large demand. The inherent support for concurrency is therefore increasingly important in programming languages. As for C++, an abundance of standard con currency constructs have been supported since C++11. However, to date there is little work investigating how these constructs are actually used in developing real software. Objective: In this paper, we perform an extensive empirical study to investigate the actual adoption of C++ concurrency constructs in open-source applications, with the goal to provide useful information for language designers and practitioners to improve the design and use of concurrency constructs. Method: We first conduct a survey to understand the developers' perception of concurrency constructs. Then, we analyze 492 open-source concurrent applications, comprising 131 million lines of C++ code, to collect the data of the practical adoption of concurrency constructs. Finally, we perform statistical analysis on the collected data and get the quantitative analysis results. Results: Using the experimental data, we uncover many interesting findings with respect to the usage of concurrency constructs, the management of synchronization, the relationship between standard concurrency constructs and third-party concurrency constructs, and the difference of applications in using con currency constructs. For example, we find that: (1) thread-based constructs are significantly more often used to write concurrent programs than atomics-based constructs and task-based constructs;(2) lock based constructs are significantly more often used to manage synchronization than lock-free constructs and blocking constructs;(3) developers in most projects do not move from third-party concurrency constructs to standard concurrency constructs;and (4) small-size applications introduce concurrency constructs more intensively and more quickly than medium-size applications and large-size applications. Conclusions: This is the fi

关键词： programming language C plus Concurrency Empirical study

来源：评论

学校读者我要写书评

暂无评论

Synchronous Deterministic Parallel programming for Multi-Cores with ForeC

引用

ACM TRANSACTIONS ON programming languageS AND SYSTEMS 2023年第2期45卷 1-74页

作者： Yip, Eugene Girault, Alain Roop, Partha S. Biglari-Abhari, Morteza Univ Bamberg Software Technol Res Grp D-96047 Bamberg Germany Univ Grenoble Alpes INRIA CNRS Grenoble INPLIG Grenoble France Univ Auckland Dept ECE Auckland New Zealand

Embedded real-time systems are tightly integrated with their physical environment. Their correctness depends both on the outputs and timeliness of their computations. The increasing use of multi-core processors in such systems is pushing embedded programmers to be parallel programming experts. However, parallel programming is challenging because of the skills, experiences, and knowledge needed to avoid common parallel programming traps and pitfalls. This article proposes the ForeC synchronous multi-threaded programming language for the deterministic, parallel, and reactive programming of embedded multi-cores. The synchronous semantics of ForeC is designed to greatly simplify the understanding and debugging of parallel programs. ForeC ensures that ForeC programs can be compiled efficiently for parallel execution and be amenable to static timing analysis. ForeC's main innovation is its shared variable semantics that provides thread isolation and deterministic thread communication. All ForeC programs are correct by construction and deadlock free because no non-deterministic constructs are needed. We have benchmarked our ForeC compiler with several medium-sized programs (e.g., a 2.274-line ForeC program with up to 26 threads and distributed on up to 10 cores, which was based on a 2.155-line non-multi-threaded C program). These benchmark programs show that ForeC can achieve better parallel performance than Esterel, a widely used imperative synchronous language for concurrent safety-critical systems, and is competitive in performance to OpenMP, a popular desktop solution for parallel programming (which implements classical multi-threading, hence is intrinsically non-deterministic). We also demonstrate that the worst-case execution time of ForeC programs can be estimated to a high degree of precision.

关键词： programming language semantics parallelism synchronous determinism reactive programming multi-core worst-case execution time code generation

来源：评论

学校读者我要写书评

暂无评论

Automated Log Data Analytics Workflow-The Value of Data Access and Management to Reduced Turnaround Time for Log Analysis

引用

PETROPHYSICS 2022年第1期63卷 35-60页

作者： Caceres, Veronica Alejandra Torres Duffaut, Kenneth Westad, Frank Ove Stovas, Alexey Johansen, Yngve Bolstad Jenssen, Arne Norwegian Univ Sci & Technol Trondheim Norway Norwegian Univ Sci & Technol Dept Engn Cybernet Trondheim Norway Aker BP ASA Lysaker Norway Excelerity As Trondheim Norway

The oil and gas industry of today is undergoing rapid digitalization. This implies a massive effort to transform standard work procedures and workflows into more efficient practices and implementations using machine learning (ML) and automation. This will enable geoscientists to explore and exploit vast amounts of data quickly and efficiently. To address these current industry challenges, we propose a pilot well-log database in HDF5 (Hierarchical Data Format version 5) format that can be continuously extended if new data become available. It also provides versatility for data preparation for further analysis. We show an alternative way to store and use log files in a hierarchical structure that is easy to understand and handle by research institutes, companies, and academia. We also touch upon well-log depth matching, a long-standing industry challenge, to synchronize data from different logging passes to a single depth reference. Having a robust automated solution for depth matching is important to facilitate the use of all available data in a depth interval for analysis by ML. We propose an automatic well-log depth-matching workflow capable of handling multiple log types simultaneously and its integration with the database. The updated depth-matched logs are added to the database with their corresponding metadata, giving the geoscientist full control. We implemented two algorithms-classical cross correlation combined with a scaling factor to simulate stretch-squeeze effects and a constrained dynamic time warping (DTW). Our results indicate that the classical cross correlation outperforms the warping for both robustness and speed when the DTW is constrained to avoid excessive signal distortion and when the number of processed curves increases, respectively. Some limitations of our approach are related to large changes in the log patterns between the runs, as well as the assumption of negligible depth shift between log types within the same run. The cross correlatio

关键词： machine learning mwd reservoir characterization programming language log analysis drilling measurement optimization problem well logging measurement while drilling upstream oil & gas

来源：评论

学校读者我要写书评

暂无评论

LISLOG-C - A 1ST STEP TO GENERALIZED EXPRESSION OF CONSTRAINTS IN LOGIC programming

引用

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 1989年第5-6期44卷 218-228页

作者： BOURGAULT, S LEPAPE, JP RANSON, D ***-laa-slc route de Trégastel 40 F-22301 Lannion Cedex Lannion

En Prolog standard, la réalisation d’un programme de bonne qualité opérationnelle suppose une formulation souvent très éloignée de la spécification initiale du problème. En Lislog-C (LISp + proLOG + Contraintes), la déclaration de contraintes permet généralement d’assurer la qualité opérationnelle de la programmation simplement calquée sur la spécification. Sur le plan externe, le nouveau concept de base de Lislog-C est le concept de contraintes; il s’intègre très naturellement au formalisme des clauses de Horn. Le point fort de la notion de contraintes est que, tout en améliorant la puissance et la souplesse du langage, elle assure un comportement optimisé des programmes à l’exécution. Sur le plan interne, l’approche Lislog-C assure, d’une part, la richesse et la fiabilité de l’interface Lisp/Prolog et, d’autre part, la réalisation de mécanismes de contr?le transparents pour l’utilisateur. De nombreux types de problèmes font naturellement appel au concept de contraintes: caracterisation d’ensembles, description de types, domaines, gestion de ressources, synchronisation par événements, etc. Les quelques exemples traités illustrent la facilité de la programmation basée sur les contraintes.

关键词： Langage programmation Prolog Lisp Programmation logique Contrainte programming language Prolog language Lisp language Logical programming Constraint

来源：评论

学校读者我要写书评

暂无评论

programming with exceptions in JCilk

引用

SCIENCE OF COMPUTER programming 2006年第2期63卷 147-171页

作者： Danaher, John S. Lee, I. -Ting Angelina Leiserson, Charles E. MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

JCilk extends the serial subset of the Java language by importing the fork-join primitives spawn and sync from the Cilk multithreaded language, thereby providing call-return semantics for multithreaded subcomputations. In addition, JCilk transparently integrates Java's exception handling with multithreading by extending the semantics of Java's try and catch constructs, but without adding new keywords. This extension is "faithful" in that it obeys Java's ordinary serial semantics when executed on a single processor. When executed in parallel, however, an exception thrown by a JCilk computation causes its sibling computations to abort, which yields a clean semantics in which the enclosing cilk try block need only handle a single exception. The exception semantics of JCilk allows programs with speculative computations to be programmed easily. Speculation is essential in order to parallelize programs such as branch-and-bound or heuristic search. We show how JCilk's linguistic mechanisms can be used to program the "queens" puzzle and a parallel alpha-beta search. We have implemented JCilk's semantic model in a prototype compiler and runtime system, called JCilk-1. The compiler implements continuations in a novel fashion by introducing goto statements into Java. The JCilk-1 runtime system shadows the dynamic hierarchy of cilk try blocks using a "try tree", allowing the system to chase down side computations that must be aborted. Performance studies indicate that JCilk's exception mechanism incurs minimal overhead, contributing at most a few percent on top of the cost for a spawn/return. (c) 2006 Elsevier B.V. All rights reserved.

关键词： multithreading parallel computing programming language runtime system posix thread Cilk fork-join JVM Java exception handling bytecode semisynchronous atomicity speculative computing

来源：评论

学校读者我要写书评

暂无评论

A framework for programming multiversion databases

引用

DATA & KNOWLEDGE ENGINEERING 2001年第1期36卷 29-53页

作者： Gançarski, S Jomier, G Univ Paris 06 F-75252 Paris 5 France Univ Paris 09 LAMSADE F-75775 Paris France

Multiversion databases allow to represent in a database several states, or versions, of the real world entities. To take into account the new dimension introduced by versioning, new operations must be added to conventional database programming languages. In this paper, we describe such operations according to the DataBase Version (DBV) model, which allows an efficient management of as many versions as needed. Operations are first presented intuitively, then formal definitions of their syntax and their semantics is given. The work presented is considered as a syntactical framework for the development of sophisticated tools for design applications and configuration management. Special attention is paid to operations on complex object versions. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： database version context of versions programming language

来源：评论

学校读者我要写书评

暂无评论

Moving Java to the factory

引用

IEEE SPECTRUM 1998年第12期35卷 18-23页

作者： Atherton, RW Sun Microsyst Inc Palo Alto CA USA

Already being adopted for traditional enterprise computing tasks,Java technology is also making its way into manufacturing ***, the programming language is still missing a few capabilitiesthat must somehow be added if... 详细信息

关键词： Java industrial control manufacturing industries computing tasks manufacturing facilities programming language real-time operations REAL TIME OPERATION Computer programming languages Manufacturing Facilities industrial control Manufacturing industry Java Java programming language Industrial Plants

来源：评论

学校读者我要写书评

暂无评论

SYNCHRONIZATION AND CONTROL OF PARALLEL ALGORITHMS

引用

PARALLEL COMPUTING 1985年第3期2卷 255-264页

作者： FREDERICKSON, PO JONES, RE SMITH, BT SANDIA NATL LABS ALBUQUERQUENM 87185 ARGONNE NATL LAB ARGONNEIL 60439

We propose a modest collection of primitives for synchronization and control in parallel numerical algorithms. These are phrased in a syntax that is compatible with FORTRAN, creating a publication language for parallel software. A preprocessor may be used to map code written in this extended FORTRAN into standard FORTRAN with calls to the run-time libraries of the various parallel systems now in use. We solicit the reader's comments on the clarity, as well as the adequacy, of the primitives we have proposed.

关键词： control parallel algorithm parallel processor programming language Synchronization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：