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

programming language design for Event-Driven Service Composition

AUTOMATIKA 2010年第4期51卷 374-386页

作者： Srbljic, Sinisa Skvorc, Dejan Skrobo, Daniel Univ Zagreb Sch Elect Engn & Comp Zagreb 10000 Croatia Ericsson Nikola Tesla DD Zagreb 10002 Croatia

To adapt to rapidly changing market conditions and increase the return of investment, today's IT solutions usually combine service-oriented architecture (SOA) and event-driven architecture (EDA) that support reusability, flexibility, and responsiveness of business processes. programming languages for development of event-driven service compositions face several main challenges. First, a language should be based on standard service composition languages to be compatible with SOA-enabling technologies. Second, a language should enable seamless integration of services into event-driven workflows. Third, to overcome a knowledge divide, language should enable seamless cooperation between application developers with different skills and knowledge. Since WS-BPEL is widely accepted as standard executable language in SOA, we extended WS-BPEL with support for event-driven workflow coordination. We designed event-handling mechanisms as special-purpose Coopetition services and augmented WS-BPEL with primitives for their invocation. Coopetition services augment SOA with fundamental EDA characteristics: decoupled interactions, many-to-many communication, publish/subscribe messaging, event triggering, and asynchronous operations. To make the application development familiar to wide community of developers, we designed an application-level end-user language on top of WS-BPEL whose primitives for invocation of regular Web services and Coopetition services resemble the constructs of typical scripting and coordination language.

关键词： Service composition Service-oriented event-driven programming programming language design

来源：评论

学校读者我要写书评

暂无评论

USING THE programming WALKTHROUGH TO AID IN programming language design

引用

SOFTWARE-PRACTICE & EXPERIENCE 1994年第1期24卷 1-25页

作者： BELL, B CITRIN, W LEWIS, C RIEMAN, J WEAVER, R WILDE, N ZORN, B UNIV COLORADO DEPT COMP SCIBOULDERCO 80309 DREXEL UNIV PHILADELPHIAPA 19104

The programming walkthrough is a method for assessing how easy or hard it will be for users to write programs in a programming language. It is intended to enable language designers to identify problems early in design and to help them choose among alternative designs. We describe the method and present experience in applying it in four language design projects. Results indicate that the method is a useful supplement to existing design approaches.

关键词： programming WALKTHROUGH programming language design WRITABILITY design METHODS

来源：评论

学校读者我要写书评

暂无评论

PLIERS: A Process that Integrates User-Centered Methods into programming language design

引用

ACM TRANSACTIONS ON COMPUTER-HUMAN INTERACTION 2021年第4期28卷 1–53页

作者： Coblenz, Michael Kambhatla, Gauri Koronkevich, Paulette Wise, Jenna L. Barnaby, Celeste Sunshine, Joshua Aldrich, Jonathan Myers, Brad A. Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Maryland Dept Comp Sci 8125 Paint Branch Dr College Pk MD 20742 USA Univ Michigan Comp Sci Dept 500 S State St Ann Arbor MI 48109 USA Univ British Columbia Comp Sci Dept 2329 West Mall Vancouver BC V6T 1Z4 Canada Carnegie Mellon Univ Inst Software Res 5000 Forbes Ave Pittsburgh PA 15213 USA Facebook Inc 1 Hacker Way Menlo Pk CA 94025 USA Carnegie Mellon Univ Human Comp Interact Inst 5000 Forbes Ave Pittsburgh PA 15213 USA

programming language design requires making many usability-related design decisions. However, existing HCI methods can be impractical to apply to progranuning languages: languages have high iteration costs, programmers require significant learning time, and user performance has high variance. To address these problems, we adapted both formative and summative HCI methods to make them more suitable for programming language design. We integrated these methods into a new process, PLIERS, for designing programming languages in a user-centered way. We assessed PLIERS by using it to design two new programming languages. Glacier extends Java to enable programmers to express immutability properties effectively and easily. Obsidian is a language for blockchains that includes verification of critical safety properties. Empirical studies showed that the PLIERS process resulted in languages that could be used effectively by many programmers and revealed additional opportunities for language improvement.

关键词： Usability of programming languages programming language design

来源：评论

学校读者我要写书评

暂无评论

Interdisciplinary programming language design

Interdisciplinary Programming Language Design

引用

ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on programming and Software (Onward!)

作者： Coblenz, Michael Aldrich, Jonathan Myers, Brad A. Sunshine, Joshua Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781450360319

Approaches for programming language design used commonly in the research community today center around theoretical and performance-oriented evaluation. Recently, researchers have been considering more approaches to language design, including the use of quantitative and qualitative user studies that examine how different designs might affect programmers. In this paper, we argue for an interdisciplinary approach that incorporates many different methods in the creation and evaluation of programming languages. We argue that the addition of user-oriented design techniques can be helpful at many different stages in the programming language design process.

关键词： programming language design user-centered design programming language evaluation

来源：评论

学校读者我要写书评

暂无评论

Principles of Usable programming language design 17

Principles of Usable Programming Language Design

引用

IEEE/ACM 39th International Conference on Software Engineering Companion (ICSE-C)

作者： Coblenz, Michael Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781538615898

Tools for software engineers, such as programming languages and IDEs, should reflect the needs of their users. Unfortunately, designers of programming languages lack strong guidance regarding how to make these tools most effective for users. Though there is a well-developed theory of programming languages, there is little evidence regarding how to use this theory to build languages in which software engineers are most productive. I propose to develop methods for programming language design that fuse results from programming language theory with methods from human-computer interaction so that designers can create effective tools for users.

关键词： programming language design programmer tools usability of programming languages

来源：评论

学校读者我要写书评

暂无评论

''Who cares about elegance?'' The role of aesthetics in programming language design

