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

17th ACM SIGPLAN international conference on generative programming - concepts and experiences (GPCE) part of the SPLASH Collection of conferences and Workshops

作者： Susungi, Adilla Rink, Norman A. Cohen, Albert Castrillon, Jeronimo Tadonki, Claude PSL Res Univ MINES ParisTech Paris France Tech Univ Dresden Chair Compiler Construct Dresden Germany INRIA Villers Les Nancy France ENS DI Paris France

ISBN: (纸本)9781450360456

Many modern application domains crucially rely on tensor operations. the optimization of programs that operate on tensors poses difficulties that are not adequately addressed by existing languages and tools. Frameworks such as TensorFlow offer good abstractions for tensor operations, but target a specific domain, i.e. machine learning, and their optimization strategies cannot easily be adjusted to other domains. General-purpose optimization tools such as Pluto and existing meta-languages offer more flexibility in applying optimizations but lack abstractions for tensors. this work closes the gap between domain-specific tensor languages and general-purpose optimization tools by proposing the Tensor optimizations Meta-Language (TEML). Ton offers high-level abstractions for both tensor operations and loop transformations, and enables flexible composition of transformations into effective optimization paths. this compositionality is built into TEML's design, as our formal language specification will reveal. We also show that TEML can express tensor computations as comfortably as TensorFlow and that it can reproduce Pluto's optimization paths. thus, optimized programs generated by TEML execute at least as fast as the corresponding Pluto programs. In addition, TEML enables optimization paths that often allow outperforming Pluto.

关键词： tensor algebra meta-programming code generation and optimization denotational semantics

来源：评论

学校读者我要写书评

暂无评论

POP-PL: A Patient-Oriented Prescription programming Language 2015

POP-PL: A Patient-Oriented Prescription Programming Language

引用

14th ACM SIGPLAN international conference on generative-programming - concepts and experiences (GPCE) co-located with SPLASH conference

作者： Florence, Spencer P. Fetscher, Bruke Flatt, Matthew Temps, William H. Kiguradze, Tina West, Dennis P. Niznik, Charlotte Yarnold, Paul R. Findler, Robert Bruce Belknap, Steven M. Northwestern Univ Dept Elect Engn & Comp Sci Evanston IL 60208 USA Univ Utah Sch Comp Salt Lake City UT USA Northwestern Univ Dept Dermatol Feinberg Sch Med Chicago IL USA Optimal Data Anal LLC San Diego CA USA Northwestern Univ Dept Med Div Gen Internal Med & Geriatr Feinberg Sch Med Chicago IL USA

ISBN: (纸本)9781450336871

Medical professionals have long used algorithmic thinking to describe and implement health care processes without the benefit of the conceptual framework provided by a programming language. Instead, medical algorithms are expressed using English, flowcharts, or data tables. this results in prescriptions that are difficult to understand, hard to debug, and awkward to reuse. this paper reports on the design and evaluation of a domain-specific programming language, POP-PL, for expressing medical algorithms. the design draws on the experience of researchers in two disciplines, programming languages and medicine. the language is based around the idea that programs and humans have complementary strengths, that when combined can make for safer, more accurate performance of prescriptions. We implemented a prototype of our language and evaluated its design by writing prescriptions in the new language and administering a usability survey to medical professionals. this formative evaluation suggests that medical prescriptions can be conveyed by a programming language's mode of expression and provides useful information for refining the language. Analysis of the survey results suggests that medical professionals can understand and correctly modify programs in POP-PL.

关键词： DSL Design Medical programming Languages Medical Prescriptions Empirical Evaluation

来源：评论

学校读者我要写书评

暂无评论

RT-Trust: Automated Refactoring for Trusted Execution under Real-Time Constraints 2018

RT-Trust: Automated Refactoring for Trusted Execution under ...

引用

17th ACM SIGPLAN international conference on generative programming - concepts and experiences (GPCE) part of the SPLASH Collection of conferences and Workshops

作者： Liu, Yin An, Kijin Tilevich, Eli Virginia Tech Software Innovat Lab Blacksburg VA 24061 USA

ISBN: (纸本)9781450360456

Real-time systems must meet strict timeliness requirements. these systems also often need to protect their critical program information (CPI) from adversarial interference and intellectual property theft. Trusted execution environments (TEE) execute CPI tasks on a special-purpose processor, thus providing hardware protection. However, adapting a system written to execute in environments without TEE requires partitioning the code into the regular and trusted parts. this process involves complex manual program transformations that are not only laborious and intellectually tiresome, but also hard to validate and verify for the adherence to real-time constraints. To address these problems, this paper presents novel program analyses and transformation techniques, accessible to the developer via a declarative meta-programming model. the developer declaratively specifies the CPI portion of the system. A custom static analysis checks CPI specifications for validity, while probe-based profiling helps identify whether the transformed system would continue to meet the original real-time constraints, with a feedback loop suggesting how to modify the code, so its CPI can be isolated. Finally, an automated refactoring isolates the CPI portion for TEE-based execution, communicated with through generated calls to the TEE API. We have evaluated our approach by successfully enabling the trusted execution of the CPI portions of several microbenchmarks and a drone autopilot. Our approach shows the promise of declarative meta-programming in reducing the programmer effort required to adapt systems for trusted execution under real-time constraints.

