Design of an Empirical Study for Comparing the Usability of Concurrent Programming Languages

被引:10
|
作者
Nanz, Sebastian [1 ]
Torshizi, Faraz [2 ]
Pedroni, Michela [1 ]
Meyer, Bertrand [1 ]
机构
[1] Swiss Fed Inst Technol, Zurich, Switzerland
[2] Univ Toronto, Toronto, ON, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
empirical study; concurrency; programming languages; usability;
D O I
10.1109/ESEM.2011.41
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The recent turn towards multicore processing architectures has made concurrency an important part of mainstream software development. As a result, an increasing number of developers have to learn to write concurrent programs, a task that is known to be hard even for the expert. Language designers are therefore working on languages that promise to make concurrent programming "easier". However, the claim that a new language is more usable than another cannot be supported by purely theoretical considerations, but calls for empirical studies. In this paper, we present the design of a study to compare concurrent programming languages with respect to comprehending and debugging existing programs and writing correct new programs. A critical challenge for such a study is avoiding the bias that might be introduced during the training phase and when interpreting participants' solutions. We address these issues by the use of self-study material and an evaluation scheme that exposes any subjective decisions of the corrector, or eliminates them altogether. We apply our design to a comparison of two object-oriented languages for concurrency, multithreaded Java and SCOOP ( Simple Concurrent Object-Oriented Programming), in an academic setting. We obtain results in favor of SCOOP even though the study participants had previous training in writing multithreaded Java programs.
引用
收藏
页码:325 / 334
页数:10
相关论文
共 50 条
  • [42] 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
  • [43] Programming Languages for the Future of Design Computation
    Aish, Robert
    Al Fisher
    Orchard, Dominic
    Torry, Jay
    PROCEEDINGS OF THE 2024 ACM SIGPLAN INTERNATIONAL SYMPOSIUM ON NEW IDEAS, NEW PARADIGMS, AND REFLECTIONS ON PROGRAMMING AND SOFTWARE, ONWARD! 2024, 2024, : 241 - 265
  • [44] Empirical Analysis of the Growth and Challenges of New Programming Languages
    Chakraborty, Partha
    Shahriyar, Rifat
    Iqbal, Anindya
    2019 IEEE 43RD ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 1, 2019, : 191 - 196
  • [45] Empirical Evidence of the Usage of Programming Languages in the Educational Process
    Vinueza-Morales, Mariuxi
    Borrego, Diana
    A. Galindo, Jose
    Benavides, David
    IEEE TRANSACTIONS ON EDUCATION, 2021, 64 (03) : 213 - 222
  • [46] Using Knowledge Units of Programming Languages to Recommend Reviewers for Pull Requests: An Empirical Study
    Ahasanuzzaman, Md
    Oliva, Gustavo A.
    Hassan, Ahmed E.
    arXiv, 2023,
  • [47] Using knowledge units of programming languages to recommend reviewers for pull requests: an empirical study
    Md Ahasanuzzaman
    Gustavo A. Oliva
    Ahmed E. Hassan
    Empirical Software Engineering, 2024, 29
  • [48] Using knowledge units of programming languages to recommend reviewers for pull requests: an empirical study
    Ahasanuzzaman, Md
    Oliva, Gustavo A.
    Hassan, Ahmed E.
    EMPIRICAL SOFTWARE ENGINEERING, 2024, 29 (01)
  • [49] An Empirical Study on Impact of Programming Languages on Performance of Open-source Serverless Platforms
    Ataie, E.
    Pooshani, M.
    Aqasizade, H.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2025, 38 (02): : 424 - 435
  • [50] Comparing extended classifier system and genetic programming for financial forecasting: an empirical study
    Mu-Yen Chen
    Kuang-Ku Chen
    Heien-Kun Chiang
    Hwa-Shan Huang
    Mu-Jung Huang
    Soft Computing, 2007, 11 : 1173 - 1183