Abstract
The ATF Calculus is a kernel language for wide-area network programming languages, with atomic failure semantics as its central organizing principle.
Chapter PDF
Similar content being viewed by others
References
Martin Abadi and Andrew Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148 (1): 1–70, January 1999.
D. Scott Alexander, William A. Arbaugh, Michael W. Hicks, Pankaj Kakkar, Angelos D. Keromytis, Jonathan T. Moore, Carl A. Gunter, Scott M. Nettles, and Jonathan M. Smith. The Switchware active network architecture. IEEE Network Special Issue on Active and Controllable Networks, 12 (3): 29–36, 1998.
R.M. Amadio and S. Prasad. Localities and failures. In P. S. Thiagarajan, editor, Proceedings of 14th Conference on Foundations of Software Technology and Theoretical Computer Science, number 880 in Lecture Notes in Computer Science, pages 205–216. Springer-Verlag, 1995.
Roberto Amadio. An asynchronous model of locality, failure, and process mobility. In Coordination ‘87, 1997.
P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96 (1): 217–248, 1992.
Luca Cardelli. Abstractions for mobile computation. In Jan Vitek and Christian Jensen, editors, Secure Internet Programming: Security Issues for Distributed and Mobile Objects, volume 1603 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
Luca Cardelli and Andrew Gordon. Mobile ambients. In Maurice Ni-vat, editor, Foundations of Software Science and Computational Structures, volume 1378 of Lecture Notes in Computer Science, pages 140–155. Springer-Verlag, 1998.
Luca Cardelli and Andrew Gordon. Types for mobile ambients. In Proceedings of ACM Symposium on Principles of Programming Languages,San Antonio, January 1999. ACM Press.
Guiseppe Castagna and Jan Vitek. A calculus of secure mobile computations. In Internet Programming Languages, Lecture Notes in Computer Science. Springer-Verlag, 1999.
M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32 (2): 374–382, 1985.
Cédric 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, St. Petersburg Beach, Florida, January 1996. ACM.
Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, and Didier Rémy. A calculus of mobile agents. In 7th International Conference on Concurrency Theory (CONCUR’96), pages 406–421, Pisa, Italy, August 1996. Springer-Verlag. LNCS 1119.
V. Hadzilacos. On the relationship between the atomic commitment and consensus problems. In B. Simons and A. Z. Spector, editors, Fault-Tolerant Distributed Computing, volume 448 of Lecture Notes in Computer Science, pages 201–208. Springer-Verlag, 1990.
N. Haines, D. Kindred, J. G. Morrisett, and S. M. Nettles. Composing first-class transactions. ACM Transactions on Programming Languages and Systems, 16 (6): 1719–1736, November 1994.
J. Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37 (3): 549–587, 1990.
Matthew Hennessy and James Riely. Type-safe execution of mobile agents in anonymous networks. In Secure Internet Programming: Security Issues for Distributed and Mobile Objects, Lecture Notes in Computer Science. Springer-Verlag, 1999.
Michael Hicks, Pankaj Kakkar, Jonathan T. Moore, Carl A. Gunter, and Scott Nettles. PLAN: A packet language for active networks. In Proceedings of ACM International Conference on Functional Programming. ACM Press, September 1998.
Butler Lampson. Atomic transactions. In B. Lampson, M. Paul, and H. Siegert, editors, Distributed Systems Architecture and Implementation, volume 205 of Lecture Notes in Computer Science, pages 246–285. Springer-Verlag, 1981.
Barbara Liskov. Distributed programming in Argus. Communications of the ACM, 31 (3), March 1988.
Nancy Lynch, Michael Merritt, William Weihl, and Alan Fekete. Atomic Transactions. Morgan-Kaufman, 1994.
Robin Milner. Communication and Concurrency. Prentice-Hall, 1989.
Robin Milner. The polyadic 7L-calculus: A tutorial. In Friedrich L. Bauer, Wilfried Brauer, and Helmut Schwichtenberg, editors, Logic and Algebra of Specification, volume 94 of Computer and Systems Sciences, pages 203–246. Springer-Verlag, 1993.
J. E. B. Moss. Nested Transactions: An Approach to Reliable Distributed Computing. MIT Press, 1985.
James Riely and Matthew Hennessy. Distributed processes and location failures. In Proceedings of the International Conference on Automata, Languages and Programming, 1997.
James Riely and Matthew Hennessy. Trust and partial typing in open systems of mobile agents. In Proceedings of ACM Symposium on Principles of Programming Languages, 1999.
Davide Sangiorgi. Asynchronous process calculi: The first-order and higher-order paradigms. Theoretical Computer Science, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 IFIP International Federation for Information Processing
About this paper
Cite this paper
Duggan, D. (2000). Atomic Failure in Wide-Area Computation. In: Smith, S.F., Talcott, C.L. (eds) Formal Methods for Open Object-Based Distributed Systems IV. FMOODS 2000. IFIP Advances in Information and Communication Technology, vol 49. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35520-7_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-35520-7_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-1018-2
Online ISBN: 978-0-387-35520-7
eBook Packages: Springer Book Archive