Article

Towards a primitive higher order calculus of broadcasting systems

Authors:

Karol Ostrovsky,

K. V. S. Prasad,

Walid TahaAuthors Info & Claims

PPDP '02: Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming

Pages 2 - 13

https://doi.org/10.1145/571157.571159

Published: 06 October 2002 Publication History

Abstract

Ethernet-style broadcast is pervasive style of computer communication.In this style,the medium is single nameless channel.Previous work on modelling such systems proposed .rst order process calculus called CBS.In this paper, we propose fundamentally different calculus called HOBS.Compared to CBS, HOBS 1) is higher order rather than first order, 2) supports dynamic subsystem encapsulation rather than static,and 3) does not require an "underlying language" to be Turing-complete. Moving to higher order calculus is key to increasing the expressivity of the primitive calculus and alleviating the need for an underlying language. The move, however, raises the need for significantly more machinery to establish the basic properties of the new calculus.This paper develops the basic theory for HOBS and presents two example programs that illustrate programming in this language. The key technical underpinning is an adaptation of Howe's method to HOBS to prove that bisimulation is congruence. From this result, HOBS is shown to embed the lazy λ-calculus.

References

[1]

Samson Abramsky. The lazy lambd calculus. In D. Turner, editor, Research topics in Functional Programming . Addison-Wesley, 1990.]]

Digital Library

[2]

Bryan Bayerdorffer. Distributed programming with associative broadcast.In Proceedings of the 27th Annual Hawaii International Conference on Systems Sciences volume 2:Software Technology (HICSS92-2), pages 353--362, Wailea, HW, USA, 1994.]]

[3]

Luca Cardelli, Giorgio Ghelli, and Andrew D.Gordon. Secrecy and group creation.In Catuscia Palamidessi, editor, CONCUR 2000,volume 1877 of LNCS, University Park, PA, USA, August 2000. Springer.]]

Digital Library

[4]

Luca Cardelli and Andrew D. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177--213, Jun 2000.]]

Digital Library

[5]

Cristian Ene and Traian Muntean. Expressivness of point-to-point versus broadcast communications. In Fundamentals of Computation Theory, volume 1684 of LNCS, September 1999.]]

Digital Library

[6]

Cristian Ene and Traian Muntean. A broadcast-based calculus for communicating systems. In 6th International Workshop on Formal Methods for Parallel Programming:Theory and Applications, San Francisco, 2001.]]

[7]

William Ferreira, Matthew Hennessy,and Alan Jeffrey. A theory of weak bisimulation for core CML. Journal of Functional Programming, 8(5):447--491, 1998.]]

Digital Library

[8]

Cedric Fournet and Georges Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pages 372--385. ACM, January 1996.]]

Digital Library

[9]

Andrew D. Gordon. Bisimilarity as a theory of functional programming: mini-course. Notes Series BRICS-NS-95-3, BRICS, Department of Computer Science,University of Aarhus,July 1995.]]

[10]

Douglas J.Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103--112,1 February 1996.]]

Digital Library

[11]

Robin Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall,1989.]]

Digital Library

[12]

Robin Milner. Communicating and Mobile Systems: the Π-Calculus. Cambridge University Press,1999.]]

Digital Library

[13]

Eugenio Moggi.Notions of computation and monads. Information and Computation, 93(1), 1991.]]

Digital Library

[14]

Karol Ostrovsky,K.V.S.Prasad,and Walid Taha. Towards primitive higher order calculus of broadcasting systems (extended version).URL: http://www.cs.chalmers.se/.karol/Papers/,March 2001.]]

[15]

K.V.S.Prasad.Status report on ongoing work: Higher order broadcasting systems and reasoning about broadcasts.Unpublished manuscript, September 1994.]]

[16]

K.V.S.Prasad.A calculus of broadcasting systems. Science of Computer Programming, 25, 1995.]]

Digital Library

[17]

K.V.S.Prasad.Broadcast calculus interpreted in CCSupto bisimulation.In EXPRESS '01:8th International Workshop on Expressiveness in Concurrency,Electronic Notes in Theoretical Computer Science.Elsevier,2001.]]

[18]

Davide Sangiorgi.Expressing Mobility in Process Algebras:First-Order and Higher-Order Paradigms. PhD thesis CST. 99. 93, Department of Computer Science, University of Edinburgh, 1992.]]

[19]

Bent Thomsen.Plain CHOCS:A second generation calculus for higher order processes.Acta Informatica, 30(1):1--59, January 1993.]]

Digital Library

[20]

David N.Turner. The Polymorphic Pi-Calculus: Theory and Implementation .PhD thesis CST .126 .96, Dept.of Computer Science,University of Edinburgh, 1996.(also published as ECS-LFCS-96-345).]]

Cited By