关键词： trusted execution real-time systems declarative meta-programming software refactoring program analyses

来源：评论

学校读者我要写书评

暂无评论

Native-2-Native Automated Cross-Platform Code Synthesis from Web-Based programming Resources 2015

Native-2-Native Automated Cross-Platform Code Synthesis from...

引用

14th ACM SIGPLAN international conference on generative-programming - concepts and experiences (GPCE) co-located with SPLASH conference

作者： Byalik, Antuan Chadha, Sanchit Tilevich, Eli Virginia Tech Software Innovat Lab Blacksburg VA 24061 USA

ISBN: (纸本)9781450336871

For maximal market penetration, popular mobile applications are typically supported on all major platforms, including Android and iOS. Despite the vast differences in the look-and-feel of major mobile platforms, applications running on these platforms in essence provide the same core functionality. As an application is maintained and evolved, the resulting changes must be replicated on all the supported platforms, a tedious and error-prone programming process. Existing automated source-to-source translation tools prove inadequate due to the structural and idiomatic differences in how functionalities are expressed across major platforms. In this paper, we present a new approach-Native-2-Native-that automatically synthesizes code for a mobile application to make use of native resources on one platform, based on the equivalent program transformations performed on another platform. First, the programmer modifies a mobile application's Android version to make use of some native resource, with a plugin capturing code changes. Based on the changes, the system then parameterizes a web search query over popular programming resources (e.g., Google Code, StackOverflow, etc.), to discover equivalent iOS code blocks with the closest similarity to the programmer-written Android code. the discovered iOS code block is then presented to the programmer as an automatically synthesized Swift source file to further fine-tune and subsequently integrate in the mobile application's iOS version. Our evaluation, enhancing mobile applications to make use of common native resources, shows that the presented approach can correctly synthesize more than 86% of Swift code for the subject applications' iOS versions.

关键词： Recommendation Systems Code Synthesis Mobile Computing Android iOS Java Swift

来源：评论

学校读者我要写书评

暂无评论

Customizing host IDE for non-programming users of pure embedded DSLs: A case study

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2017年 49卷 101-118页

作者： Nosal, Milan Poruban, Jaroslav Sulir, Matus Svagant Mlynska 28 Kosice Slovakia Tech Univ Kosice Fac Elect Engn & Informat Dept Comp & Informat Letna 9 Kosice 04200 Slovakia

Pure embedding as an implementation strategy of domain-specific languages (DSLs) benefits from low implementation costs. On the other hand, it introduces undesired syntactic noise that impedes involvement of non-programming domain experts. Due to this, pure embedded DSLs are generally not intended for, nor used by, non-programmers. In this work, we try to challenge this state by experimenting with inexpensive customizations of the host IDE (Integrated Development Environment) to reduce the negative impact of syntactic noise. We present several techniques and recommendations based on standard IDE features (e.g., file templates, code folding, etc.) that aim to reduce syntactic noise and generally improve the user experience with pure embedded DSLs. the techniques are presented using a NetBeans IDE case study. the goal of the proposed techniques is to improve the user experience with pure embedded DSLs with a focus on the involvement of non-programming domain experts (or non-programmers in general). the proposed techniques were evaluated using a controlled experiment. the experiment compared a group using Ruby and non-modified RubyMine IDE versus a group using Java and NetBeans IDE customized to use the proposed techniques. Experiment results indicate that even inexpensive host IDE customizations can significantly alleviate issues caused by the syntactic noise: Java with its inflexible syntax performed better than Ruby with its concise syntax. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Domain-specific language Pure embedding Syntactic noise Controlled experiment

来源：评论

学校读者我要写书评

暂无评论

Automatic Locality-Friendly Interface Extension of Numerical Functions 2014

Automatic Locality-Friendly Interface Extension of Numerical...

引用

13th conference on generative programming - concepts and experiences (GPCE)

作者： Hess, Benjamin Gross, thomas R. Pueschel, Markus Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

ISBN: (纸本)9781450331616

Raising the level of abstraction is a key concern of software engineering, and libraries (either used directly or as a target of a program generation system) are a successful technique to raise programmer productivity and to improve software quality. Unfortunately successful libraries may contain functions that may not be general enough. For example, many numeric performance libraries contain functions that work on one-or higher-dimensional arrays. A problem arises if a program wants to invoke such a function on a non-contiguous subarray (e.g., in C the column of a matrix or a subarray of an image). If the library developer did not foresee this scenario, the client program must include explicit copy steps before and after the library function call, incurring a possibly high performance penalty. A better solution would be an enhanced library function that allows for the desired access pattern. Exposing the access pattern allows the compiler to optimize for the intended usage scenario(s). As we do not want the library developer to generate all interesting versions manually, we present a tool that takes a library function written in C and generates such a customized function for typical accesses. We describe the approach, discuss limitations, and report on the performance. As example access patterns we consider those most common in numerical applications: striding and block striding, general permutations, as well as scaling. We evaluate the tool on various library functions including filters, scans, reductions, sorting, FFTs, and linear algebra operations. the automatically generated custom version is in most cases significantly faster than using individual steps, offering speed-ups that are typically in the range of 1.2-1.8x.

