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

acm sigplan conference on programming language design and implementation

作者： Tayfun Elmas Jacob Burnim George Necula Koushik Sen Google Inc. Sift Science Inc. Department of Electrical Engineering and Computer Sciences University of California

ISBN: (纸本)9781450320146

We present CONCURRIT, a domain-specific language (DSL) for reproducing concurrency bugs. Given some partial information about the nature of a bug in an application, a programmer can write a CONCURRIT script to formally and concisely specify a set of thread schedules to explore in order to find a schedule exhibiting the bug. Further, the programmer can specify how these thread schedules should be searched to find a schedule that reproduces the bug. We implemented CONCURRIT as an embedded DSL in C++, which uses manual or automatic source instrumentation to partially control the scheduling of the software under test. Using CONCURRIT, we were able to write concise tests to reproduce concurrency bugs in a variety of benchmarks, including the Mozilla's SpiderMon-key JavaScript engine, Memcached, Apache's HTTP server, and MySQL.

关键词： Concurrency Errors Domain-Specific languages Software Testing

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 2011 International conference on Innovative Computing and Cloud Computing, ICCC'11

Proceedings of the 2011 International Conference on Innovati...

引用

2011 International conference on Innovative Computing and Cloud Computing, ICCC'11

ISBN: (纸本)9781450305679

The proceedings contain 30 papers. The topics discussed include: computational intelligence techniques for color clustering;language recognition with language total variability;cloud computing: programming model and information exchange mechanism;design of wireless transmission digital thermometer;the modeling and controlling of smart car motor based on laser sensor;the mechanism of copyright protection based on static software watermark;color-based image segmentation on UAV reconnaissance videos with Matlab;video based abnormal behavior detection;a dynamic user-integrated cloud computing architecture;study of chord model based on hybrid structure;clustering algorithm based on the combination of genetic algorithm and ant colony algorithm;research of the application of cloud computing theory in emergent material support;and the research and implementation of super-resolution reconstruction for multi-frame blurring images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reactive Imperative programming with Dataflow Constraints

引用

acm sigplan NOTICES 2011年第10期46卷 407-426页

作者： Demetrescu, Camil Finocchi, Irene Ribichini, Andrea Sapienza Univ Rome Dept Comp & Syst Sci Rome Italy Sapienza Univ Rome Dept Comp Sci Rome Italy

Dataflow languages provide natural support for specifying constraints between objects in dynamic applications, where programs need to react efficiently to changes of their environment. Researchers have long investigated how to take advantage of dataflow constraints by embedding them into procedural languages. Previous mixed imperative/dataflow systems, however, require syntactic extensions or libraries of ad hoc data types for binding the imperative program to the dataflow solver. In this paper we propose a novel approach that smoothly combines the two paradigms without placing undue burden on the programmer. In our framework, programmers can define ordinary statements of the imperative host language that enforce constraints between objects stored in special memory locations designated as "reactive". Differently from previous approaches, reactive objects can be of any legal type in the host language, including primitive data types, pointers, arrays, and structures. Statements defining constraints are automatically re-executed every time their input memory locations change, letting a program behave like a spreadsheet where the values of some variables depend upon the values of other variables. The constraint solving mechanism is handled transparently by altering the semantics of elementary operations of the host language for reading and modifying objects. We provide a formal semantics and describe a concrete embodiment of our technique into C/C++, showing how to implement it efficiently in conventional platforms using off-the-shelf compilers. We discuss common coding idioms and relevant applications to reactive scenarios, including incremental computation, observer design pattern, and data structure repair. The performance of our implementation is compared to ad hoc problem-specific change propagation algorithms, as well as to language-centric approaches such as self-adjusting computation and subject/observer communication mechanisms, showing that the proposed approa

关键词： Algorithms design experimentation languages Reactive programming dataflow programming imperative programming constraint solving incremental computation observer design pattern data structure repair

来源：评论

学校读者我要写书评

暂无评论