Alrahman YDe Nicola RLoreti MTiezzi FVigo RWainwright RCorchado JBechini AHong J(2015)A calculus for attribute-based communicationProceedings of the 30th Annual ACM Symposium on Applied Computing10.1145/2695664.2695668(1840-1845)Online publication date: 13-Apr-2015
https://dl.acm.org/doi/10.1145/2695664.2695668
Wu XZhu H(2015)A Calculus for Wireless Sensor Networks from Quality PerspectiveProceedings of the 2015 IEEE 16th International Symposium on High Assurance Systems Engineering10.1109/HASE.2015.40(223-231)Online publication date: 8-Jan-2015
https://dl.acm.org/doi/10.1109/HASE.2015.40
Wu XZhu HWu X(2015)Observation-Oriented Semantics for Calculus of Wireless SystemsUnifying Theories of Programming10.1007/978-3-319-14806-9_6(105-124)Online publication date: 6-Jan-2015
https://doi.org/10.1007/978-3-319-14806-9_6
Show More Cited By

Index Terms

Towards a primitive higher order calculus of broadcasting systems
1. Software and its engineering
  1. Software creation and management
    1. Software development techniques
  2. Software notations and tools
    1. General programming languages
2. Theory of computation
  1. Logic
  2. Semantics and reasoning
    1. Program semantics
      1. Operational semantics

Recommendations

On Graphs for Intuitionistic Modal Logics

We present a graph approach to intuitionistic modal logics, which provides uniform formalisms for expressing, analysing and comparing Kripke-like semantics. This approach uses the flexibility of graph calculi to express directly and intuitively possible-...
Self-Formalisation of Higher-Order Logic

We present a mechanised semantics for higher-order logic (HOL), and a proof of soundness for the inference system, including the rules for making definitions, implemented by the kernel of the HOL Light theorem prover. Our work extends Harrison's ...
Primitive recursion for higher-order abstract syntax

Higher-order abstract syntax is a central representation technique in logical frameworks which maps variables of the object language into variables of the meta-language. It leads to concise encodings, but is incompatible with functions defined by ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPDP '02: Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming

October 2002

219 pages

ISBN:1581135289

DOI:10.1145/571157

Conference Chair:
Frank Pfenning
Carnegie Mellon University
,
Program Chair:
Claude Kirchner
LORIA & INRIA, France

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 October 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PPDP02

Sponsor:

SIGPLAN

PPDP02: Principles and Practice of Declarative Programming 2002

October 6 - 8, 2002

PA, Pittsburgh, USA

Acceptance Rates

PPDP '02 Paper Acceptance Rate 18 of 36 submissions, 50%;

Overall Acceptance Rate 230 of 486 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
252
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Alrahman YDe Nicola RLoreti MTiezzi FVigo RWainwright RCorchado JBechini AHong J(2015)A calculus for attribute-based communicationProceedings of the 30th Annual ACM Symposium on Applied Computing10.1145/2695664.2695668(1840-1845)Online publication date: 13-Apr-2015
https://dl.acm.org/doi/10.1145/2695664.2695668
Wu XZhu H(2015)A Calculus for Wireless Sensor Networks from Quality PerspectiveProceedings of the 2015 IEEE 16th International Symposium on High Assurance Systems Engineering10.1109/HASE.2015.40(223-231)Online publication date: 8-Jan-2015
https://dl.acm.org/doi/10.1109/HASE.2015.40
Wu XZhu HWu X(2015)Observation-Oriented Semantics for Calculus of Wireless SystemsUnifying Theories of Programming10.1007/978-3-319-14806-9_6(105-124)Online publication date: 6-Jan-2015
https://doi.org/10.1007/978-3-319-14806-9_6
Prasad K(2014)Themes in Broadcast CalculiProceedings of the 2014 IEEE 13th International Symposium on Parallel and Distributed Computing10.1109/ISPDC.2014.34(16-22)Online publication date: 24-Jun-2014
https://dl.acm.org/doi/10.1109/ISPDC.2014.34
Wu XZhu H(2013)Linking Operational Semantics and Algebraic Semantics for Wireless NetworksFormal Methods and Software Engineering10.1007/978-3-642-41202-8_25(380-396)Online publication date: 2013
https://doi.org/10.1007/978-3-642-41202-8_25
Martins FLopes LBarros J(2010)Towards the Safe Programming of Wireless Sensor NetworksElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.17.517(49-62)Online publication date: 6-Feb-2010
https://doi.org/10.4204/EPTCS.17.5
Singh ARamakrishnan CSmolka S(2010)A process calculus for Mobile Ad Hoc NetworksScience of Computer Programming10.1016/j.scico.2009.07.00875:6(440-469)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1016/j.scico.2009.07.008
Merro M(2009)An Observational Theory for Mobile Ad Hoc Networks (full version)Information and Computation10.1016/j.ic.2007.11.010207:2(194-208)Online publication date: 1-Feb-2009
https://dl.acm.org/doi/10.1016/j.ic.2007.11.010
Godskesen J(2009)A Calculus for Mobile Ad-hoc Networks with Static Location BindingElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2009.06.018242:1(161-183)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1016/j.entcs.2009.06.018
Gunter EYasmeen A(2009)Secure Broadcast AmbientsFormal Aspects in Security and Trust10.1007/978-3-642-01465-9_17(257-271)Online publication date: 5-Apr-2009
https://dl.acm.org/doi/10.1007/978-3-642-01465-9_17
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents