Skip to main content
SpringerLink
Log in

Enabling Modular Verification with Abstract Interference Specifications for a Concurrent Queue

  • Conference paper
  • First Online:
Verified Software. Theories, Tools, and Experiments (VSTTE 2016)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9971))

Abstract

When concurrent threads of execution do not modify shared data, their parallel execution is trivially equivalent to their sequential execution. For many imperative programming languages, however, the modular verification of this independence is often frustrated by (i) the possibility of aliasing between variables mentioned in different threads, and (ii) the lack of abstraction in the description of read/write effects of operations on shared data structures. We describe a specification and verification framework in which abstract specifications of functional behavior are augmented with abstract interference effects that permit verification of client code with concurrent calls to operations of a data abstraction. To illustrate the approach, we present a classic concurrent data abstraction: the bounded queue. Three different implementations are described, each with different degrees of entanglement and hence different degrees of possible synchronization-free concurrency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    A string is a sequence of values such as . The string concatenation operator is o.

References

  1. Bagherzadeh, M., Rajan, H.: Panini: a concurrent programming model for solving pervasive and oblivious interference. In: Proceedings of the 14th International Conference on Modularity, MODULARITY 2015, pp. 93–108. ACM, New York (2015)

    Google Scholar 

  2. Harms, D.E., Weide, B.W.: Copying and swapping: influences on the design of reusable software components. IEEE Trans. Softw. Eng. 17, 424–435 (1991)

    Article  Google Scholar 

  3. Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco (2008)

    Google Scholar 

  4. Kulczycki, G.W.: Direct reasoning. Ph.D. thesis, Clemson University, Clemson, SC, USA (2004). AAI3125470

    Google Scholar 

  5. Leino, K.R.M., Müller, P., Smans, J.: Verification of concurrent programs with chalice. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD 2007/2008/2009. LNCS, vol. 5705, pp. 195–222. Springer, Heidelberg (2009). doi:10.1007/978-3-642-03829-7_7

    Chapter  Google Scholar 

  6. Mostowski, W.: Dynamic frames based verification method for concurrent Java programs. In: Gurfinkel, A., Seshia, S.A. (eds.) VSTTE 2015. LNCS, vol. 9593, pp. 124–141. Springer, Heidelberg (2016). doi:10.1007/978-3-319-29613-5_8

    Chapter  Google Scholar 

  7. Rodríguez, E., Dwyer, M., Flanagan, C., Hatcliff, J., Leavens, G.T.: Extending JML for modular specification and verification of multi-threaded programs. In: Black, A.P. (ed.) ECOOP 2005. LNCS, vol. 3586, pp. 551–576. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Sitaraman, M., Adcock, B., Avigad, J., Bronish, D., Bucci, P., Frazier, D., Friedman, H.M., Harton, H., Heym, W., Kirschenbaum, J., Krone, J., Smith, H., Weide, B.W.: Building a push-button resolve verifier: progress and challenges. Formal Aspects Comput. 23(5), 607–626 (2011)

    Article  Google Scholar 

  9. Smans, J., Jacobs, B., Piessens, F.: VeriCool: an automatic verifier for a concurrent object-oriented language. In: Barthe, G., Boer, F.S. (eds.) FMOODS 2008. LNCS, vol. 5051, pp. 220–239. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68863-1_14

    Chapter  Google Scholar 

Download references

Acknowledgments

This research is funded in part by NSF grants CCF-1161916 and DUE-1022941. Any opinions, findings, conclusions, or recommendations expressed here are those of the authors and do not necessarily reflect the views of the NSF.

Author information

Authors and Affiliations

  1. The Ohio State University, Columbus, Ohio, 43221, USA

    Alan Weide & Paolo A. G. Sivilotti

  2. Clemson University, Clemson, South Carolina, 29634, USA

    Murali Sitaraman

Authors
  1. Alan Weide
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paolo A. G. Sivilotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Murali Sitaraman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alan Weide .

Editor information

Editors and Affiliations

  1. IRISA, University of Rennes 1, Rennes, France

    Sandrine Blazy

  2. Department of Computer Science, University of Toronto, Toronto, Ontario, Canada

    Marsha Chechik

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Weide, A., Sivilotti, P.A.G., Sitaraman, M. (2016). Enabling Modular Verification with Abstract Interference Specifications for a Concurrent Queue. In: Blazy, S., Chechik, M. (eds) Verified Software. Theories, Tools, and Experiments. VSTTE 2016. Lecture Notes in Computer Science(), vol 9971. Springer, Cham. https://doi.org/10.1007/978-3-319-48869-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48869-1_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48868-4

  • Online ISBN: 978-3-319-48869-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation