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

IOTA: A Calculus for Internet of Things Automation

IOTA: A Calculus for Internet of Things Automation

acm sigplan International Symposium on New Ideas, New Paradigms, and Reflections on programming and Software (Onward) part of SPLASH conference

作者： Newcomb, Julie L. Chandra, Satish Jeannin, Jean-Baptiste Schlesinger, Cole Sridharan, Manu Univ Washington Paul G Allen Sch Comp Sci & Engn Seattle WA 98195 USA Samsung Res Amer Mountain View CA USA Facebook Menlo Pk CA USA Univ Michigan Ann Arbor MI 48109 USA Barefoot Networks Santa Clara CA USA Uber San Francisco CA USA

ISBN: (纸本)9781450355308

Programmatically controllable home devices are proliferating, ranging from lights, locks, and motion sensors to smart refrigerators, televisions, and cameras, giving end users unprecedented control over their environment. New domain-specific languages are emerging to supplant general purpose programming platforms as a means for end users to configure home automation. These languages, based on event-condition-action (ECA) rules, have an appealing simplicity. But programmatic control allows users write to programs with bugs, introducing the frustrations of software engineering with none of the tool support. The subtle semantics of the home automation domain-as well as the varying interfaces and implementation strategies that existing home automation platforms use-exacerbates the problem. In this work, we present the Internet of Things Automation (IOTA) calculus, the first calculus for the domain of home automation. Iota models an ECA language equipped with first-class notions of time, state, and device aggregation, and comes equipped with a precise semantics inspired by a careful analysis of five existing home automation platforms. We show that the IOTA calculus is useful by implementing two analyses from the software engineering literature, and expressive by encoding sixteen programs from these home automation platforms. Along the way, we highlight how the design of the IOTA semantics rules out subtle classes of bugs.

关键词： domain-specific languages language design and implementation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The undergraduate capstone software design experience

The undergraduate capstone software design experience

引用

1997 conference on TRI-Ada, TRI-Ada 1997

作者： Blair, Jean R. S. Ressler, Eugene K. Wagner, Thomas D. Department of Electrical Engineering and Computer Science United States Military Academy West PointNY10996 United States

ISBN: (纸本)0897919815

Ada 95 is being used as the implementation language for a senior level compiler design course at the United States Military Academy. This paper describes experiences and lessons learned as well as the scenario based approach for a large object oriented compiler project in that course. The term-long compiler project gives the students experience as a part of a (fictitious) design- implementation team building a production compiler. Ada 95 is compared to Pascal and C++ for the same course and positive and negative aspects of the three languages are described. © 1997 acm.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Modular type classes 07

Modular type classes

引用

34th acm sigplan-SIGACT Symposium on Principles of programming languages

作者： Dreyer, Derek Harper, Robert Chakravarty, Manuel M. T. Toyota Technol Inst Chicago IL USA Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ New S Wales Kensington NSW 2033 Australia

ISBN: (纸本)9781595935755

ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of data abstraction. Type classes emphasize implicit program construction and ad hoc polymorphism. In this paper, we show how the implicitly-typed style of type class programming may be supported within the framework of an explicitly-typed module language by viewing type classes as a particular mode of use of modules. This view offers a harmonious integration of modules and type classes, where type class features, such as class hierarchies and associated types, arise naturally as uses of existing module-language constructs, such as module hierarchies and type components. In addition, programmers have explicit control over which type class instances are available for use by type inference in a given scope. We formalize our approach as a Harper-Stone-style elaboration relation, and provide a sound type inference algorithm as a guide to implementation.

关键词： design languages theory type classes modules type inference type systems

来源：评论

学校读者我要写书评

暂无评论

Constrained Kinds 12

Constrained Kinds

引用

acm International conference on Object Oriented programming Systems languages and Applications

作者： Tardieu, Olivier Nystrom, Nathaniel Peshansky, Igor Saraswat, Vijay IBM Res Yorktown Hts NY USA Univ Lugano Lugano Switzerland Google Mountain View CA USA

ISBN: (纸本)9781450315616

Modern object-oriented languages such as X 1 0 require a rich framework for types capable of expressing both value-dependency and genericity, and supporting pluggable, domain-specific extensions. In earlier work, we presented a framework for constrained types in object-oriented languages, parametrized by an underlying constraint system. Types are viewed as formulas C {c} where C is the name of a class or an interface and c is a constraint on the immutable instance state (the properties) of C. Constraint systems are a very expressive framework for partial information. Many (value-) dependent type systems for object-oriented languages can be viewed as constrained types. This paper extends the constrained types approach to handle type-dependency ("genericity"). The key idea is to introduce constrained kinds: in the same way that constraints on values can be used to define constrained types, constraints on types can define constrained kinds. We develop a core programming language with constrained kinds. Generic types are supported by introducing type variables-literally, variables with "type" Type-and permitting programs to impose subtyping and equality constraints on such variables. We formalize the type-checking rules and establish soundness. While the language now intertwines constraints on types and values, its type system remains parametric in the choice of the value constraint system (language and solver). We demonstrate that constrained kinds are expressive and practical and sketch possible extensions with a discussion of the design and implementation of X10.

关键词： design languages Theory types generics constraints X10

来源：评论

学校读者我要写书评

暂无评论

A Compiler and Run-time System for Network programming languages 12

A Compiler and Run-time System for Network Programming Langu...

引用

39th Annual acm sigplan-SIGACT Symposium on Principles of programming languages

作者： Monsanto, Christopher Foster, Nate Harrison, Rob Walker, David Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450310833

