Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
8-2013
Abstract
Search-based techniques can be used to identify whether a concurrent program exhibits faults such as race conditions, deadlocks, and starvation: a fitness function is used to guide the search to a region of the program’s state space in which these concurrency faults are more likely occur. In this short paper, we propose that contracts specified by the developer as part of the program’s implementation could be used to provide additional guidance to the search. We sketch an example of how contracts might be used in this way, and outline our plans for investigating this verification approach.
Keywords
Model Check, Metaheuristic Algorithm, Concurrent Program, Race Condition, Java Modeling Language
Discipline
Theory and Algorithms
Research Areas
Software and Cyber-Physical Systems
Publication
Search Based Software Engineering: 5th International Symposium, SSBSE 2013, St. Petersburg, Russia, August 24-26, Proceedings
Volume
8084
First Page
263
Last Page
268
ISBN
9783642397424
Identifier
10.1007/978-3-642-39742-4_22
Publisher
Springer
City or Country
Berlin
Citation
POSKITT, Christopher M. and POULDING, Simon.
Using contracts to guide the search-based verification of concurrent programs. (2013). Search Based Software Engineering: 5th International Symposium, SSBSE 2013, St. Petersburg, Russia, August 24-26, Proceedings. 8084, 263-268.
Available at: https://ink.library.smu.edu.sg/sis_research/4914
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1007/978-3-642-39742-4_22