Skip to main content
Conference ProceedingsOPEN ACCESS

Web cube

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4229 LNCS 77-92
DOI: 10.1007/11888116_6
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper introduces a refinement of Misra's Seuss logic, called Web Cube, that provides a model for programming and reasoning over web applications. It features black box composition of web services so that services offered by large systems, such as that of a back-end database, can be treated abstractly and consistently. It inherits the light weight feature of Seuss, which relies on an abstract view towards concurrency control, which leads to a less error-prone style of distributed programming, backed by a clean logic. © IFIP International Federation for Information Processing 2006.

Cite

CITATION STYLE

APA

Prasetya, I. S. W. B., Vos, T. E. J., & Swierstra, S. D. (2006). Web cube. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4229 LNCS, pp. 77–92). Springer Verlag. https://doi.org/10.1007/11888116_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free