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

Locally Abstract, Globally Concrete Semantics of concurrent programming languages

ACM TRANSACTIONS ON programming languages AND SYSTEMS 2024年第1期46卷 1-58页

作者： Din, Crystal Chang Haehnle, Reiner Henrio, Ludovic Johnsen, Einar Broch Pun, Violet Ka I. Tarifa, S. Lizeth Tapia Univ Bergen Dept Informat Thormohlens Gate 55 N-5006 Bergen Norway Tech Univ Darmstadt Dept Comp Sci Hochschul Str 10 D-64289 Darmstadt Germany Univ Lyon CNRS LIP Lab EnsLInriaUCBL 46 Allee Italie F-69364 Lyon France Univ Oslo Dept Informat Postboks 1080 Blindern N-0316 Oslo Norway Western Norway Univ Appl Sci Inndalsveien 28 N-5063 Bergen Norway

Formal, mathematically rigorous programming language semantics are the essential prerequisite for the design of logics and calculi that permit automated reasoning about concurrent programs. We propose a novel modular semantics designed to align smoothly with program logics used in deductive verification and formal specification of concurrent programs. Our semantics separates local evaluation of expressions and statements performed in an abstract, symbolic environment from their composition into global computations, at which point they are concretised. This makes incremental addition of new language concepts possible, without the need to revise the framework. The basis is a generalisation of the notion of a program trace as a sequence of evolving states that we enrich with event descriptors and trailing continuation markers. This allows to postpone scheduling constraints from the level of local evaluation to the global composition stage, where well-formedness predicates over the event structure declaratively characterise a wide range of concurrency models. We also illustrate how a sound program logic and calculus can be defined for this semantics.

关键词： Denotational semantics trace semantics compositionality continuations concurrent programming languages program logics program calculus

来源：评论

学校读者我要写书评

暂无评论

New mechanisms for invocation handling in concurrent programming languages

引用

COMPUTER languages 1998年第4期24卷 245-270页

作者： Chung, M Olsson, RA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

Invocation handling mechanism in many concurrent languages have significant limitations that make it difficult or costly to solve common programming situations encountered in program visualization, debugging, and scheduling scenarios. This paper discusses these limitations, introduces new language mechanisms aimed at remedying these limitations, and presents an implementation of the new mechanisms. The examples are given in SR;the new mechanisms and implementation are an extension of SR and its implementation. However, these new mechanisms are applicable to other concurrent languages. They can augment or replace current invocation handling mechanisms. (C) 1999 Elsevier Science Ltd. All rights reserved.

关键词： concurrent programming languages invocation handling language design language implementation

来源：评论

学校读者我要写书评

暂无评论

INTER-ENTRY SELECTION - NONDETERMINISM AND EXPLICIT CONTROL MECHANISMS

引用

COMPUTER languages 1992年第4期17卷 269-282页

作者： OLSSON, RA MCNAMEE, CM Department of Computer Science University of California Davis CA 95616 U.S.A.

Many concurrent programming languages provide selection statements, which allow a task to select one of several entries to service. The choice as to which entry will be selected, if more than one has pending invocations, is generally defined to be non-deterministic. However, such non-deterministic inter-entry selection can result in undesirable program behavior. This paper examines the problems arising from such behavior and the existing approaches to remedy those problems. It indicates the inherent shortcomings of these approaches and purposes a new, more expressive extension of these approaches that remedies these shortcomings. This paper also considers how the different approaches can be implemented.

关键词： concurrent programming languages concurrent programming SYNCHRONIZATION NONDETERMINISM RENDEZVOUS PREFERENCE CONTROL

来源：评论

学校读者我要写书评

暂无评论

USING SR FOR DISCRETE EVENT SIMULATION - A STUDY IN concurrent programming

引用

SOFTWARE-PRACTICE & EXPERIENCE 1990年第12期20卷 1187-1208页

作者： OLSSON, RA Division of Computer Science University of California Davis CA 95616 U.S.A.

AbstractThis paper demonstrates the use of the SR concurrent programming language for discrete event simulation. SR provides a rich collection of synchronization mechanisms, whose use can lead to programs that are simpler and more efficient than those constrained to employ only one synchronization mechanism. Several SR solutions to a simulation problem are presented and contrasted with an Ada solution to the same problem. The paper also introduces a technique that exploits asynchronous message passing to program concise solutions to several problems involving lists. In the context of the simulation problem, this technique is used to manage the event list and the list of blocked processes. The technique can also be applied to several other concurrent programming problems. The results of this paper should be of interest both to programmers using concurrent programming languages and to language designers.

关键词： concurrent programming concurrent programming languages Synchronization mechanisms Asynchronous message passing Rendezvous Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Compiler to interpreter: experiences with a distributed programming language

引用

SOFTWARE-PRACTICE & EXPERIENCE 2001年第9期31卷 893-909页

作者： Gebala, RM McNamee, CM Olsson, RA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Calif State Univ Sacramento Dept Comp Sci Sacramento CA 95819 USA

One interpretive approach for handling concurrency is to provide an interpreter instance for each executing language-level process. Such an approach has mainly been applied to concurrent implementations of logic and functional languages. This paper describes the use of this approach in constructing an interpreter for an imperative, distributed programming language from an existing compiler and run-time support system (RTS), Primary design goals were to exploit the existing compiler to the extent possible as well as to have minimal impact on the RTS used to support concurrency. We have been successful in meeting these goals. Additionally, performance results show our interpreter's execution times compare favorably to the times required for compilation, linkage, and execution of small programs or programs with a significant number of calls to the RTS;on such programs, our interpreter's performance also compares favorably to that of the standard Java implementation. However, for larger programs and programs with fewer calls to the underlying RTS, the conventional compiler-based implementation outperforms the interpreter implementation. For many distributed programs in which network costs dominate, the performances of the two implementations differ little. Copyright (C) 2001 John Wiley & Sons, Ltd.

