Mutation-based exploration of a method for verifying concurrent Java components
Saved in:
| Title: | Mutation-based exploration of a method for verifying concurrent Java components |
|---|---|
| Authors: | Long, Brad, Duke, Roger, Goldson, Doug, Strooper, Paul, Wildman, Luke |
| Publication Year: | 2004 |
| Collection: | The University of Queensland: UQ eSpace |
| Subject Terms: | 2200 Engineering |
| Description: | The Java programming language supports concurrency. Concurrent programs are harder to verify than their sequential counterparts due to their inherent non-determinism 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 will enable us to fine-tune the method before we carry out a more formal evaluation on other, more realistic components. |
| Document Type: | conference object |
| Language: | English |
| Relation: | orcid:0000-0003-4789-2897 |
| Availability: | https://espace.library.uq.edu.au/view/UQ:9f65dba |
| Accession Number: | edsbas.FC114F7D |
| Database: | BASE |
Nájsť tento článok vo Web of Science Be the first to leave a comment!