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

PPDP'05 - 7th acm sigplan conference on Principles and Practice of Declarative programming

作者： Luna, Daniel Pettersson, Mikael Sagonas, Konstantinos Department of Information Technology Uppsala University Sweden

ISBN: (纸本)1595930906

We describe and document our experience from developing an AMD64 backend for the HiPE (High Performance Erlang) native code compiler. We consider implementation alternatives and critically examine design choices for obtaining an efficient AMD64 backend. In particular, we consider in detail how other functional language implementors can migrate their existing x86 backends to the AMD64 architecture, a platform which is becoming increasingly important these days. We mention backend components that can be shared between x86 and AMD64, and those that better be different for achieving high performance on AMD64. Finally, we measure the performance of several different alternatives in the hope that this information can save development effort for others who intend to engage in a similar feat. Copyright 2005 acm.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Multiple instances and symbolic variables in executable sequence charts 02

Multiple instances and symbolic variables in executable sequ...

引用

17th Meeting on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2002)

作者： Marelly, R Harel, D Kugler, H Weizmann Inst Sci Dept Comp Sci & Appl Math IL-76100 Rehovot Israel

ISBN: (纸本)9781581134711

We extend live sequence charts (LSCs), a highly expressive variant of sequence diagrams, and provide the extension with an executable semantics. the extension involves support for instances that can bind to multiple objects and symbolic variables that can bind to arbitrary values. the result is a powerful executable language for expressing behavioral requirements on the level of inter-object interaction. the extension is implemented in full in our play-engine tool, with which one can execute the requirements directly without the need to build or synthesize an intra-object system model. It seems that in addition to many advantages in testing and requirements engineering, for some kinds of systems this could lead to the requirements actually serving as the final implementation.

关键词： design languages verification

来源：评论

学校读者我要写书评

暂无评论

Implicitly threaded parallelism in Manticore

引用

JOURNAL OF FUNCTIONAL programming 2010年第5-6期20卷 537-576页

作者： Fluet, Matthew Rainey, Mike Reppy, John Shaw, Adam Rochester Inst Technol Dept Comp Sci Rochester NY 14623 USA Univ Chicago Dept Comp Sci Chicago IL 60637 USA Toyota Technol Inst Chicago IL USA

the increasing availability of commodity multicore processors is making parallel computing ever more widespread. In order to exploit its potential, programmers need languages that make the benefits of parallelism accessible and understandable. Previous parallel languages have traditionally been intended for large-scale scientific computing, and they tend not to be well suited to programming the applications one typically finds on a desktop system. thus, we need new parallel-language designs that address a broader spectrum of applications. the Manticore project is our effort to address this need. At its core is Parallel ML, a high-level functional language for programming parallel applications on commodity multicore hardware. Parallel ML provides a diverse collection of parallel constructs for different granularities of work. In this paper, we focus on the implicitly threaded parallel constructs of the language, which support fine-grained parallelism. We concentrate on those elements that distinguish our design from related ones, namely, a novel parallel binding form, a nondeterministic parallel case form, and the treatment of exceptions in the presence of data parallelism. these features differentiate the present work from related work on functional data-parallel language designs, which have focused largely on parallel problems with regular structure and the compiler transformations-most notably, flattening-that make such designs feasible. We present detailed examples utilizing various mechanisms of the language and give a formal description of our implementation.

关键词： Multi-core processors Parallel Lines Synclitism data parallel thREADED parallelism Spectra applications language Parallel languages

来源：评论

学校读者我要写书评

暂无评论

Advanced Automata-Based Algorithms for Program Termination Checking 2018

Advanced Automata-Based Algorithms for Program Termination C...

引用

39th acm sigplan conference on programming language design and implementation (PLDI)

作者： Chen, Yu-Fang Heizmann, Matthias Lengal, Ondrej Li, Yong Tsai, Ming-Hsien Turrini, Andrea Zhang, Lijun Acad Sinica Taipei Taiwan Natl Taipei Univ New Taipei Taiwan Univ Freiburg Freiburg Germany Brno Univ Technol FIT IT4Innovat Ctr Excellence Brno Czech Republic Chinese Acad Sci Univ Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China