关键词： interpreters concurrent programming languages concurrent programming language implementation process communication and synchronization

来源：评论

学校读者我要写书评

暂无评论

DesCaRTeS: a run-time system with SR-like functionality for programming a network of embedded systems

引用

COMPUTER languages SYSTEMS & STRUCTURES 2003年第4期29卷 75-100页

作者： Maris, JT Roper, MD Olsson, RA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

This paper describes a run-time system (DesCaRTeS) that has been used for developing applications that run on a network of embedded system controllers. DesCaRTeS is written in Dynamic C and provides Dynamic C programs with easy-to-use functionality to run on such networks, send and receive messages, perform remote procedure calls, and dynamically create processes. This paper reports on some of the applications for which DesCaRTeS has been used, the experience in developing them using DesCaRTeS, and the experience gained in developing DesCaRTeS. It also presents performance comparisons between these applications written using DesCaRTeS and equivalent applications written using native Dynamic C. (C) 2003 Elsevier Ltd. All rights reserved.

关键词： concurrent programming models concurrent programming languages co-operative multithreading embedded systems run-time systems

来源：评论

学校读者我要写书评

暂无评论

Fairness in shared invocation servicing

引用

COMPUTER languages SYSTEMS & STRUCTURES 2002年第4期28卷 327-351页

作者： Olsson, RA Benson, GD Ge, TJ Keen, AW Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Univ San Francisco Dept Comp Sci San Francisco CA 94117 USA Calif Polytech State Univ San Luis Obispo Dept Comp Sci San Luis Obispo CA 93407 USA

Invocation servicing is an important aspect of many concurrent programming languages. Some invocation handling mechanisms allow for multiway servicing by multiple processes. This paper addresses fairness with respect to choosing which invocation to service and fairness with respect to choosing which process to perform the servicing. It examines how these fairness issues have been resolved in the SR concurrent programming language. This paper presents a new approach that eliminates several key restrictions. The new approach has been implemented in JR, an extended Java that includes SR-like synchronization mechanisms. This paper discusses design and implementation issues and tradeoffs. (C) 2003 Elsevier Science Ltd. All rights reserved.

关键词： concurrent programming languages invocation servicing invocation handling fairness language design language implementation

来源：评论

学校读者我要写书评

暂无评论

ON THE DETECTION OF COMMUNICATION-RELATED ERRORS IN concurrent PROGRAMS

引用

PARALLEL COMPUTING 1992年第12期18卷 1381-1392页

作者： ARVIND, DK Computer Science Department Edinburgh University Edinburgh EH9 3JZ UK

PMD is a framework for the detection of communication-related errors in concurrent programs using post-mortem analysis. It employed a static analysis of the source code to build a model of the program, which is dynamically enhanced with crucial run-time information from a dedicated hardware monitor. The notion of Region of Channel Usage (RCU) is introduced for detecting these errors efficiently. PMD is sufficiently general-purpose to handle a variety of concurrent programming languages. such as Occam2 and Joyce.

关键词： POSTMORTEM ANALYSIS concurrent programming languages HARDWARE MONITORING

来源：评论

学校读者我要写书评

暂无评论

Strong types for coordinating active objects

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2001年第4期13卷 293-326页

作者： Puntigam, F Vienna Univ Technol Inst Comp Sprachen A-1040 Vienna Austria

An object type is usually regarded as a contract between an object and each of its clients. However, in concurrent (and sometimes also in sequential) systems it is more useful to regard a type as a contract between an object and the set of all clients: when the object acts as a shared resource, the clients must be coordinated before sending messages to the object. Process types of active objects specify constraints on the ordering of messages. Static type checking ensures proper coordination of clients so that objects receive messages only in acceptable orderings. As presented in this article, the process type system is based on a simple computation model where active objects communicate via asynchronous message passing. Copyright (C) 2001 John Wiley & Sons, Ltd.

关键词： type systems concurrent programming languages active objects

来源：评论

学校读者我要写书评

暂无评论

AN ATTRIBUTE GRAMMAR APPROACH TO COMPILER OPTIMIZATION OF INTRAMODULE INTERPROCESS COMMUNICATION

引用

INTERNATIONAL JOURNAL OF PARALLEL programming 1991年第3期20卷 181-202页

作者： MCNAMEE, CM OLSSON, RA CALIF STATE UNIV SACRAMENTO DEPT COMP SCISACRAMENTOCA 95819 UNIV CALIF DAVIS DEPT COMP SCIDAVISCA 95616

Earlier work has shown the effectiveness of hand-applied program transformations optimizing high-level interprocess communication mechanisms. This paper describes the static analysis techniques necessary to ensure correct compiler application of the optimizing transformations. These techniques include both dataflow analysis and interprocess analysis. This paper focuses on the analysis of communication mechanisms within program modules;however, the analysis techniques can be generalized to handle inter-module optimization analysis as well. The major contributions of this paper include the application of dataflow analysis and the extension of interprocedural analysis-interprocess analysis-to real concurrent programming languages and, more specifically, to the optimization of interprocess communication and synchronization mechanisms that use both static and dynamic channels. In addition, the use of attribute grammars to perform interprocess analysis is significant. This paper also describes an implementation of both intra-process dataflow and interprocess analysis techniques using attribute grammars.

关键词： COMPILER OPTIMIZATION concurrent programming languages INTERPROCESS COMMUNICATION MECHANISMS STATIC ANALYSIS ATTRIBUTE GRAMMARS DATA-FLOW ANALYSIS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：