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

Compositional programming and Testing of Dynamic Distributed Systems

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2018年第OOPSLA期2卷 1–30页

作者： Desai, Ankush Phanishayee, Amar Qadeer, Shaz Seshia, Sanjit A. Univ Calif Berkeley Berkeley CA 94720 USA Microsoft Res Redmond WA USA

A real-world distributed system is rarely implemented as a standalone monolithic system. Instead, it is composed of multiple independent interacting components that together ensure the desired system-level specification. One can scale systematic testing to large, industrial-scale implementations by decomposing the system-level testing problem into a collection of simpler component-level testing problems. This paper proposes techniques for compositional programming and testing of distributed systems with two central contributions: (1) We propose a module system based on the theory of compositional trace refinement for dynamic systems consisting of asynchronously-communicating state machines, where state machines can be dynamically created, and communication topology of the existing state machines can change at runtime; (2) We present Mod P, a programming system that implements our module system to enable compositional reasoning (assume-guarantee) of distributed systems. We demonstrate the efficacy of our framework by building two practical fault-tolerant distributed systems, a transaction-commit service and a replicated hash-table. Mod P helps implement these systems modularly and validate them via compositional testing. We empirically demonstrate that the abstraction-based compositional reasoning approach helps amplify the coverage during testing and scale it to real-world distributed systems. The distributed services built using Mod P achieve performance comparable to open-source equivalents.

关键词： domain-specific language distributed systems event-driven programming actors module system compositional verification systematic testing

来源：评论

学校读者我要写书评

暂无评论

Structured Synchronous Reactive programming for Game Development Case Study: On Rewriting Pingus from C plus plus to CEU 17

Structured Synchronous Reactive Programming for Game Develop...

引用

Joint Conference on 17th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames) / 31st Conference on Graphics, Patterns and Images (SIBGRAPI) / 20th Symposium on Virtual and Augmented Reality (SVR)

作者： Sant'Anna, Francisco Rio De Janeiro State Univ UERJ Dept Comp Sci Rio De Janeiro Brazil

ISBN: (纸本)9781538677698

We present a qualitative case study of rewriting the video game Pingus from C++ to the structured synchronous reactive language CEU. CEU supports reactive control-flow primitives that eliminate callbacks and let programmers write code in direct and sequential style. Structured reactivity helps describing complex control-flow relationships in the game logic more concisely. We show gains in productivity for four behaviors in Pingus through a qualitative analysis of the proposed implementations in CEU in comparison to the originals in C++. We also categorize the behaviors in recurrent control-flow patterns that likely apply to most games.

关键词： Control Flow event-driven programming Game Logic Synchronous Reactive programming

来源：评论

学校读者我要写书评

暂无评论

Towards Distributed Reactive programming

Towards Distributed Reactive Programming

引用

15th International Conference on Coordination Models and Languages (COORDINATION) Held as Part of the 8th International Federated Conference on Distributed Computing Techniques (DisCoTec)

作者： Salvaneschi, Guido Drechsler, Joscha Mezini, Mira Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9783642384936

Reactive applications is a wide class of software that responds to user input, network messages, and other events. Recent research on reactive languages successfully addresses the drawbacks of the Observer pattern - the traditional way reactive applications are implemented in the object-oriented setting - by introducing time-changing values and other ad-hoc programming abstractions. However, those approaches are limited to local settings, but most applications are distributed. We highlight the research challenges of distributed reactive programming and present a research roadmap. We argue that distributed reactive programming not only moves reactive languages to the distributed setting, but is a promising concept for middleware and distributed systems design.

关键词： Functional-reactive programming Scala event-driven programming

来源：评论

学校读者我要写书评

暂无评论

An event-driven framework for inter-user communication applications

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2006年第7期48卷 471-483页

作者： Hsu, Chien-Chih Wu, I. -Chen Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 300 Taiwan

This paper presents an event-driven framework for inter-user communication applications, such as Internet gaming or chatting, that require frequent communication among users. This paper addresses two major blocking problems for event-driven programming for inter-user communication applications, namely output blocking and request blocking. For the former, an output buffering mechanism is presented to solve this problem. For the latter, a service requesting mechanism with helper processes is presented to solve this problem. The above two mechanisms are incorporated into the framework presented in this paper to facilitate application development. In practice, this framework has been applied to online game development. (C) 2005 Elsevier B.V. All rights reserved.

关键词： inter-user communication applications event-driven programming concurrent programming framework threads

来源：评论

学校读者我要写书评

暂无评论