Software-defined networks (SDNs) are a new kind of network architecture in which a controller machine manages a distributed collection of switches by instructing them to install or uninstall packet-forwarding rules and report traffic statistics. The recently formed Open Networking Consortium, whose members include Google, Facebook, Microsoft, Verizon, and others, hopes to use this architecture to transform the way that enterprise and data center networks are implemented. In this paper, we define a high-level, declarative language, called Net Core, for expressing packet-forwarding policies on SDNs. Net-Core is expressive, compositional, and has a formal semantics. To ensure that a majority of packets are processed efficiently on switches instead of on the controller we present new compilation algorithms for Net Core and couple them with a new run-time system that issues rule installation commands and traffic-statistics queries to switches. Together, the compiler and run-time system generate efficient rules whenever possible and outperform the simple, manual techniques commonly used to program SDNs today. In addition, the algorithms we develop are generic, assuming only that the packet-matching capabilities available on switches satisfy some basic algebraic laws. Overall, this paper delivers a new design for a high-level network programming language;an improved set of compiler algorithms;a new run-time system for SDN architectures;the first formal semantics and proofs of correctness in this domain;and an implementation and evaluation that demonstrates the performance benefits over traditional manual techniques.

关键词： Software-defined Networking OpenFlow Frenetic Network programming languages Domain specific languages

来源：评论

学校读者我要写书评

暂无评论

A different kind of programming languages course

A different kind of programming languages course

引用

OOPSLA 2009 Companion - 24th Annual acm conference on Object-Oriented programming, Systems, languages and Applications, OOPSLA 2009

作者： Yeager, Dorian P. Grove City College Grove City PA United States

ISBN: (纸本)9781605587660

The complexity of the well-explored regions of the programming language design space has increased substantially in the last twenty-five years with the addition of a large number of object-oriented programming languages (OOPLs). This design domain was already known to be large and complex before OOPLs came on the scene, and many offerings of the standard programming languages course before that time did not even mention the object-oriented programming (OOP) paradigm. Now that OOP has become mainstream, undergraduate programs which include a course on programming language design and implementation have responded by expanding their existing course or by jettisoning some of the alternative ideas in favor of expanded coverage of OOPLs. There are two facts, however, which must be confronted as we consider what information we would like to pass on to our students in this fascinating area of our discipline. The first is that the design space represented by OOPLs is large enough to justify a separate course, and the second is that a large number of ideas from other language paradigms appear in subsets of well-known languages for OOP. This paper presents a course in the design and implementation of programming languages that (as OOP itself did in the late eighties) turns some accepted notions "inside out" by proposing that the entire course be presented from the OOP point of view. Such a course has been offered by Grove City College for a decade and has matured into a very effective means of communicating essential programming language design and implementation ideas to our students. The course could be offered as the only advanced course in the area, as one course in a two-semester sequence, or as an alternative to the traditional course. Copyright © 2009 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Self

Self

引用

3rd acm sigplan History of programming languages conference, HOPL-III

作者： Ungar, David Smith, Randall B. IBM Corporation Sun Microsystems Laboratories

ISBN: (纸本)9781595937667

The years 1985 through 1995 saw the birth and development of the language Self, starting from its design by the authors at Xerox PARC, through first implementations by Ungar and his graduate students at Stanford University, and then with a larger team formed when the authors joined Sun Microsystems Laboratories in 1991. Self was designed to help programmers become more productive and creative by giving them a simple, pure, and powerful language, an implementation that combined ease of use with high performance, a user interface that off-loaded cognitive burden, and a programming environment that captured the malleability of a physical world of live objects. Accomplishing these goals required innovation in several areas: a simple yet powerful prototype-based object model for mainstream programming, many compilation techniques including customization, splitting, type prediction, polymorphic inline caches, adaptive optimization, and dynamic deoptimization, the application of cartoon animation to enhance the legibility of a dynamic graphical interface, an object-centered programming environment, and a user-interface construction framework that embodied a uniform use-mention distinction. Over the years, the project has published many papers and released four major versions of Self. Although the Self project ended in 1995, its implementation, animation, user interface toolkit architecture, and even its prototype object model impact computer science today (2006). Java virtual machines for desktop and laptop computers have adopted Self's implementation techniques, many user interfaces incorporate cartoon animation, several popular systems have adopted similar interface frameworks, and the prototype object model can be found in some of today's languages, including JavaScript. Nevertheless, the vision we tried to capture in the unified whole has yet to be achieved. © 2007 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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 heterogeneous multi-stage programming 05

Implicitly heterogeneous multi-stage programming

引用

4th International conference on Generative programming and Component Engineering

作者： Eckhardt, J Kaiabachev, R Pasalic, E Swadi, K Taha, W Rice Univ Houston TX 77005 USA

ISBN: (纸本)3540291385

Previous work on semantics-based multi-stage programming (MSP) language design focused on homogeneous designs, where the generating and the generated languages are the same. Homogeneous designs simply add a hygienic quasi-quotation and evaluation mechanism to a base language. An apparent disadvantage of this approach is that the programmer is bound to both the expressivity and performance characteristics of the base language. This paper proposes a practical means to avoid this by providing specialized translations from subsets of the base language to different target languages. This approach preserves the homogeneous "look" of multi-stage programs, and, more importantly, the static guarantees about the generated code. In addition, compared to an explicitly heterogeneous approach, it promotes reuse of generator source code and systematic exploration of the performance characteristics of the target languages. To illustrate the proposed approach, we design and implement a translation to a subset of C suitable for numerical computation, and show that it preserves static typing. The translation is implemented, and evaluated with several benchmarks. The implementation is available in the online distribution of MetaOCaml.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：