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

acm sigplan International symposium on New Ideas, New Paradigms, and Reflections on programming and software (Onward!)

作者： Aish, Robert Al Fisher Orchard, Dominic Torry, Jay UCL London England Bur Happold London England Univ Kent Canterbury Kent England Univ Cambridge Cambridge England

ISBN: (纸本)9798400712159

Design Computation is the use of programming in the design of physical systems such as buildings and infrastructure. This involves embedding both general-purpose textual languages and domain-specific visual languages within geometry modelling and engineering applications in the construction industry. A unique form of entry-level end-user programming has emerged in Design Computation. However, there are significant usability and representational issues;general-purpose languages present barriers to adoption, whilst visual languages do not scale to complex design problems. In this essay, we explore how advances in programming language research could be harnessed in future Design Computation languages to address these pedagogic, representational and scaling issues so as to improve human-readable program structure and semantics and to enable machine-readable program verification.

关键词： Design Computation programming languages Visual languages End-User programming Cognitive Dimensions Usability Collaborative Coding Type systems Units of Measure Collection Types Program Verification

来源：评论

学校读者我要写书评

暂无评论

Use Site Checking Considered Harmful

Use Site Checking Considered Harmful

引用

acm sigplan International symposium on New Ideas, New Paradigms, and Reflections on programming and software (Onward!)

作者： Racordon, Dimi Chung, Benjamin Ecole Polytech Fed Lausanne Lausanne Switzerland Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9798400712159

Static type checking aims to detect nonsensical operations based on their domains at compile time. While its benefits no longer need to be argued, it comes with expressiveness limitations that can only be lifted at the expense of complexity. This problem is particularly antithetical to generic programming, where algorithms and data structures are designed in the most general setting possible. In response, some systems have adopted a form of static duck typing: generic definitions are written against assumed interfaces that are only type checked with concrete types at their ultimate use sites. This essay claims that such an approach, which we refer to as use site checking, is harmful to user experience. We study four main problems caused by use site checking and show how they relate to similar well-known issues in dynamically typed languages. We then look at existing language constructs to discuss how statically typed languages may address these shortcomings.

关键词： type checking static typing dynamic typing type safety generic programming expression problem

来源：评论

学校读者我要写书评

暂无评论

Towards Self-Adaptable languages

Towards Self-Adaptable Languages

引用

International symposium on New Ideas, New Paradigms, and Reflections on programming and software (Onward!)

作者： Jouneaux, Gwendal Barais, Olivier Combemale, Benoit Mussbacher, Gunter Univ Rennes Inria IRISA Rennes France McGill Univ Montreal PQ Canada

ISBN: (纸本)9781450391108

Over recent years, self-adaptation has become a concern for many software systems that have to operate in complex and changing environments. At the core of self-adaptation, there is a feedback loop and associated trade-off reasoning to decide on the best course of action. However, existing software languages do not abstract the development and execution of such feedback loops for self-adaptable systems. Developers have to fall back to ad-hoc solutions to implement self-adaptable systems, often with wide-ranging design implications (e.g., explicit MAPE-K loop). Furthermore, existing software languages do not capitalize on monitored usage data of a language and its modeling environment. This hinders the continuous and automatic evolution of a software language based on feedback loops from the modeling environment and runtime software system. To address the aforementioned issues, this paper introduces the concept of Self-Adaptable language (SAL) to abstract the feedback loops at both system and language levels. We propose L-MODA (language, Models, and Data) as a conceptual reference framework that characterizes the possible feedback loops abstracted into a SAL. To demonstrate SALs, we present emerging results on the abstraction of the system feedback loop into the language semantics. We report on the concept of Self-Adaptable Virtual Machines as an example of semantic adaptation in a language interpreter and present a roadmap for SALs.

关键词： self-adaptation feedback loop trade-off analysis software language L-MODA framework

来源：评论

学校读者我要写书评

暂无评论

Kaizen: A scalable concolic fuzzing tool for Scala 11

Kaizen: A scalable concolic fuzzing tool for Scala

引用

11th acm sigplan International symposium on Scala, SCALA 2020, co-located with the acm sigplan Conference on systems, programming, languages, and Applications: software for Humanity, SPLASH 2020

作者： Ashouri, Mohammadreza University of Potsdam Germany