JavaScript module system: Exploring the design space 14

JavaScript module system: Exploring the design space

引用

13th International conference on Modularity, MODULARITY 2014 (Formerly AOSD)

作者： Cho, Junhee Ryu, Sukyoung KAIST Korea Republic of

ISBN: (纸本)9781450327725

While JavaScript is one of the most widely used programming languages not only for web applications but also for large projects, it does not provide a language-level module system. JavaScript developers have used the module pattern to avoid name conflicts by themselves, but the prevalent uses of multiple libraries and even multiple versions of a single library in one application complicate maintenance of namespace. The next release of the JavaScript language specification will support a module system, but the module proposal in prose does not clearly describe its semantics. Several tools attempt to support the new features in the next release of JavaScript by translating them into the current JavaScript, but their module semantics do not faithfully implement the proposal. In this paper, we identify some of the design issues in the JavaScript module system. We describe ambiguous or undefined semantics of the module system with concrete examples, show how the existing tools support them in a crude way, and discuss reasonable choices for the design issues. We specify the formal semantics of the module system, which provides unambiguous description of the design choices, and we provide its implementation as a source-to-source transformation from JavaScript with modules to the plain JavaScript that the current JavaScript engines can evaluate. Copyright © 2014 acm. Copyright © 2014 acm.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Automatic test generation algorithm for hardware description languages

Automatic test generation algorithm for hardware description...

引用

26th acm/IEEE design Automation conference, DAC 1989

作者： Norrod, Forrest E. Hewlett Packard Fort Collins CO USA

The E-algorithm, a method for generating tests for general logic circuits modeled using a hardware description language is presented. The proposed E-algorithm generates tests for control, operation, and data faults in sequential and combinational logic modeled at the functional level. A symbolic variable notation is introduced to permit systematic fault propagation through control structures. A fault model based on faulting structures in a graph derived from the hardware description language model, and a test generation algorithm that generates tests for the modeled faults have been developed and implemented. The E-algorithm has the ability to propagate fault syndromes through high-level control structures as well as data operations. Results of the implementation are given for a set of test cases, and the application of the algorithm to a semicustom ASIC (application-specific integrated circuit) is discussed. Preliminary results show high fault coverages and reasonable performance.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A Distributed OpenCL Framework using Redundant Computation and Data Replication

引用

acm sigplan NOTICES 2016年第6期51卷 553-569页

作者： Kim, Junghyun Jo, Gangwon Jung, Jaehoon Kim, Jungwon Lee, Jaejin Seoul Natl Univ Ctr Manycore Programming Dept Comp Sci & Engn Seoul 08826 South Korea

Applications written solely in OpenCL or CUDA cannot execute on a cluster as a whole. Most previous approaches that extend these programming models to clusters are based on a common idea: designating a centralized host node and coordinating the other nodes with the host for computation. However, the centralized host node is a serious performance bottleneck when the number of nodes is large. In this paper, we propose a scalable and distributed OpenCL framework called SnuCL-D for large-scale clusters. SnuCL-D's remote device virtualization provides an OpenCL application with an illusion that all compute devices in a cluster are confined in a single node. To reduce the amount of control-message and data communication between nodes, SnuCL-D replicates the OpenCL host program execution and data in each node. We also propose a new OpenCL host API function and a queueing optimization technique that significantly reduce the overhead incurred by the previous centralized approaches. To show the effectiveness of SnuCL-D, we evaluate SnuCL-D with a microbenchmark and eleven benchmark applications on a large-scale CPU cluster and a medium-scale GPU cluster.

关键词： OpenCL clusters heterogeneous computing programming models runtime systems redundant computation data replication

来源：评论

学校读者我要写书评

暂无评论

6th European conference on Object-Oriented programming, ECOOP 1992

引用

6th European conference on Object-Oriented programming, ECOOP 1992

ISBN: (纸本)9783540556688

