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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alba, E., Chicano, F., Ferreira, M., Gomez-Pulido, J.: Finding deadlocks in large concurrent Java programs using genetic algorithms. In: Proc. 10th Annual Conference on Genetic and Evolutionary Computation, pp. 1735–1742 (2008)
Bhattacharya, N., El-Mahi, O., Duclos, E., Beltrame, G., Antoniol, G., Le Digabel, S., Guéhéneuc, Y.-G.: Optimizing threads schedule alignments to expose the interference bug pattern. In: Fraser, G., Teixeira de Souza, J. (eds.) SSBSE 2012. LNCS, vol. 7515, pp. 90–104. Springer, Heidelberg (2012)
Chalin, P., Kiniry, J.R., Leavens, G.T., Poll, E.: Beyond assertions: Advanced specification and verification with JML and ESC/Java2. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 342–363. Springer, Heidelberg (2006)
Godefroid, P., Khurshid, S.: Exploring very large state spaces using genetic algorithms. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 266–280. Springer (2002)
Meyer, B.: Object-Oriented Software Construction, 2nd edn. Prentice Hall (1997)
Nienaltowski, P.: Practical framework for contract-based concurrent object-oriented programming. Ph.D. thesis, ETH Zürich (2007)
Shousha, M., Briand, L.C., Labiche, Y.: A UML/MARTE model analysis method for uncovering scenarios leading to starvation and deadlocks in concurrent systems. IEEE Transactions on Software Engineering 38(2), 354–374 (2012)
Staunton, J., Clark, J.A.: Searching for safety violations using estimation of distribution algorithms. In: Proc. 3rd International Workshop on Search-Based Software Testing, pp. 212–221 (2010)
Tracey, N.J.: A Search-Based Automated Test-Data Generation Framework for Safety-Critical Software. Ph.D. thesis, The University of York (2000)
West, S., Nanz, S., Meyer, B.: Demonic testing of concurrent programs. In: Aoki, T., Taguchi, K. (eds.) ICFEM 2012. LNCS, vol. 7635, pp. 478–493. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poskitt, C.M., Poulding, S. (2013). Using Contracts to Guide the Search-Based Verification of Concurrent Programs. In: Ruhe, G., Zhang, Y. (eds) Search Based Software Engineering. SSBSE 2013. Lecture Notes in Computer Science, vol 8084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39742-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-39742-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39741-7
Online ISBN: 978-3-642-39742-4
eBook Packages: Computer ScienceComputer Science (R0)