引用

ACM SIGPLAN NOTICES 1997年第3期32卷 33-37页

作者： MacLennan, BJ Computer Science Department University of Tennessee Knoxville TN United States

The crucial role played by aesthetics in programming language design and the importance of elegance in programming languages are defended on the basis of analogies with structural engineering, as presented in Billingt... 详细信息

关键词： programming language design aesthetics elegance analysis feature interaction efficiency economy pedagogy

来源：评论

学校读者我要写书评

暂无评论

ON OPEN ARRAYS AND VARIABLE NUMBER OF PARAMETERS

引用

COMPUTER languageS 1992年第1期17卷 67-74页

作者： DECARVALHO, CSD KOWALTOWSKI, T Department of Computer Science University of Campinas Caixa Postal 6065 13081 Campinas SP Brazil

Two facilities for programming languages are described: open arrays (an extension of Pascal conformant arrays) and automatic parameter conversion, As a result of combining these two mechanisms, it is possible to give compile-time verifiable specification of procedures with a variable number of parameters and varying types. This ability is very useful in many applications, and in particular in specifying I/O procedures within a programming language itself.

关键词： programming language design OPEN ARRAYS AUTOMATIC PARAMETER CONVERSION VARIABLE NUMBER OF PARAMETERS

来源：评论

学校读者我要写书评

暂无评论

SafetyNet: A language-based approach to programmable networks

引用

COMPUTER NETWORKS 2001年第1期36卷 101-114页

作者： Wakeman, I Jeffrey, A Owen, T Pepper, D Univ Sussex Sch Cognit & Comp Sci Brighton BN1 9QH E Sussex England Depaul Univ Dept Comp Sci Chicago IL 60604 USA Climax Grp Brighton E Sussex England

It appears that some degree of programmability is inevitable within the network, whether it be through active networks, active services, or programmable middleware. We argue that programming network elements with languages designed for use within a single machine is inappropriate, since the only defense for the shared resource of the network is through the use of sandboxes? which are prone to performance problems and are difficult to implement correctly. Instead, we believe that new languages should be designed for programmable networks, using type systems that ensure safe programs, and encourage correct programs. We have designed and provided the full semantics for such a language, SafetyNet. Building upon this, we have implemented a compiler, run time environment and a simulation environment for our language. In this paper we describe the major features of the language that protect the network: abstracted locations;located objects;volatile routing;thread and class loading;and enforced resource counting. We show how these features are used in a number of small case studies, and in implementing optimised communication libraries. We describe the implications of the language design for the implementation of the run time support environment. The ease with which these demonstrations have been built and debugged shows the potential for enforcing network programming models with well-typed languages. (C) 2001 Elsevier Science B,V, All rights reserved.

关键词： active networks strongly typed languages programming language design

来源：评论

学校读者我要写书评

暂无评论

Modular pluggable analyses for data structure consistency

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2006年第12期32卷 988-1005页

作者： Kuncak, Viktor Lam, Patrick Zee, Karen Rinard, Martin C. MIT Comp Sci & Artificial Intelligence Lab Stata Ctr Cambridge MA 02139 USA

Hob is a program analysis system that enables the focused application of multiple analyses to different modules in the same program. In our approach, each module encapsulates one or more data structures and uses membership in abstract sets to characterize how objects participate in data structures. Each analysis verifies that the implementation of the module 1) preserves important internal data structure consistency properties and 2) correctly implements a set algebra interface that characterizes the effects of operations on the data structure. Collectively, the analyses use the set algebra to 1) characterize how objects participate in multiple data structures and to 2) enable the interanalysis communication required to verify properties that depend on multiple modules analyzed by different analyses. We implemented our system and deployed several pluggable analyses, including a flag analysis plug- in for modules in which abstract set membership is determined by a flag field in each object, a PALE shape analysis plug- in, and a theorem proving plug- in for analyzing arbitrarily complicated data structures. Our experience shows that our system can effectively 1) verify the consistency of data structures encapsulated within a single module and 2) combine analysis results from different analysis plug- ins to verify properties involving objects shared by multiple modules analyzed by different analyses.

关键词： typestate data structure invariant program analysis program verification shape analysis formal methods programming language design

来源：评论

学校读者我要写书评

暂无评论

Better verification through symmetry

引用

FORMAL METHODS IN SYSTEM design 1996年第1-2期9卷 41-75页

作者： Ip, CN Dill, DL STANFORD UNIV DEPT COMP SCISTANFORDCA 94305

A fundamental difficulty in automatic formal verification of finite-state systems is the slate explosion problem-even relatively simple systems can produce very large state spaces, causing great difficulties for methods that rely on explicit state enumeration. We address the problem by exploiting structural symmetries in the description of the system to be verified. We make symmetries easy to detect by introducing a new data type scalarset, a finite and unordered set, to our description language. The operations on scalarsets are restricted so that states are guaranteed to have the same future behaviors, up to permutation of the elements of the scalarsets. Using the symmetries implied by scalarsets, a verifier can automatically generate a reduced state space, on the fly. We provide a proof of the soundness of the new symmetry-based verification algorithm based on a definition of the formal semantics of a simple description language with scalarsets. The algorithm has been implemented and evaluated on several realistic high-level designs. Memory requirements were reduced by amounts ranging from 83% to over 99%, with speedups ranging from 65% to 98%. Symmetry-based reduction leads to an alternative characterization of data independence: a protocol is data-independent if there is a scalarset type not used as an array index or for loop index. In this case, symmetry-based reduction converts an infinite state space to a finite state space. Unlike other methods that exploit data-independence in verification, this reduction occurs completely automatically.

关键词： formal verification protocol verification hardware description language programming language design symmetry state reduction model checking cache coherence protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：