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

The guardian model and primitives for exception handling in distributed systems

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2004年第12期30卷 1008-1022页

作者： Miller, R Tripathi, A IBM Corp Rochester MN 55901 USA Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA

This paper presents an abstraction called guardian for exception handling in distributed and concurrent systems that use coordinated exception handling. This model addresses two fundamental problems with distributed exception handling in a group of asynchronous processes. The first is to perform recovery when multiple exceptions are concurrently signaled. The second is to determine the correct context in which a process should execute its exception handling actions. Several schemes have been proposed in the past to address these problems. These are based on structuring a distributed program as atomic actions based on conversations or transactions and resolving multiple concurrent exceptions into a single one. The guardian in a distributed program represents the abstraction of a global exception handler, which encapsulates rules for handling concurrent exceptions and directing each process to the semantically correct context for executing its recovery actions. Its programming primitives and the underlying distributed execution model are presented here. In contrast to the existing approaches, this model is more basic and can be used to implement or enhance the existing schemes. Using several examples we illustrate the capabilities of this model. Finally, its advantages and limitations are discussed in contrast to existing approaches.

关键词： concurrent programming distributed programming fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Session types for functional multithreading

Session types for functional multithreading

引用

15th International Conference on Concurrency Theory

作者： Vasconcelos, V Ravara, A Gay, S Univ Lisbon Fac Ciencias Dept Informat P-1749016 Lisbon Portugal Inst Super Tecn Dept Matemat P-1049001 Lisbon Portugal Univ Glasgow Dept Comp Sci Glasgow G12 8QQ Lanark Scotland

ISBN: (纸本)354022940X

We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, associated with a communication channel, specifies the state transitions of a protocol and also the data types of messages associated with transitions;thus typechecking can verify both correctness of individual messages and correctness of sequences of transitions. Previously session types have mainly been studied in the context of the pi-calculus;instead, our formulation is based on a multi-threaded functional language with side-effecting input/output operations. Our typing judgements statically describe dynamic changes in the types of channels, our channel types statically track aliasing, and our function types not only specify argument and result types but also describe changes in channels. We formalize the syntax, semantics and typing rules of our language, and prove subject reduction and runtime type safety theorems.

关键词： session types static typechecking concurrent programming specification of communication protocols

来源：评论

学校读者我要写书评

暂无评论

Correspondence Assertions for Process Synchronization in concurrent Communications

引用

Electronic Notes in Theoretical Computer Science 2004年 97卷 175-195页

作者： Eduardo Bonelli Adriana Compagnoni Elsa Gunter Stevens Institute of Technology and LIFIA Faculty of Informatics University of La Plata La Plata Argentina Stevens Institute of Technology USA New Jersey Institute of Technology USA

