New mechanisms for invocation handling in concurrent programming languages

被引:0
|
作者
Chung, M [1 ]
Olsson, RA [1 ]
机构
[1] Univ Calif Davis, Dept Comp Sci, Davis, CA 95616 USA
来源
COMPUTER LANGUAGES | 1998年 / 24卷 / 04期
基金
美国国家科学基金会;
关键词
concurrent programming languages; invocation handling; language design; language implementation;
D O I
10.1016/S0096-0551(98)00010-1
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:245 / 270
页数:26
相关论文
共 50 条
  • [21] DRFx: A Simple and Efficient Memory Model for Concurrent Programming Languages
    Marino, Daniel
    Singh, Abhayendra
    Millstein, Todd
    Musuvathi, Madanlal
    Narayanasamy, Satish
    ACM SIGPLAN NOTICES, 2010, 45 (06) : 351 - 362
  • [22] Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages
    Din, Crystal Chang
    Haehnle, Reiner
    Johnsen, Einar Broch
    Pun, Ka I.
    Tarifa, Silvia Lizeth Tapia
    AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, TABLEAUX 2017, 2017, 10501 : 22 - 43
  • [24] Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages
    Din, Crystal Chang
    Haehnle, Reiner
    Henrio, Ludovic
    Johnsen, Einar Broch
    Pun, Violet Ka I.
    Tarifa, S. Lizeth Tapia
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2024, 46 (01):
  • [26] Design of an empirical study for comparing the usability of concurrent programming languages
    ETH Zurich, Switzerland
    不详
    Int. Symp. Empir. Softw. Eng. Meas., (325-334):
  • [27] DRFx: A Simple and Efficient Memory Model for Concurrent Programming Languages
    Marino, Daniel
    Singh, Abhayendra
    Millstein, Todd
    Musuvathi, Madanlal
    Narayanasamy, Satish
    PLDI '10: PROCEEDINGS OF THE 2010 ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION, 2010, : 351 - 362
  • [28] Design of an Empirical Study for Comparing the Usability of Concurrent Programming Languages
    Nanz, Sebastian
    Torshizi, Faraz
    Pedroni, Michela
    Meyer, Bertrand
    2011 FIFTH INTERNATIONAL SYMPOSIUM ON EMPIRICAL SOFTWARE ENGINEERING AND MEASUREMENT (ESEM 2011), 2011, : 325 - 334
  • [29] CONCURRENT SYSTEMS, PROGRAMMING PRIMITIVES AND LANGUAGES - A COMPARATIVE-STUDY
    VAJDA, F
    MICROPROCESSING AND MICROPROGRAMMING, 1986, 18 (1-5): : 185 - 194
  • [30] Design of an empirical study for comparing the usability of concurrent programming languages
    Nanz, Sebastian
    Torshizi, Faraz
    Pedroni, Michela
    Meyer, Bertrand
    INFORMATION AND SOFTWARE TECHNOLOGY, 2013, 55 (07) : 1304 - 1315