ISBN: (纸本)9781450381772

Scala is an open-source programming language created by Martin Odersky in 2001 and released under the BSD or Berkeley software Distribution license. The language consolidates object-oriented and functional programming in one high-level and robust language. Scala also maintains static types that help to reduce tricky errors during the execution time. In this paper, we introduce "Kaizen"as a practical security analysis tool that works based on concolic fuzzing for evaluating real-world Scala applications. To evaluated our approach, we analyzed 1,000 popular Scala projects existing on GitHub. As a result, Kaizen could report and exploit 101 security issues;some of those have not been reported before. Furthermore, our performance analysis outcome on the ScalaBench test suite demonstrates a 49% runtime overhead that proves Kaizen's usefulness for security testing in the Scala ecosystem. © 2020 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Prefetching in Functional languages 2020

Prefetching in Functional Languages

引用

acm sigplan International Conference on Memory Management (ISMM)

作者： Ainsworth, Sam Jones, Timothy M. Univ Cambridge Cambridge England

ISBN: (纸本)9781450375665

Functional programming languages contain a number of runtime and language features, such as garbage collection, indirect memory accesses, linked data structures and immutability, that interact with a processor's memory system. These conspire to cause a variety of unintuitive memory-performance effects. For example, it is slower to traverse through linked lists and arrays of data that have been sorted than to traverse the same data accessed in the order it was allocated. We seek to understand these issues and mitigate them in a manner consistent with functional languages, taking advantage of the features themselves where possible. For example, immutability and garbage collection force linked lists to be allocated roughly sequentially in memory, even when the data pointed to within each node is not. We add language primitives for software-prefetching to the OCaml language to exploit this, and observe significant performance improvements a variety of micro- and macro-benchmarks, resulting in speedups of up to 2x on the out-of-order super-scalar Intel Haswell and Xeon Phi Knights Landing systems, and up to 3x on the in-order Arm Cortex-A53.

关键词： software Prefetching Hardware Prefetching Functional programming OCaml

来源：评论

学校读者我要写书评

暂无评论

Efficient symbolic execution of strings for validating web applications 2

Efficient symbolic execution of strings for validating web a...

引用

2nd International Workshop on Defects in Large software systems, DEFECTS 2009

作者： Shannon, D. Rajan, I. Ghosh S. Khurshid, S. Dept. of Elec. and Comptr. Engr. Univ. of Texas at Austin AustinTX United States Trusted Systems Innovation Group Fujitsu Labs. of America SunnyvaleCA United States

ISBN: (纸本)9781605586540

Symbolic execution is a popular technique used in formal verification of software and hardware systems. In this paper we examine three different ways of performing symbolic execution for the purpose of formal model checking, on web application software implemented with the Java programming language. We evaluate the different techniques on real industrial applications and compare them on issues of performance, implementation ease, and ease-of-use. There are some special characteristics of web applications like extensive use of string inputs that need to be tackled before traditional symbolic execution techniques become feasible. We provide details of how we have solved those issues. © 2009 acm.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Data and computation transformations for brook streaming applications on multiprocessors 06

Data and computation transformations for brook streaming app...

引用

4th International symposium on Code Generation and Optimization

作者： Liao, Shih-Wei Du, Zhaohui Wu, Gansha Lueh, Guei-Yuan Intel Corp 2200 Mission Coll Blvd Santa Clara CA 95054 USA

ISBN: (纸本)0769524990

Multicore processors are about to become prevalent in the PC world. Meanwhile, over 90% of the computing cycles are estimated to be consumed by streaming media applications [24]. Although stream programming exposes parallelism naturally, we found that achieving high performance on multiprocessors is challenging. Therefore, we develop a parallel compiler for the Brook streaming language with aggressive data and computation transformations. First, we formulate fifteen Brook stream operators in terms of systems of inequalities. Our compiler optimizes the modeled operators to improve memory footprint and performance. Second, the stream computation including both kernels and operators is mapped to the affine partitioning model by modeling each kernel as an implicit loop nest over stream elements. Note that our general abstraction is not limited to Brook. Our modeling and transformations yield high performance on uniprocessors as well. The geometric mean of speedups is 4.7 on ten streaming applications on a Xeon. On multiprocessors, we show that exploiting the standard intra-kernel data parallelism is inferior to our general modeling. The former yields a speedup of 1.5 for ten applications on a 4-way Xeon, while the latter achieves a speedup of 6.4 over the same baseline. We show that our compiler effectively reduces memory footprint, exploits parallelism, and circumvents phase-ordering issues.