Cooperative decoupled processes

引用

SOFTWARE QUALITY JOURNAL 2018年第3期26卷 1147-1183页

作者： Bejleri, Andi Mezini, Mira Eugster, Patrick Domnori, Elton Tech Univ Darmstadt Hsch Str 10 D-64289 Darmstadt Germany Epoka Univ Rr Tirane Rinas Km12 Tirana 1039 Albania

event-driven programming has become a major paradigm in developing concurrent, distributed systems. Its benefits are often informally captured by the key tenet of "decoupling," a notion which roughly captures the ability of processes to join and leave (or fail) applications dynamically, and to be developed by independent parties. programming models for event-driven programming either make it hard to globally reason about control flow, thus hampering sound execution, or sacrifice decoupling to aid in reasoning about control flow. This work fills the gap by introducing a programming model-dubbed cooperative decoupled processes-that achieves both decoupling and global reasoning about control flow. We introduce this programming model through an event calculus, loosely inspired by the Join calculus, that enables reasoning about cooperative decoupled processes through the concepts of pre- and postconditions. A linear type system controls aliasing of events to avoid a break of control flow and thus safe exchange of shared events. Fundamental properties of the type system such as subject reduction, migration safety, and progress are established.

关键词： event-driven programming Decoupling Control flow Aliasing Linear type system

来源：评论

学校读者我要写书评

暂无评论

Learning How to Listen: Automatically Finding Bug Patterns in event-driven JavaScript APIs

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2023年第1期49卷 166-184页

作者： Arteca, Ellen Schafer, Max Tip, Frank Northeastern Univ Khoury Coll Comp Sci Boston MA 02115 USA GitHub Oxford OX1 4EH England

event-driven programming is widely practiced in the JavaScript community, both on the client side to handle UI events and AJAX requests, and on the server side to accommodate long-running operations such as file or network I/O. Many popular event-based APIs allow event names to be specified as free-form strings without any validation, potentially leading to lost events for which no listener has been registered and dead listeners for events that are never emitted. In previous work, Madsen et al. presented a precise static analysis for detecting such problems, but their analysis does not scale because it may require a number of contexts that is exponential in the size of the program. Concentrating on the problem of detecting dead listeners, we present an approach to learn how to use event-based APIs by first mining a large corpus of JavaScript code using a simple static analysis to identify code snippets that register an event listener, and then applying statistical modeling to identify anomalous patterns, which often indicate incorrect API usage. In a large-scale evaluation on 127,531 open-source JavaScript code bases, our technique was able to detect 75 anomalous listener-registration patterns, while maintaining a precision of 90.9% and recall of 7.5% over a validation set, demonstrating that a learning-based approach to detecting event-handling bug patterns is feasible. In an additional experiment, we investigated instances of these patterns in 25 open-source projects, and reported 30 issues to the project maintainers, of which 7 have been confirmed as bugs.

关键词： Static analysis Libraries JavaScript event-driven programming bug finding API modeling

来源：评论

学校读者我要写书评

暂无评论

CONTROLLED EXPERIMENT FOR ASSESSING THE CONTRIBUTION OF ONTOLOGY BASED SOFTWARE REDOCUMENTATION APPROACH TO SUPPORT PROGRAM UNDERSTANDING

引用

COMPUTING AND INFORMATICS 2021年第5期40卷 1025-1055页

作者： Nallusamy, Sugumaran Hoo, Meei Hao Zulkifle, Farizuwana Akma Univ Tunku Abdul Rahman Sungai Long CampusJalan Sungai Long Kajang 43000 Selangor Malaysia Univ Teknol MARA Kuala Pilah Campus Kuala Pilah 72000 Negeri Sembilan Malaysia

Redocumentation is an approach that is used to recover knowledge from raw software artifacts by using alternative presentations. Several legacy systems have been developed based on event-driven programming which require redocumentation. However, these existing repository and query techniques emphasize only on lexical and syntactical based queries which come with limitations in providing the semantic relationship for program understanding. We are using ontology based approach that uses both ontology reasoning and querying techniques to generate software documentation from the knowledge repository. We present a controlled experiment for the empirical evaluation on the proposed ontology based approach and implemented in a tool called Ontology Based Software Redocumentation (OBSR). In this experiment, two existing tools namely Universal Report (UR) and Microsoft Visual Studio specifically for Visual Basic (VB) programming environment have been selected to be compared with the OBSR tool. The goal is to provide experimental evidence of the viability of our approach in the context of program understanding using HTML based semantic software documentation. The experiment shows that the software maintainers are able to understand and provide significant improvement in program understanding to accomplish the maintenance task easily. We describe in detail the experiment performed, discuss its results and reflect the lesson learned from the experiment.

