Creol: a type-safe object-oriented model for distributed concurrent systems
Theoretical Computer Science - Components and objects
Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects
Electronic Notes in Theoretical Computer Science (ENTCS)
An Open System Operational Semantics for an Object-Oriented and Component-Based Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Intra-Object versus Inter-Object: Concurrency and Reasoning in Creol
Electronic Notes in Theoretical Computer Science (ENTCS)
Tool Support for Holistic Modelling of Distributed Embedded Systems in Creol
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A complete guide to the future
ESOP'07 Proceedings of the 16th European conference on Programming
Compositional reasoning about shared futures
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Reducing the verification cost of evolving product families using static analysis techniques
Science of Computer Programming
| Hi-index | 0.00 |
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in distributed and unstable networks. Second, the common model of thread concurrency makes reasoning about program behavior very challenging. A model based on concurrent objects communicating by means of asynchronous method calls has been proposed to combine object orientation and distribution in a more satisfactory way. This paper introduces a reasoning system for this model, focusing on simplicity and modularity. We believe that a simple and compositional proof system is paramount to allow verification of real programs. The proposed proof rules are derived from the Hoare rules of a standard sequential language by means of a semantic encoding preserving soundness and relative completeness.