ISBN: (纸本)9781450356985

In 2014, Heizmann et al. proposed a novel framework for program termination analysis. the analysis starts with a termination proof of a sample path. the path is generalized to a Buchi automaton (BA) whose language (by construction) represents a set of terminating paths. All these paths can be safely removed from the program. the removal of paths is done using automata difference, implemented via BA complementation and intersection. the analysis constructs in this way a set of BAs that jointly "cover" the behavior of the program, thus proving its termination. An implementation of the approach in Ultimate Automizer won the 1st place in the Termination category of SV-Comp 2017. In this paper, we exploit advanced automata-based algorithms and propose several non-trivial improvements of the framework. To alleviate the complementation computation for BAs-one of the most expensive operations in the framework-, we propose a multi-stage generalization construction. We start with generalizations producing subclasses of BAs (such as deterministic BAs) for which efficient complementation algorithms are known, and proceed to more general classes only if necessary. Particularly, we focus on the quite expressive subclass of semideterministic BAs and provide an improved complementation algorithm for this class. Our experimental evaluation shows that the proposed approach significantly improves the power of termination checking within the Ultimate Automizer framework.

关键词： Program Termination Buchi Automata Complementation and language Difference

来源：评论

学校读者我要写书评

暂无评论

SOAP 2024 - Proceedings of the 13th acm sigplan International Workshop on the State Of the Art in Program Analysis, Co-located with: PLDI 2024

SOAP 2024 - Proceedings of the 13th ACM SIGPLAN Internationa...

引用

13th acm sigplan International Workshop on the State of the Art in Program Analysis, SOAP 2024, co-located with the 45th acm sigplan International conference on programming language design and implementation, PLDI 2024

ISBN: (纸本)9798400706219

the proceedings contain 8 papers. the topics discussed include: Dr Wenowdis: specializing dynamic language C extensions using type information;interleaving static analysis and LLM prompting;a better approximation for interleaved Dyck reachability;interactive source-to-source optimizations validated using static resource analysis;when to stop going down the rabbit hole: taming context-sensitivity on the fly;ValBench: benchmarking exact value analysis;static analysis for transitioning to CHERI C/C++;and Misconceptions about Loops in C.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pluggable verification modules: An extensible protection mechanism for the JVM

Pluggable verification modules: An extensible protection mec...

引用

19th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA'04

作者： Fong, Philip W. L. Department of Computer Science University of Regina Regina Sask. S4S 0A2 Canada

ISBN: (纸本)1581138318

through the design and implementation of a JVM that supports Pluggable Verification Modules (PVMs), the idea of an extensible protection mechanism is entertained. Link-time bytecode verification becomes a pluggable service that can be readily replaced, reconfigured and augmented. Application-specific verification services can be safely introduced into the dynamic linking process of the JVM. this feature is enabled by the adoption of a previously proposed modular verification architecture, Proof Linking [23, 24], which decouples bytecode verification from the dynamic linking process, rendering the verifier a replaceable module. the PVM mechanism has been implemented in an open source JVM, the Aegis VM [21]. To evaluate the software engineering and security engineering benefits of this extensible protection mechanism, an augmented type system JAC (Java Access Control) [37] has been successfully implemented as a PVM.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

An Approach to Software Process design and implementation Using Transition Rules

An Approach to Software Process Design and Implementation Us...

引用

Joint conference of 14th EUROMICRO Digital Systems design conference (DSD) / 37th EUROMICRO conference on Software Engineering and Advanced Applications (SEAA)

作者： Ferreira, Andre L. Machado, Ricardo J. Paulk, Mark C. Univ Minho Dept Sistemas Informacao Guimaraes Portugal Carnegie Mellon Univ Inst Software Res Pittsburgh PA 15213 USA