The proceedings contain 23 papers. The special focus in this conference is on Object-Oriented programming. The topics include: On unifying relational and object-oriented database systems;import is not inheritance why we need both: modules and classes;object-oriented multi-methods in cecil;aggregation in a behavior oriented object model;reasoning and refinement in object-oriented specification languages;combining object-oriented and logic paradigms: a modal logic programming approach;an incremental class reorganization approach;system design by composing structures of interacting objects;unifying the design and implementation of user interfaces through the object paradigm;nesting actions through asynchronous message passing;inheritance of synchronization constraints in concurrent object-oriented programming languages;an eiffel environment to program distributed memory parallel computers;using object-oriented programming techniques for implementing ISDN supplementary services;an object model for engineering design;an object-oriented class library for scalable parallel heuristic search;integrating constraints with an object-oriented language;specifying reusable components using contracts;a type system for object-oriented programming based on abstract and concrete classes;making type inference practical;an object-oriented language-database integration model: the composition-filters approach;supporting physical independence in an object database server and developing a class hierarchy for object-oriented transaction processing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EXPLORER : Query- and Demand-Driven Exploration of Interprocedural Control Flow Properties

引用

acm sigplan NOTICES 2015年第10期50卷 520-534页

作者： Feng, Yu Wang, Xinyu Dillig, Isil Lin, Calvin Univ Texas Austin Austin TX 78712 USA

This paper describes a general framework-and its implementation in a tool called EXPLORER-for statically answering a class of interprocedural control flow queries about Java programs. EXPLORER allows users to formulate queries about feasible callstack configurations using regular expressions, and it employs a precise, demand-driven algorithm for answering such queries. Specifically, EXPLORER constructs an automaton A that is iteratively refined until either the language accepted by A is empty (meaning that the query has been refuted) or until no further refinement is possible based on a precise, context-sensitive abstraction of the program. We evaluate EXPLORER by applying it to three different program analysis tasks, namely, (1) analysis of the observer design pattern in Java, (2) identification of a class of performance bugs, and (3) analysis of inter-component communication in Android applications. Our evaluation shows that EXPLORER is both efficient and precise.

关键词： Algorithms languages Program analysis Demand-driven analysis points-to analysis query language control flow properties

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 9th Washington Ada Symposium on Ada: Empowering Software Users and Developers, WADAS 1992

Proceedings of the 9th Washington Ada Symposium on Ada: Empo...

引用

9th Washington Ada Symposium on Ada: Empowering Software Users and Developers, WADAS 1992

ISBN: (纸本)0897914872

The proceedings contain 26 papers. The topics discussed include: Ada and high performance computing - reality or myth?;the software development plan: a key to achieve SEI capability maturity model compliance;Ada and management information systems;reuse library interoperability: bringing the concept into reality;object oriented requirements analysis for a model Ada runtime system;application at statistical process control to the software process;developer-assisted automation for Ada design generation;techniques for semi-automated implementation of state-oriented, real-time formal specifications in Ada;software engineering environment framework evaluation method: three examples;a role for iterators as a tool for software reuse;information systems modeling: an object oriented development method;managing software technology for corporate information management;management of the design and implementation of a large-scale Ada CSC1 using an automated scheduling tool;use of the software capability evaluation in the FAA's microwave landing system procurement;object oriented requirements analysis vs. structured analysis as a front end for object oriented design;and an experiment with financial incentives for a small software development team.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Laws of concurrent programming 14

Laws of concurrent programming

引用

proceedings of the 35th acm sigplan conference on programming language design and implementation

作者： Tony Hoare Microsoft Research Cambridge United Kingdom

ISBN: (纸本)9781450327848

The talk extends the Laws of programming [1] by four laws governing concurrent composition of programs. This operator is associative and commutative and distributive through union; and it has the same unit (do nothing) as sequential composition. Furthermore, sequential and concurrent composition distribute through each other, in accordance with an exchange law; this permits an implementation of concurrency by partial interleaving.

关键词： separation logic CCS verification concurrency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：