High-level specification of patterns of communications such as protocols can be modeled elegantly by means of session types [Honda, K., V. Vasconcelos and M. Kubo, Language primitives and type discipline for structured communication-based programming, in: Proc. of ESOP'98, LNCS (1998), pp. 122–138]. However, a number of examples suggest that session types fall short when finer precision on protocol specification is required. In order to increase the expressiveness of session types we appeal to the theory of correspondence assertions [Clarke, E. and W. Marrero, Using formal methods for analyzing security, Information Survivability Workshop (1998), Gordon, A. and A. Jeffrey, Typing correspondence assertions for communication protocols, in: Seventeenth Conference on the Mathematical Foundations of programming Semantics (MFPS 2001), number 45 in ENTCS (2001)]. The resulting type discipline augments the types of long term channels with effects and thus yields types which may depend on messages read or written earlier within the same session. We prove that evaluation preserves typability and that well-typed processes are safe. Also, we illustrate how the resulting theory allows us to address the shortcomings present in the pure theory of session types. Keywords: concurrent programming, pi-calculus, type systems, session types, correspondence assertions.

关键词： concurrent programming pi-calculus type systems session types correspondence assertions

来源：评论

学校读者我要写书评

暂无评论

The inheritance anomaly: ten years after 04

The inheritance anomaly: ten years after

引用

Proceedings of the 2004 ACM symposium on Applied computing

作者： Giuseppe Milicia Vladimiro Sassone Chi Spaces Technologies ltd. Cambridge UK University of Sussex UK

ISBN: (纸本)9781581138122

The term inheritance anomaly was coined in 1993 by Matsuoka and Yonezawa [15] to refer to the problems arising by the coexistence of inheritance and concurrency in concurrent object oriented languages (COOLs). The quirks arising by such combination have been observed since the early eighties, when the first experimental COOLs were designed [3]. In the nineties COOLs turned from research topic to widely used tools in the everyday programming practice, see e.g. the Java [9] experience. This expository paper extends the survey presented in [15] to account for new and widely used COOLs, most notably Java and C# [19]. Specifically, we illustrate some innovative approaches to COOL design relying on the aspect oriented programming paradigm [13] that aim at better, more powerful abstraction for concurrent OOP, and provide means to fight the inheritance anomaly.

关键词： inheritance anomaly concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: constraint-based synchronization and verification of concurrent programs 04

Brief Announcement: constraint-based synchronization and ver...

引用

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

作者： Rafael Ramirez Juanjo Martinez Pompeu Fabra University Barcelona Spain

This brief announcement outlines a new model for high-level concurrent and distributed programming based on constraint entailment, and how model-based verification methods can be directly applied to Java programs sync... 详细信息

ISBN: (纸本)9781581138023

关键词： concurrent programming constraints verification

来源：评论

学校读者我要写书评

暂无评论

Introducing concurrent functional programming in the telecommunications industry

引用

4th Working Conference on Diffusing Software Product and Process Innovations

作者： Däcker, B Ericsson Utvecklings AB Comp Sci Lab S-12525 Alvsjo Sweden

ISBN: (纸本)0792373316

This paper gives an overview of the concurrent functional programming language and its development, dissemination, and use. Erlang was developed at Ericsson and is used for several large and important telecom systems. It is also available externally, both supported and through open source. Erlang provides a highly relevant case-study of technology diffusion since its development touches upon many relevant topics such as applied research in the industrial environment and spread of technology through open source.

关键词： functional programming concurrent programming technology dissemination

来源：评论

学校读者我要写书评

暂无评论

Data-race and concurrent-write freedom are undecidable

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2003年第1-2期29卷 1-13页

作者： Campos, AE Suazo, DA Pontificia Univ Catolica Chile Dept Ciencia Computac Santiago 22 Chile

In a distributed shared memory system, sequential consistency is often assumed as the model for the memory, because it is a natural extension from multitasking in uniprocessor systems. Weaker consistency models allow greater concurrency, but programming is harder, because programs may produce unexpected results. Data-race-free (DRF) and concurrent-write-free (CWF) programs have the same set of possible executions both under a sequentially consistent memory and under some other, weaker model, memories. They can be written for a sequential memory and run unchanged under such a weaker-model memory. Since the sets of possible executions are the same, the run will only produce results that are possible under sequential consistency. This article proves the undecidability of both classes of concurrent programs in a language with if statements, loops, barriers, dynamic process creation, dynamic storage, and recursive data structures, under many models weaker than sequential consistency. Moreover, the article also proves that methods that only add synchronization statements to programs written for sequential consistency must produce some conservatively DRF or CWF programs. (C) 2003 Elsevier Ltd. All rights reserved.

关键词： concurrent programming distributed shared memory static analysis data-race-free programs concurrent-write-free programs undecidability

来源：评论

学校读者我要写书评

暂无评论

concurrent programming in VISO

引用

CONCURRENCY-PRACTICE AND EXPERIENCE 2000年第5期12卷 281-288页

作者： Al-Mulhem, MS King Fahd Univ Petr & Minerals Dept Informat & Comp Sci Dhahran 31261 Saudi Arabia

concurrent programming is more difficult to use and understand than sequential programming. In order to simplify this type of programming a number of approaches have been developed such as visual programming, Visual Occam (VISO) is a visual programming language for concurrent programming. It has a graphical syntax based on the language Occam and its semantics is represented both in petri net and process calculus. This paper presents a modular visual approach to write concurrent programs using the VISO language, concurrent programs in VISO are specified graphically at different levels of abstraction, This paper describes this modular visual approach by constructing two examples in VISO, The first example is a simple concurrent program and it is mainly used to show the details of constructing a concurrent program in VISO, The second example is a larger concurrent program with more levels of abstraction. Copyright . (C) 2000 John Wiley & Sons, Ltd.

关键词： concurrent programming Occam visual programming languages

来源：评论

学校读者我要写书评

暂无评论

Basic program structures for avoiding priority inversions 6

Basic program structures for avoiding priority inversions

引用

6th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing

作者： Kim, KH Univ Calif Irvine Irvine CA 92717 USA

ISBN: (纸本)0769519288

Structuring real-time concurrent programs in the form of groups of fixed-priority processes is an old art which is appropriate for only a small fraction of modem real-time distributed computing application systems. However, it is still practiced on the basis of an insufficient technical foundation. One of the basic issues in using the fixed-priority process structuring approach is to avoid the priority inversion phenomenon. It is argued that priority inversions are essentially due to the inappropriate approach used for structuring programs including the specification of the policy for allocating resources. Several basic program structuring techniques which are effective means of avoiding priority inversions are presented.

关键词： real time concurrent programming process scheduling priority inversion inheritance NBW NBAB monitor urgency deadline object TMO

来源：评论

学校读者我要写书评

暂无评论

concurrent programming in VISO

引用

Concurrency and Computation: Practice and Experience 2000年第5期12卷

作者： Muhammed S. Al-Mulhem Information and Computer Science Department King Fahd University of Petroleum and Minerals Dhahran Saudi Arabia

concurrent programming is more difficult to use and understand than sequential programming. In order to simplify this type of programming a number of approaches have been developed such as visual programming. Visual Occam (VISO) is a visual programming language for concurrent programming. It has a graphical syntax based on the language Occam and its semantics is represented both in petri net and process calculus. This paper presents a modular visual approach to write concurrent programs using the VISO language. concurrent programs in VISO are specified graphically at different levels of abstraction. This paper describes this modular visual approach by constructing two examples in VISO. The first example is a simple concurrent program and it is mainly used to show the details of constructing a concurrent program in VISO. The second example is a larger concurrent program with more levels of abstraction. Copyright © 2000 John Wiley & Sons, Ltd.

关键词： concurrent programming Occam visual programming languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：