A model and proof system for asynchronous networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A model and proof system for asynchronous networks

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the fourth annual ACM symposium on Principles of distributed computing table of contents

Minaki, Ontario, Canada

Pages: 49 - 58

Year of Publication: 1985

ISBN:0-89791-168-7

Author

Bengt Jonsson

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 16

Additional Information:

cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/323596.323601 What is a DOI?

CITED BY 16

	J. Widom , D. Gries , F. B. Schneider, Completeness and incompleteness of trace-based network proof systems, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.27-38, January 21-23, 1987, Munich, West Germany
	Marcel kyas , Frank S. de Boer , Willem-paul de Roever, A compositional trace logic for behavioural interface specifications, Nordic Journal of Computing, v.12 n.2, p.116-132, August 2005
	Bengt Jonsson, Compositional specification and verification of distributed systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.2, p.259-303, March 1994
	B. Jonsson, A fully abstract trace model for dataflow networks, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.155-165, January 11-13, 1989, Austin, Texas, United States
	Michele Boreale , Rocco De Nicola , Rosario Pugliese, Trace and testing equivalence on asynchronous processes, Information and Computation, v.172 n.2, p.139-164, January 29, 2002
	Bengt Jonsson, Modular verification of asynchronous networks, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.152-166, August 10-12, 1987, Vancouver, British Columbia, Canada
	F. S. de Boer , M. Gabbrielli , M. C. Meo, A denotational semantics for Timed Linda, Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, p.28-36, September 05-07, 2001, Florence, Italy
	Jennifer Widom , David Gries , Fred B. Schneider, Trace-based network proof systems: expressiveness and completeness, ACM Transactions on Programming Languages and Systems (TOPLAS), v.14 n.3, p.396-416, July 1992
	Frank S. De Boer , Maurizio Gabbrielli , Maria Chiara Meo, Proving correctness of timed concurrent constraint programs, ACM Transactions on Computational Logic (TOCL), v.5 n.4, p.706-731, October 2004
	David Griffioen , Frits Vaandrager, A theory of normed simulations, ACM Transactions on Computational Logic (TOCL), v.5 n.4, p.577-610, October 2004
	Wil Janssen , Mannes Poel , Job Zwiers, The compositional approach to sequential consistency and lazy caching, Distributed Computing, v.12 n.2/3, p.105-127, June 1999
	Paritosh K. Pandya , Mathai Joseph, P-A logic: a compositional proof system for distributed programs, Distributed Computing, v.5 n.1, p.37-54, June 1991
	Bengt Jonsson, A fully abstract trace model for dataflow and asynchronous networks, Distributed Computing, v.7 n.4, p.197-212, May 1994
	Giorgio Delzanno , Maurizio Gabbrielli , Maria Chiara Meo, A compositional semantics for CHR, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.209-217, July 11-13, 2005, Lisbon, Portugal
	Frank S. de Boer , Maurizio Gabbrielli , Maria C. Meo, A Timed Linda Language and its Denotational Semantics, Fundamenta Informaticae, v.63 n.4, p.309-330, December 2004
	Maurizio Gabbrielli , Maria Chiara Meo, A compositional semantics for CHR, ACM Transactions on Computational Logic (TOCL), v.10 n.2, p.1-36, February 2009