Skip to main content
SpringerLink
Log in

Logic of Global Synchrony

  • Conference paper
  • First Online:
Book cover CONCUR 2001 — Concurrency Theory (CONCUR 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2154))

Included in the following conference series:

Abstract

An intermediate-level specification notation, Logs, is presented for PRAM/BSP-style programming. It extends pre-post style semantics to reveal state at points of global synchronization before termination (if that occurs). The result is an integration of the pre-post, finite and reactive-process styles of specification and in particular an extension of standard BSP. The language is provided with a complete set of laws, formulated to benefit from a simple predicative semantics and to be quite close to programming intuition. The language is compositional, and parallel composition is simply logical conjunction. Use of Logs, and of the laws for reasoning about it, is demonstrated on the problem of the dining philosophers.

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. J.A. Bergstra and J.W. Klop, Algebra of communicating processes with abstraction, Theoretical Computer Science, 37(1): 77–121, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  2. K.M. Chandy and J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988.

    Google Scholar 

  3. Y. Chen, How to write a healthiness condition, 2nd International Conference on Integrated Formal Methods, LNCS, 1945:299–317, Springer-Verlag, 2000.

    Google Scholar 

  4. Y. Chen and J.W. Sanders, Weakest specifunctions for BSP, Parallel Processing Letters (to appear) 2001.

    Google Scholar 

  5. Y. Chen and J.W. Sanders, Logic of global synchrony, Technical Report, RR-01-01, (http://web.comlab.ox.ac.uk/oucl/publications/tr/index.html), Oxford University Computing Laboratory, 2001.

  6. Y. Chen, Formal Methods for Global Synchrony, D.Phil. Thesis, Oxford University Computing Laboratory, 2001.

    Google Scholar 

  7. Y. Chen, Fixpoints of non-monotonic functions, Technical Report 29, (http://www.mcs.le.ac.uk/techreports/2001/tr-2001-29.ps.gz), Department of Mathematics and Computer Science, University of Leicester, 2001.

  8. J. Davies and S. Schneider, A brief history of Timed CSP, Theoretical Computer Science, 138: 243–271, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  9. E.W. Dijkstra, Guarded commands, non-determinacy and the formal derivation of programs, Communications of the ACM, 18: 453–457, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  10. E.W. Dijkstra, Two starvation free solutions to general exclusion problem, EWD 625, plataanstraat 5, 5671 Al Nuenen, The Netherlands, 1978.

    Google Scholar 

  11. S. Fortune and J. Wyllie, Parallelism in random access machines. Proc. 10th Annual ACM Symposium on Theory of Computing: 114–118, 1978.

    Google Scholar 

  12. M.W. Goudreau et al. A proposal for the BSP world-wide standard library (preliminary version), 1996.

    Google Scholar 

  13. C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, 1985.

    Google Scholar 

  14. C.A.R. Hoare and J. He, Unifying Theories of Programming, Prentice Hall, 1998.

    Google Scholar 

  15. L. Lamport, A temporal logic of actions, ACM Transctions on Programming Languages and Systems, 16(3): 872–923, 1994.

    Article  Google Scholar 

  16. D.S. Lecomber, Methods ofBSP Programming, Oxford University Computing Laboratory DPhil. thesis, 1998.

    Google Scholar 

  17. W.F. McColl, Scalability, portability and predictability: The BSP approach to parallel programming, Future Generation Computer Systems 12: 265–272, 1996.

    Article  Google Scholar 

  18. R. Milner, Communication and Concurrency, Prentice Hall, 1989.

    Google Scholar 

  19. G. Nelson, A generalization of Dijkstra’s calculus, ACM Transactions on Programming Languages and Systems, 11(4):517–561, 1989.

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. D.B. Skillicorn, Building BSP programs using the refinement calculus, Formal Methods for Parallel Programming and Applications, IPPS/SPDP’98, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, UK

    Yifeng Chen

  2. Programming Research Group, Oxford University Computing Laboratory, Parks Road, Oxford, OX1 3QD, UK

    J. W. Sanders

Authors
  1. Yifeng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. W. Sanders
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, BRICS, Aalborg University, Fredrik Bajersvej 7, 9220, Aalborg, Denmark

    Kim G. Larsen

  2. BRICS, Aarhus University, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Sanders, J.W. (2001). Logic of Global Synchrony. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-44685-0_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42497-0

  • Online ISBN: 978-3-540-44685-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation