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. © 2013 Springer-Verlag.
CITATION STYLE
Poskitt, C. M., & Poulding, S. (2013). Using contracts to guide the search-based verification of concurrent programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8084 LNCS, pp. 263–268). https://doi.org/10.1007/978-3-642-39742-4_22
Mendeley helps you to discover research relevant for your work.