关键词： Performance Design Libraries components performance interface extension preprocessors programming language features interaction software product lines

来源：评论

学校读者我要写书评

暂无评论

Considerations for the design of mini-games integrating hints for puzzle solving ICT-related concepts

Considerations for the design of mini-games integrating hint...

引用

12th IEEE international conference on Advanced Learning Technologies, ICALT 2012

作者： Melero, Javier Hernändez-Leo, Davinia Blat, Josep Department of Information and Communication Technologies Universitat Pompeu Fabra Barcelona Spain

ISBN: (纸本)9780769547022

Educational games have been proved to be learning environments that are more in correspondence with new generation of students since they can provide successful learning and motivate students in their learning process. In this line, several studies describe the main factors that games should have in order to design engaging learning experiences. Taking into account these factors, this paper presents the design of three different game-based learning environments providing hints for puzzle solving different tasks within the area of computer architecture, programming fundamentals, and computing networks. An evaluation carried out with secondary and higher education students provides further considerations regarding the design of hints, score, and supportive learning material that should be taken into account when creating such kind of games. © 2012 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Modular interpreters with implicit context propagation

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2017年 48卷 39-67页

作者： Inostroza, Pablo van der Storm, Tijs Ctr Wiskunde & Informat Amsterdam Netherlands

Modular interpreters are a crucial first step towards component-based language development: instead of writing language interpreters from scratch, they can be assembled from reusable, semantic building blocks. Unfortunately, traditional language interpreters can be hard to extend because different language constructs may require different interpreter signatures. For instance, arithmetic interpreters produce a value without any context information, whereas binding constructs require an additional environment. In this paper, we present a practical solution to this problem based on implicit context propagation. By structuring denotational-style interpreters as Object Algebras, base interpreters can be retroactively lifted into new interpreters that have an extended signature. the additional parameters are implicitly propagated behind the scenes, through the evaluation of the base interpreter. Interpreter lifting enables a flexible style of modular and extensible language development. the technique works in mainstream object-oriented languages, does not sacrifice type safety or separate compilation, and can be easily automated, for instance using macros in Scala or dynamic proxies in Java. We illustrate implicit context propagation using a modular definition of Featherweight Java and its extension to support side-effects, and an extensible domain-specific language for state machines. We finally investigate the performance overhead of lifting by running the DeltaBlue benchmark program in Javascript on top of a modular implementation of LambdaJS and a dedicated micro-benchmark. the results show that lifting makes interpreters roughly twice as slow because of additional call overhead. Further research is needed to eliminate this performance penalty. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： programming languages (Electronic computers) OBJECT-oriented programming (Computer science) DENOTATIONAL semantics WEB proxy servers JAVA (Computer program language)

来源：评论

学校读者我要写书评

暂无评论

Session details: programming languages 13

Session details: Programming languages

引用

Proceedings of the 12th international conference on generative programming: concepts & experiences

作者： Matthew Flatt University of Utah

No abstract available.

ISBN: (纸本)9781450323734

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the Bedrock Structured programming System Combining generative Metaprogramming and Hoare Logic in an Extensible Program Verifier 13

The Bedrock Structured Programming System Combining Generati...

引用

18th ACM SIGPLAN international conference on Functional programming

作者： Chlipala, Adam MIT CSAIL Cambridge MA USA

ISBN: (纸本)9781450323260

We report on the design and implementation of an extensible programming language and its intrinsic support for formal verification. Our language is targeted at low-level programming of infrastructure like operating systems and runtime systems. It is based on a cross-platform core combining characteristics of assembly languages and compiler intermediate languages. From this foundation, we take literally the saying that C is a "macro assembly language": we introduce an expressive notion of certified low-level macros, sufficient to build up the usual features of C and beyond as macros with no special support in the core. Furthermore, our macros have integrated support for strongest postcondition calculation and verification condition generation, so that we can provide a high-productivity formal verification environment within Coq for programs composed from any combination of macros. Our macro interface is expressive enough to support features that low-level programs usually only access through external tools with no formal guarantees, such as declarative parsing or SQL-inspired querying. the abstraction level of these macros only imposes a compile-time cost, via the execution of functional Coq programs that compute programs in our intermediate language;but the run-time cost is not substantially greater than for more conventional C code. We describe our experiences constructing a full C-like language stack using macros, with some experiments on the verifiability and performance of individual programs running on that stack.

关键词： generative metaprogramming interactive proof assistants low-level programming languages functional programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：