Skip to main content
SpringerLink
Log in

Intensional and Extensional Characterisation of Global Progress in the π-Calculus

  • Conference paper
CONCUR 2012 – Concurrency Theory (CONCUR 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7454))

Included in the following conference series:

Abstract

We introduce an observational theory of global progress properties such as non-blockingness and wait-freedom based on a linear π-calculus. The theory uniformly captures such properties both extensionally and intensionally, by using fair transition relations and partial failures, which represent stalling activities. A fairness-enriched bisimilarity preserves these properties and is a congruence. The framework is applied to the semantic characterisation and separation results for concurrent data structures including different queue implementations.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Acciai, L., Boreale, M.: Responsiveness in process calculi. TCS 409(1), 59–93 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Amit, D., Rinetzky, N., Reps, T., Sagiv, M., Yahav, E.: Comparison Under Abstraction for Verifying Linearizability. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 477–490. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Berger, M., Honda, K., Yoshida, N.: Sequentiality and the π-Calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 29–45. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Cacciagrano, D., Corradini, F., Palamidessi, C.: Explicit fairness in testing semantics. LMCS 5(2:15), 27 pages (2007)

    Google Scholar 

  5. Dongol, B.: Formalising Progress Properties of Non-blocking Programs. In: Liu, Z., Kleinberg, R.D. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 284–303. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Fossati, L., Honda, K., Yoshida, N.: The extended version of the present paper (June 2012), http://www.eecs.qmul.ac.uk/~luca/CONCURextended.pdf

  7. Fuzzati, R., Merro, M., Nestmann, U.: Distributed Consensus, revisited. Acta Inf. 44(6), 377–425 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Francez, N.: Fairness. Springer (1986)

    Google Scholar 

  9. Goetz, B.: Java Concurrency in Practice. Addison-Wesley (2008)

    Google Scholar 

  10. Gotsman, A., Cook, B., Parkinson, M., Vafeiadis, V.: Proving that non-blocking algorithms don’t block. In: POPL 2009, pp. 16–28. ACM (2009)

    Google Scholar 

  11. Gotsman, A., Yang, H.: Liveness-Preserving Atomicity Abstraction. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 453–465. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: ICDCS 2003, pp. 522–529. IEEE Computer Society (2003)

    Google Scholar 

  13. Herlihy, M., Sharit, B.: The Art of Multiprocessor Programming. Morgan Kaufmann (2009)

    Google Scholar 

  14. Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. TOPLAS 12(3), 463–492 (1990)

    Article  Google Scholar 

  15. Honda, K., Yoshida, N.: A uniform type structure for secure information flow. In: POPL 2002, pp. 81–92. ACM (2002)

    Google Scholar 

  16. Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the Pi-calculus. TOPLAS 21(5), 914–947 (1999)

    Article  Google Scholar 

  17. Kobayashi, N., Sangiorgi, D.: A Hybrid Type System for Lock-Freedom of Mobile Processes. TOPLAS 32(5:16), 49 pages (2010)

    Google Scholar 

  18. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–564 (1978)

    Article  MATH  Google Scholar 

  19. Lauer, H.C., Needham, R.M.: On the duality of operating system structures. SIGOPS Operating Systems Review 13(2), 3–19 (1979)

    Article  Google Scholar 

  20. Lea, D., et al.: Java Concurrency Package (2003), http://gee.cs.oswego.edu/dl

  21. Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: PODC 1996, pp. 267–275. ACM (1996)

    Google Scholar 

  22. Sangiorgi, D.: The name discipline of uniform receptiveness. TCS 221(1-2), 457–493 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  23. Schacham, O., Bronson, N., Aiken, A., Sagiv, M., Vechev, M., Yahav, E.: Testing atomicity of composed concurrent operations. In: OOPSLA 2011, pp. 51–64. ACM (2011)

    Google Scholar 

  24. Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming. Pearson–Prentice Hall (2006)

    Google Scholar 

  25. Tokoro, M., Vasconcelos, V.: A Typing System for a Calculus of Objects. In: Nishio, S., Yonezawa, A. (eds.) ISOTAS 1993. LNCS, vol. 742, pp. 460–474. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  26. Treiber, R.K.: Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center (1986)

    Google Scholar 

  27. Walker, D.: Automated analysis of mutual exclusion algorithms using CCS. Formal Aspects of Computing 1(3), 273–292 (1989)

    Article  MATH  Google Scholar 

  28. Yoshida, N., Berger, M., Honda, K.: Strong Normalisation in the π-Calculus. Information and Computation 191(2), 145–202 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Queen Mary University of London, UK

    Luca Fossati & Kohei Honda

  2. Imperial College London, UK

    Luca Fossati & Nobuko Yoshida

Authors
  1. Luca Fossati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kohei Honda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nobuko Yoshida
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Newcastle University, Claremont Tower, Claremont Road, NE1 7RU, Newcastle upon Tyne, UK

    Maciej Koutny

  2. Department of Computer Science, University of Leicester, Computer Science Building, University Road, LE1 7RH, Leicester, UK

    Irek Ulidowski

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fossati, L., Honda, K., Yoshida, N. (2012). Intensional and Extensional Characterisation of Global Progress in the π-Calculus. In: Koutny, M., Ulidowski, I. (eds) CONCUR 2012 – Concurrency Theory. CONCUR 2012. Lecture Notes in Computer Science, vol 7454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32940-1_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32940-1_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32939-5

  • Online ISBN: 978-3-642-32940-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation