Skip to main content
SpringerLink
Log in

A mechanized refinement proof of the Chase–Lev deque using a proof system

  • Published:
Computing Aims and scope Submit manuscript

Abstract

We present a linearizability proof for the concurrent Chase–Lev work-stealing queue (WSQ) implementation on sequentially consistent memory. We used the CIVL proof system to carry out the proof. The lowest-level description of the WSQ is the data structure code described in terms of fine-grained actions whose atomicity is guaranteed by hardware. Higher level descriptions consist of increasingly coarser action blocks obtained using a combination of Owicki–Gries (OG) annotations and reduction and abstraction. We believe that the OG annotations (location invariants) we provided to carry out the refinement proofs at each level provide insight into the correctness of the algorithm. The top-level description for the WSQ consists of a single atomic action for each data structure operation, where the specification of the action is tight enough to show that the WSQ data structure is linearizable.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. CIVL proof files can be obtained from: http://msrc.ku.edu.tr/projects/chase-lev-wsq/.

References

  1. Arora NS, Blumofe RD, Plaxton CG (2001) Thread scheduling for multiprogrammed multiprocessors. Theory Comput Syst 34(2):115–144

    Article  MathSciNet  MATH  Google Scholar 

  2. Chase D, Lev Y (2005) Dynamic circular work-stealing deque. In: Proceedings of the seventeenth annual ACM symposium on parallelism in algorithms and architectures. ACM, pp 21–28

  3. Dodds M, Haas A, Kirsch CM (2015) A scalable, correct time-stamped stack. ACM SIGPLAN Not 50(1):233–246

    Article  MATH  Google Scholar 

  4. Elmas T, Qadeer S, Tasiran S (2009) A calculus of atomic actions. In: ACM symposium on principles of programming languages. Association for Computing Machinery, Inc., p 14. http://research.microsoft.com/apps/pubs/default.aspx?id=70608. Retrieved 25 Sept 2017

  5. Frigo M, Leiserson CE, Randall KH (1998) The implementation of the Cilk-5 multithreaded language. In: ACM Sigplan Notices. ACM, vol 33, pp 212–223

  6. Hawblitzel C, Qadeer S, Tasiran S (2015) Automated and modular refinement reasoning for concurrent programs. In: Computer aided verification

  7. Herlihy M, Luchangco V, Moir M (2003) Obstruction-free synchronization: Double-ended queues as an example. In: Distributed computing systems, 2003. Proceedings. 23rd international conference on, IEEE, pp 522–529

  8. Khorsandi Aghai M (2012) Verification of work-stealing deque implementation. Master’s thesis, Uppsala University

  9. Lê NM, Pop A, Cohen A, Zappa Nardelli F (2013) Correct and efficient work-stealing for weak memory models. In: ACM SIGPLAN Notices, vol 48. ACM, pp 69–80

  10. Lipton RJ (1975) Reduction: a method of proving properties of parallel programs. Commun ACM 18(12):717–721

    Article  MathSciNet  MATH  Google Scholar 

  11. Liu F, Nedev N, Prisadnikov N, Vechev M, Yahav E (2012) Dynamic synthesis for relaxed memory models. In: ACM SIGPLAN Notices, vol 47. ACM, pp 429–440

  12. Michael MM, Vechev MT, Saraswat VA (2009) Idempotent work stealing, vol 44. ACM

  13. Morrison A, Afek Y (2014) Fence-free work stealing on bounded TSO processors. ACM SIGPLAN Not 49(4):413–426

    Google Scholar 

  14. Owicki S, Gries D (1976) An axiomatic proof technique for parallel programs I. Acta Inform 6(4):319–340

    Article  MathSciNet  MATH  Google Scholar 

  15. Travkin O, Wehrheim H (2014) Handling TSO in mechanized linearizability proofs. In: Haifa verification conference. Springer, pp 132–147

Download references

Author information

Authors and Affiliations

  1. Koc University, Istanbul, Turkey

    Suha Orhun Mutluergil

  2. Amazon Web Services, New York, NY, USA

    Serdar Tasiran

Authors
  1. Suha Orhun Mutluergil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serdar Tasiran
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suha Orhun Mutluergil.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mutluergil, S.O., Tasiran, S. A mechanized refinement proof of the Chase–Lev deque using a proof system. Computing 101, 59–74 (2019). https://doi.org/10.1007/s00607-018-0635-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-018-0635-4

Keywords

Mathematics Subject Classification

Search

Navigation