关键词： Software documentation ontology reverse engineering software maintenance event-driven programming program understanding

来源：评论

学校读者我要写书评

暂无评论

Relaxed Effective Callback Freedom: A Parametric Correctness Condition for Sequential Modules With Callbacks

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2023年第3期20卷 2256-2273页

作者： Albert, Elvira Grossman, Shelly Rinetzky, Noam Rodriguez-Nunez, Clara Rubio, Albert Sagiv, Mooly Univ Complutense Madrid Madrid 28040 Spain Tel Aviv Univ IL-69978 Ramat Aviv Israel

Callbacks are an essential mechanism for event-driven programming. Unfortunately, callbacks make reasoning challenging because they introduce behaviors where calls to the module are interleaved. We present a parametric method that, from a particular invariant of the program, allows reducing the problem of verifying the invariant in the presence of callbacks, to the callback-free setting. Intuitively, we allow callbacks to introduce behaviors that cannot be produced by callback free executions, as long as they do not affect correctness. A chief insight is that the user is aware of the potential effect of the callbacks on the program state. To this end, we present a parametric verification technique which accepts this insight as a relation between callback and callback free executions. We implemented our approach and applied it successfully to a large set of real-world programs.

关键词： Contracts Cognition Codes programming Static analysis Smart contracts Safety Smart contract verification event-driven programming Unbounded re-entrancy Callbacks

来源：评论

学校读者我要写书评

暂无评论

Simplifying CPS Application Development through Fine-grained, Automatic Timeout Predictions

引用

ACM TRANSACTIONS ON INTERNET OF THINGS 2020年第3期1卷 1–30页

作者： Peros, Stefanos Delbruel, Stephane Michiels, Sam Joosen, Wouter Hughes, Danny Katholieke Univ Leuven IMEC DistriNet Vlaams BrabantCelestijnenlaan 200A B-3001 Leuven Belgium

Application development for Cyber Physical Systems (CPS) is challenging, because the wireless network and the devices introduce latencies that vary continuously along with the load, status, or environmental conditions of the infrastructure. Reactive programming is well suited for the development of event-driven applications, yet current reactive programming frameworks require developers to predict event arrival timeboundaries at compile time, which is impractical, if not impossible, for CPS. Thus, there is a tradeoff between timeliness and completeness of complex event computations, e.g., operational efficiency in a manufacturing plant: Waiting too long until all individual events arrive can fail to produce a useful result, while not waiting long enough may lead to faults due to incomplete status information. In this article, we propose (a) a set of extensions to state-of-the-art reactive programming frameworks, which remove the burden of specifying timeouts at compile time by utilizing (b) Khronos, a middleware that automatically determines timeouts by taking into account variations in event arrival times due to the underlying infrastructure. Evaluation on a physical testbed shows that the extensions significantly decrease developer effort and that Khronos considerably improves timeliness under varying network configurations and conditions, while still satisfying the application's tolerance to missed events.

关键词： Cyber-physical systems late arrivals middleware time management event-driven programming reactive programming

来源：评论

学校读者我要写书评

暂无评论

A universal fast graphical user interface building tool for arbitrary interpreters

引用

JOURNAL OF VISUAL LANGUAGES AND COMPUTING 2005年第3期16卷 231-244页

作者： Pere, L Koniorczyk, M Slovak Acad Sci Res Ctr Quantum Informat Bratislava 84511 Slovakia Univ Pecs Fac Sci Ctr Comp Sci H-7624 Pecs Hungary Univ Pecs Fac Sci Dept Informat & Gen Technol H-7624 Pecs Hungary Hungarian Acad Sci Comp & Automat Res Inst MTA SZTAKI H-1051 Budapest Hungary

We consider the issue of implementing graphical user interfaces (GUIs): we present an easy-to-use and fast GUI building tool, specially designed to be used with interpreters. It supports a variety of communication methods and interaction models, therefore being able to collaborate with a huge diversity of interpreters in a natural way, in POSIX compliant (or similar) environment. Thus it enables the programmer to easily create a GUI, no matter what kind of language or model the actual interpreter implements. event-driven programs in UNIX shells and graphical user interfaces in a data oriented language are presented as example applications. (c) 2004 Elsevier Ltd. All rights reserved.

关键词： user interface GUI interpreters shells event-driven programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：