Zobrazit v EDS

Mutation-based exploration of a method for verifying concurrent Java components

Uloženo v:
Podrobná bibliografie
Název: Mutation-based exploration of a method for verifying concurrent Java components
Autoři: Long, B. J., Duke, R. W., Goldson, D. W., Strooper, P. A., Wildman, L. P.
Přispěvatelé: B. Monien
Informace o vydavateli: The IEEE Computer Society
Rok vydání: 2004
Sbírka: The University of Queensland: UQ eSpace
Témata: 280302 Software Engineering, E1, 700199 Computer software and services not elsewhere classified
Popis: Summary form only given. The Java programming language supports concurrency. Concurrent programs are harder to verify than their sequential counterparts due to their inherent nondeterminism and a number of specific concurrency problems such as interference and deadlock. In previous work, we proposed a method for verifying concurrent Java components based on a mix of code inspection, static analysis tools, and the ConAn testing tool. The method was derived from an analysis of concurrency failures in Java components, but was not applied in practice. In this paper, we explore the method by applying it to an implementation of the well-known readers-writers problem and a number of mutants of that implementation. We only apply it to a single, well-known example, and so we do not attempt to draw any general conclusions about the applicability or effectiveness of the method. However, the exploration does point out several strengths and weaknesses in the method, which enable us to fine-tune the method before we carry out a more formal evaluation on other, more realistic components.
Druh dokumentu: conference object
Jazyk: English
Relation: orcid:0000-0003-4789-2897
Dostupnost: https://espace.library.uq.edu.au/view/UQ:100723
Přístupové číslo: edsbas.2ACFD918
Databáze: BASE
Popis
Abstrakt:Summary form only given. The Java programming language supports concurrency. Concurrent programs are harder to verify than their sequential counterparts due to their inherent nondeterminism and a number of specific concurrency problems such as interference and deadlock. In previous work, we proposed a method for verifying concurrent Java components based on a mix of code inspection, static analysis tools, and the ConAn testing tool. The method was derived from an analysis of concurrency failures in Java components, but was not applied in practice. In this paper, we explore the method by applying it to an implementation of the well-known readers-writers problem and a number of mutants of that implementation. We only apply it to a single, well-known example, and so we do not attempt to draw any general conclusions about the applicability or effectiveness of the method. However, the exploration does point out several strengths and weaknesses in the method, which enable us to fine-tune the method before we carry out a more formal evaluation on other, more realistic components.