ISBN: (纸本)9780769544885

When software organizations adopt several best practices models into one single environment the number of activities and processes tends to increase. Managing effectively a large and complex system of processes requires process modeling capabilities at higher levels of abstraction. this paper presents a modeling approach for software process design and implementation to deal with the increasing size and complexity of large systems of processes. A model based on an extension of UML 2.0 Component Diagrams is used to develop a process architecture. A transition mechanism using Little-JIL process programming language is also proposed to support the refinement of a process architecture to a process implementation.

关键词： Software Process Modeling Software Process Architecture Multi-model Environemtns Little-JIL

来源：评论

学校读者我要写书评

暂无评论

Practical predicate dispatch 04

Practical predicate dispatch

引用

19th conference on Object-Oriented programming, Systems, languages, and Applications

作者： Millstein, T Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90024 USA

ISBN: (纸本)9781581138313

Predicate dispatch is an object-oriented (OO) language mechanism for determining the method implementation to be invoked upon a message send. With predicate dispatch, each method implementation includes a predicate guard specifying the conditions under which the method should be invoked, and logical implication of predicates determines the method overriding relation. Predicate dispatch naturally unifies and generalizes several common forms of dynamic dispatch, including traditional OO dispatch, multimethod dispatch, and functional-style pattern matching. Unfortunately, prior languages supporting predicate dispatch have had several deficiencies that limit its utility in practice. We introduce JPred, a backward-compatible extension to Java supporting predicate dispatch. While prior languages with predicate dispatch have been extensions to toy or non-mainstream languages, we show how predicate dispatch can be naturally added to a traditional OO language. While prior languages with predicate dispatch have required the whole program to be available for type-checking and compilation, JPred retains Java's modular type-checking and compilation strategies. While prior languages with predicate dispatch have included special-purpose algorithms for reasoning about predicates, JPred employs general-purpose, off-the-shelf decision procedures. As a result, JPred's type system is more flexible, allowing several useful programming idioms that are spuriously rejected by those other languages. After describing the JPred language and type system, we present a case study illustrating the utility of JPred in a real-world application, including its use in the detection of several errors.

关键词： design languages predicate dispatch dynamic dispatch modular typechecking

来源：评论

学校读者我要写书评

暂无评论

SOAP 2022 - Proceedings of the 11th acm sigplan International Workshop on the State Of the Art in Program Analysis, co-located with PLDI 2022

SOAP 2022 - Proceedings of the 11th ACM SIGPLAN Internationa...

引用

11th acm sigplan International Workshop on the State Of the Art in Program Analysis, SOAP 2022, co-located with the 43rd acm sigplan International conference on programming language design and implementation, PLDI 2022

ISBN: (纸本)9781450392747

the proceedings contain 7 papers. the topics discussed include: BinFPE: accurate floating-point exception detection for GPU applications;modeling code manipulation in JIT compilers;statically detecting data leakages in data science code;ensuring determinism in blockchain software with GoLiSA: an industrial experience report;ADA: a tool for visualizing the architectural overview of open-source repositories;abstract interpretation of Michelson smart-contracts;and towards an implementation of differential dynamic logic in PVS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CHIUW 2019 - Proceedings of the acm sigplan 6th Chapel Implementers and Users Workshop, co-located with PLDI 2019

CHIUW 2019 - Proceedings of the ACM SIGPLAN 6th Chapel Imple...

引用

acm sigplan 6th Annual Chapel Implementers and Users Workshop, CHIUW 2019, held in conjunction with PLDI 2019

ISBN: (纸本)9781450368001

the proceedings contain 8 papers. the topics discussed include: GPUIterator: bridging the gap between chapel and GPU platforms;calling chapel code: interoperability improvements;towards radix sorting in the chapel standard library;implementing stencil problems in chapel: an experience report;chapel unblocked: recent communication optimizations in chapel;Arkouda: Interactive data exploration backed by chapel;chapel graph library (CGL);and chapel in cray HPO.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：