关键词： Application software Parallel processing Kernel Multicore processing Streaming media Parallel programming Concurrent computing Optimizing compilers Image coding Graphics

来源：评论

学校读者我要写书评

暂无评论

MetaML and multi-stage programming with explicit annotations

引用

THEORETICAL COMPUTER SCIENCE 2000年第1-2期248卷 211-242页

作者： Taha, W Sheard, T Oregon Grad Inst Dept Comp Sci & Engn Portland OR 97291 USA

We introduce MetaML, a practically motivated, statically typed multi-stage programming language. MetaML is a "rear" language. We have built an implementation and used it to solve multi-stage problems. MetaML allows the programmer to construct, combine, and execute code fragments in a type-safe manner. Code fragments can contain free variables, but they obey the static-scoping principle. MetaML performs type-checking for all stages once and for all before the execution of the first stage. Certain anomalies with our first MetaML implementation led us to formalize an illustrative subset of the MetaML implementation. We present both a big-step semantics and type system for this subset, and prove the type system's soundness with respect to a big-step semantics. From a software engineering point of view, this means that generators written in the MetaML subset never generate unsafe programs. A type system and semantics for full MetaML is still ongoing work. We argue that multi-stage languages are useful as programming languages in their own right, that they supply a sound basis for high-level program generation technology, and that they should support features that make it possible for programmers to write staged computations without significantly changing their normal programming style. To illustrate this we provide a simple three-stage example elaborating a number of practical issues. The design of MetaML was based on two main principles that we identified as fundamental for high-level program generation, namely, cross-stage persistence and cross-stage safety. We present these principles, explain the technical problems they give rise to, and how we address with these problems in our implementation. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

关键词： functional programming lambda-calculus high-level program generation type-safety type-systems programming language semantics multi-level languages multi-stage languages

来源：评论

学校读者我要写书评

暂无评论

Object management issues for software engineering environments workshop report 3

Object management issues for software engineering environmen...

引用

3rd acm SIGSOFT/sigplan software Engineering symposium on Practical software Development Environments, SDE 1988

作者： Penedo, Maria H. Ploedereder, Erhard Thomas, Ian TRW One Space Park Redondo BeachCA90278 United States Tartan Laboratories Inc. 461 Melwood Ave. PittsburghPA15213 United States Bull 68 Route de Versailles Louveciennes78430 France

ISBN: (纸本)089791290X

During recent years, several research efforts in the area of software development environments have focused on the provision of uniform Object Management systems (OMS) as a framework for tool integration and communication. This paper summarizes discussions of an OMS Workshop on the issues that arise in defining an appropriate data model for an OMS. © 1988 acm.

关键词： software design

来源：评论

学校读者我要写书评

暂无评论

A unifying model for consistent distributed software development environments 3

A unifying model for consistent distributed software develop...

引用

3rd acm SIGSOFT/sigplan software Engineering symposium on Practical software Development Environments, SDE 1988

作者： Walpole, J. Blair, G.S. Malik, J. Nicol, J.R. Department of Computing University of Lancaster Bailrigg Lancaster United Kingdom

ISBN: (纸本)089791290X

The increase in size and complexity of software projects over recent years has lead to the need for software Development Environments (SDEs). SDEs are intended to provide assistance in the development of large software systems involving teams of people. It is generally agreed that SDE's should be built on a distributed base. However, the distribution of computer systems introduces several problems which make it very difficult to maintain the consistency of data. To ensure that changes to data are made consistently the concept of atomic transactions is usually adopted. However, existing transaction mechanisms are unsuitable for use in a distributed SDE. Furthermore, transactions are not the only mechanism concerned with controlling changes to the SDE database. The control of change is also a task for version and configuration control mechanisms. Traditionally, the functions of version control, configuration control and transactions have been treated as separate, unrelated issues. This paper presents a new model which unifies all three concepts in a distributed SDE. Mechanisms for supporting the new model are presented and the application of the model to the Cosmos Distributed SDE is discussed. © 1988 acm.

关键词： software design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：